|
Résumé |
Recently, a qualitatively new class of rigorous bounds on CFT data was shown to be
numerically computable from the crossing equations of six-point functions.
However, this six-point bootstrap requires solving non-standard optimization
problems involving infinite-dimensional matrices, which has limited its
applicability and scalability in early implementations. In this talk, these
challenges are overcome by exploiting the sparsity structure of the problem. The
result is a reformulation into standard optimization problems already familiar in
the conformal bootstrap and efficiently solvable with existing numerical tools.
This insight makes the new bounds practically accessible. As an illustration,
novel non-perturbative bounds whose extremal correlators interpolate between the
six-point functions of the generalized free fermion and boson are discussed. These
are compared with perturbative deformations of the massive free boson in AdS$_2$. |
