Abstract

We develop the technology for Polyakov-Mellin (PM) bootstrap in one- dimensional conformal field theories (CFT1). By adding appropriate contact terms, we bootstrap various effective field theories in AdS2 and analytically compute the CFT data to one loop. The computation can be extended to higher orders in perturbation theory, if we ignore mixing, for any external dimension. We develop PM bootstrap for O(N ) theories and derive the necessary contact terms for such theories (which also involves a new higher gradient contact term absent for N = 1). We perform cross-checks which include considering the diagonal limit of the 2d Ising model in terms of the 1d PM blocks. As an independent check of the validity of the results obtained with PM bootstrap, we propose a suitable basis of transcendental functions, which allows to fix the four-point correlators of identical scalar primaries completely, up to a finite number of ambiguities related to the number of contact terms in the PM basis. We perform this analysis both at tree level (with and without exchanges) and at one loop. We also derive expressions for the corresponding CFT data in terms of harmonic sums. Finally, we consider the Regge limit of one-dimensional correlators and derive a precise connection between the latter and the large-twist limit of CFT data. Exploiting this result, we study the crossing equation in the three OPE limits and derive some universal constraints for the large-twist limit of CFT data in Regge-bounded theories with a finite number of exchanges.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.