JuliBootS: a hands-on guide to the conformal bootstrap

Abstract

We introduce {\tt JuliBootS}, a package for numerical conformal bootstrap computations coded in {\tt Julia}. The centre-piece of {\tt JuliBootS} is an implementation of Dantzig's simplex method capable of handling arbitrary precision linear programming problems with continuous search spaces. Current supported features include conformal dimension bounds, OPE bounds, and bootstrap with or without global symmetries. The code is trivially parallelizable on one or multiple machines. We exemplify usage extensively with several real-world applications. In passing we give a pedagogical introduction to the numerical bootstrap methods.

29 pages

References in corpus (5)

• Solving the 3d Ising Model with the Conformal Bootstrap II. c-Minimization and Precise Critical Exponents
• Bounds on 4D Conformal and Superconformal Field Theories
• Bounds in 4D Conformal Field Theories with Global Symmetry
• The $\mathcal{N}=8$ Superconformal Bootstrap in Three Dimensions
• Central Charge Bounds in 4D Conformal Field Theory

Cited by in corpus (5)

• A Semidefinite Program Solver for the Conformal Bootstrap
• Inverse Bootstrapping Conformal Field Theories
• New method for the conformal bootstrap with OPE truncations
• General Bootstrap Equations in 4D CFTs
• Charging Up the Functional Bootstrap