Related papers: Analytic Euclidean Bootstrap
This work addresses the problem of simulating Gaussian random fields that are continuously indexed over a class of metric graphs, termed graphs with Euclidean edges, being more general and flexible than linear networks. We introduce three…
We consider the problem of sampling from the uniform distribution on the set of Eulerian orientations of subgraphs of the triangular lattice. Although it is known that this can be achieved in polynomial time for any graph, the algorithm…
We introduce a non-unitary-compatible numerical bootstrap strategy based on the statistical stability of OPE data inferred from crossing at multiple cross-ratios. For a trial spectrum, crossing determines OPE coefficients whose residual…
Recently an efficient numerical method has been developed to implement the constraints of crossing symmetry and unitarity on the operator dimensions and OPE coefficients of conformal field theories (CFT) in diverse space-time dimensions. It…
In the spirit of the Head-Gordon-Pople algorithm, we report vertical, transfer and horizontal recurrence relations for the efficient and accurate computation of four-electron integrals over Gaussian basis functions. Our recursive approach…
We study the tricritical Ising universality class using conformal bootstrap techniques. By studying bootstrap constraints originating from multiple correlators on the CFT data of multiple OPEs, we are able to determine the scaling dimension…
Euclidean embeddings of data are fundamentally limited in their ability to capture latent semantic structures, which need not conform to Euclidean spatial assumptions. Here we consider an alternative, which embeds data as discrete…
Three-dimensional theories with cubic symmetry are studied using the machinery of the numerical conformal bootstrap. Crossing symmetry and unitarity are imposed on a set of mixed correlators, and various aspects of the parameter space are…
We use analytic bootstrap techniques for a CFT with an interface or a boundary. Exploiting the analytic structure of the bulk and boundary conformal blocks we extract the CFT data. We further constrain the CFT data by applying the equation…
We develop a new general algorithm for finding a regular tight-binding lattice Hamiltonian in infinite dimensions for an arbitrary given shape of the density of states (DOS). The availability of such an algorithm is essential for the…
We derive bounds on Wilson coefficients in gravitational effective field theories using fully crossing symmetric dispersion relations. These sum rules naturally isolate finite subsets of low-energy couplings without relying on the forward…
Finding a method to combine the numerical bootstrap with the analytic lightcone bootstrap is an important goal to advance the conformal bootstrap program. We propose a hybrid bootstrap method to do just that. The numerical and analytic…
We apply analytic bootstrap techniques to the four-point correlator of fundamental fields in the Wilson-Fisher model. In an $\epsilon$-expansion crossing symmetry fixes the double discontinuity of the correlator in terms of CFT data at…
Recently equations for the generating functional in the perturbative quantum chromodynamics (QCD) have been extended by including the non-perturbative dissipation in QCD jets. The resulting equations have been solved rigorously and new…
We study the constraints of crossing symmetry and unitarity in general 3D Conformal Field Theories. In doing so we derive new results for conformal blocks appearing in four-point functions of scalars and present an efficient method for…
We set up the conventional conformal bootstrap equations in Mellin space and analyse the anomalous dimensions and OPE coefficients of large spin double trace operators. By decomposing the equations in terms of continuous Hahn polynomials,…
A general expansion scheme based on the concept of linked cluster expansion from the theory of classical spin systems is constructed for models of interacting electrons. It is shown that with a suitable variational formulation of mean-field…
We describe examples of drastic truncations of conformal bootstrap equations encoding much more information than that obtained by a direct numerical approach. A three-term truncation of the four point function of a free scalar in any space…
The binary Euclidean algorithm is a modification of the classical Euclidean algorithm for computation of greatest common divisors which avoids ordinary integer division in favour of division by powers of two only. The expectation of the…
We develop the analytic bootstrap in several directions. First, we discuss the appearance of nonperturbative effects in the Lorentzian inversion formula, which are exponentially suppressed at large spin but important at finite spin. We show…