English
Related papers

Related papers: Improving the five-point bootstrap

200 papers

We introduce SDPB: an open-source, parallelized, arbitrary-precision semidefinite program solver, designed for the conformal bootstrap. SDPB significantly outperforms less specialized solvers and should enable many new computations. As an…

High Energy Physics - Theory · Physics 2015-02-10 David Simmons-Duffin

We investigate the constraints of crossing symmetry on CFT correlation functions. Four point conformal blocks are naturally viewed as functions on the upper-half plane, on which crossing symmetry acts by PSL(2,Z) modular transformations.…

High Energy Physics - Theory · Physics 2017-08-02 Alexander Maloney , Henry Maxfield , Gim Seng Ng

The operator product expansion (OPE) of the Wilson surface operators in six-dimensional (2, 0) superconformal field theory is studied from AdS/CFT correspondence in this paper. We compute the OPE coefficients of the chiral primary operators…

High Energy Physics - Theory · Physics 2008-11-26 Bin Chen , Chang-Yong Liu , Jun-Bao Wu

The determinant method in the conformal bootstrap is applied for the critical phenomena of a single polymer in arbitrary $D$ dimensions. The scale dimensions (critical exponents) of the polymer ($2< D \le 4$) and the branched polymer ($3 <…

High Energy Physics - Theory · Physics 2019-12-06 S. Hikami

In this work we initiate a positive semi-definite numerical bootstrap program for multi-point correlators. Considering six-point functions of operators on a line we reformulate the crossing symmetry equation for a pair of comb-channel…

High Energy Physics - Theory · Physics 2024-06-19 António Antunes , Sebastian Harris , Apratim Kaviraj , Volker Schomerus

We consider convex-concave saddle point problems with a separable structure and non-strongly convex functions. We propose an efficient stochastic block coordinate descent method using adaptive primal-dual updates, which enables flexible…

Machine Learning · Statistics 2015-11-24 Zhanxing Zhu , Amos J. Storkey

The RG functions of the 2D $n$-vector $\phi^4$ model are calculated in the five-loop approximation. Perturbative series for the $\beta$ function and critical exponents are resummed by the Pade-Borel and Pade-Borel-Leroy techniques,…

High Energy Physics - Theory · Physics 2016-03-08 E. V. Orlov , A. I. Sokolov

In our earlier work [Fareed et al., Comput. Math. Appl. 75 (2018), no. 6, 1942-1960], we proposed an incremental SVD algorithm with respect to a weighted inner product to compute the proper orthogonal decomposition (POD) of a set of…

Numerical Analysis · Mathematics 2021-02-01 Hiba Fareed , John R. Singler

We consider the dimensional reduction of a CFT, breaking multiplets of the d-dimensional conformal group SO(d+1,1) up into multiplets of SO(d,1). This leads to an expansion of d-dimensional conformal blocks in terms of blocks in d-1…

High Energy Physics - Theory · Physics 2016-09-21 Matthijs Hogervorst

We build the Z$_{3}$ invariants fusion rules associated to the (D$_{4}$,A$_{6}$) conformal algebra. This algebra is known to describe the tri-critical Potts model. The 4-pt correlation functions of critical fields are developed in the…

High Energy Physics - Theory · Physics 2009-11-10 S. Balaska , K. Demmouche

We develop the theory of irregular conformal blocks of the Virasoro algebra. In previous studies, expansions of irregular conformal blocks at regular singular points were obtained as degeneration limits of regular conformal blocks; however,…

Mathematical Physics · Physics 2016-01-20 Hajime Nagoya

We consider operators in N=4 SYM theory which are dual, at strong coupling, to classical strings rotating in S^5. Three point correlation functions of such operators factorize into a universal contribution coming from the AdS part of the…

High Energy Physics - Theory · Physics 2015-05-30 Romuald A. Janik , Andrzej Wereszczynski

We show that the correlator of three large charge operators with minimal scaling dimension can be computed semiclassically in CFTs with a $U(1)$ symmetry for arbitrary fixed values of the ratios of their charges. We obtain explicitly the…

High Energy Physics - Theory · Physics 2021-04-21 Gabriel Cuomo

He and Yuan's prediction-correction framework [SIAM J. Numer. Anal. 50: 700-709, 2012] is able to provide convergent algorithms for solving separable convex optimization problems at a rate of $O(1/t)$ ($t$ represents iteration times) in…

Optimization and Control · Mathematics 2024-02-06 Tao Zhang , Yong Xia , Shiru Li

We consider a framework for the construction of iterative schemes for operator equations that combine low-rank approximation in tensor formats and adaptive approximation in a basis. Under fairly general assumptions, we obtain a rigorous…

Numerical Analysis · Mathematics 2014-03-17 Markus Bachmayr , Wolfgang Dahmen

This research concerns design optimization problems involving numerous design parameters and large computational models. These problems generally consist in non-convex constrained optimization problems in large and sometimes complex search…

Optimization and Control · Mathematics 2024-12-20 A. Batou

The n-point functions of any Conformal Field Theory (CFT) in $d$ dimensions can always be interpreted as spatial restrictions of corresponding functions in a higher-dimensional CFT with dimension $d'> d$. In particular, when a four-point…

High Energy Physics - Theory · Physics 2026-01-08 Ferdinando Gliozzi

We study the three-point energy correlator (EEEC), defined as a matrix element of a product of three energy detectors at different locations on the celestial sphere. Lorentz symmetry implies that the EEEC can be decomposed into special…

High Energy Physics - Theory · Physics 2023-03-22 Cyuan-Han Chang , David Simmons-Duffin

In this thesis, we consider two approaches to the study of correlation functions in one-dimensional defect Conformal Field Theories (dCFT$_1$), in particular those defined by 1/2-BPS Wilson line defects in the three- and four-dimensional…

High Energy Physics - Theory · Physics 2023-10-30 Gabriel J. S. Bliard

Aligning partially overlapping point sets where there is no prior information about the value of the transformation is a challenging problem in computer vision. To achieve this goal, we first reduce the objective of the robust point…

Computer Vision and Pattern Recognition · Computer Science 2020-07-07 Wei Lian , WangMeng Zuo , Lei Zhang