JuliBootS: a hands-on guide to the conformal bootstrap

TL;DR

JuliBootS is a Julia package that facilitates numerical conformal bootstrap computations, offering features like dimension bounds, OPE bounds, and support for global symmetries, with extensive real-world examples and parallelization capabilities.

Contribution

It introduces JuliBootS, a novel Julia-based tool implementing Dantzig's simplex method for conformal bootstrap problems, including a pedagogical introduction and practical applications.

Findings

Effective bounds on conformal dimensions demonstrated

Parallelizable code enhances computational efficiency

Real-world applications validate the package's utility

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.