2019
DOI: 10.1007/jhep05(2019)087
|View full text |Cite
|
Sign up to set email alerts
|

Fast conformal bootstrap and constraints on 3d gravity

Abstract: The crossing equations of a conformal field theory can be systematically truncated to a finite, closed system of polynomial equations. In certain cases, solutions of the truncated equations place strict bounds on the space of all unitary CFTs. We describe the conditions under which this holds, and use the results to develop a fast algorithm for modular bootstrap in 2d CFT. We then apply it to compute spectral gaps to very high precision, find scaling dimensions for over a thousand operators, and extend the num… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
112
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
9

Relationship

2
7

Authors

Journals

citations
Cited by 76 publications
(114 citation statements)
references
References 56 publications
2
112
0
Order By: Relevance
“…Extending this success, the modern modular bootstrap program has been developed to study, among others, a medium temperature expansion of the torus partition function and its consistency with modular invariance. It generalizes the Cardy constraints on the heavy operators to, in particular, the gap and degeneracies in the spectrum in any 2d CFT [30][31][32][33][34][35][36]. It has been proven that the lightest primary operator above the vacuum is universally bounded from above by c 6 + 0.474 for all c > 1 CFTs [30].…”
Section: Modular Bootstrapmentioning
confidence: 80%
See 1 more Smart Citation
“…Extending this success, the modern modular bootstrap program has been developed to study, among others, a medium temperature expansion of the torus partition function and its consistency with modular invariance. It generalizes the Cardy constraints on the heavy operators to, in particular, the gap and degeneracies in the spectrum in any 2d CFT [30][31][32][33][34][35][36]. It has been proven that the lightest primary operator above the vacuum is universally bounded from above by c 6 + 0.474 for all c > 1 CFTs [30].…”
Section: Modular Bootstrapmentioning
confidence: 80%
“…It has been proven that the lightest primary operator above the vacuum is universally bounded from above by c 6 + 0.474 for all c > 1 CFTs [30]. In the large c limit, this bound has recently been improved to c 9.1 + O(1) [36]. In the presence of a Z 2 topological defect line L, we can consider torus partition functions with L extending along the time or spatial direction, which we denote as Z L (τ,τ ) and Z L (τ,τ ), respectively.…”
Section: Modular Bootstrapmentioning
confidence: 99%
“…This bound has since been improved numerically as well as analytically in various ways [9][10][11][12][13][14][15], in particular using the linear programming method introduced in [16]. So far, in the large-c limit the best analytic bound is [13] ∆ 0 ≤ c/8.503, while the numerical upper bound, obtained by extrapolating large-c data, is [12] ∆ 0 ≤ c/9.08. Other bounds can be found by assuming complete factorization of the partition function into a holomorphic and an antiholomorphic part [17].…”
Section: Introductionmentioning
confidence: 99%
“…The simplest (though by no means the only) set of constraints on the gap arise from modular invariance of the CFT partition function. This is the "modular bootstrap" program pioneered by Hellerman [4] and pursued by several authors [5][6][7].…”
Section: Jhep12(2019)048mentioning
confidence: 99%