Related papers: Lining up a Positive Semi-Definite Six-Point Boots…
We give the first approximation algorithm for mixed packing and covering semidefinite programs (SDPs) with polylogarithmic dependence on width. Mixed packing and covering SDPs constitute a fundamental algorithmic primitive with recent…
The purpose of this note is to report, in narrative rather than rigorous style, about the nice geometry of $6$-division points on the Fermat cubic $F$ and various conics naturally attached to them. Most facts presented here were derived by…
For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on…
A method for obstructing symmetry enhancement in numerical conformal bootstrap calculations is proposed. Symmetry enhancement refers to situations where bootstrap studies initialised with a certain symmetry end up allowing theories with…
We compute $M$-point conformal blocks with scalar external and exchange operators in the so-called comb configuration for any $M$ in any dimension $d$. Our computation involves repeated use of the operator product expansion to increase the…
We present a new algorithm for the numerical evaluation of five-point conformal blocks in $d$-dimensions, greatly improving the efficiency of their computation. To do this we use an appropriate ansatz for the blocks as a series expansion in…
Given bounded selfadjoint operators $A$ and $B$ acting on a Hilbert space $\mathcal{H}$, consider the linear pencil $P(\lambda)=A+\lambda B$, $\lambda\in\mathbb{R}$. The set of parameters $\lambda$ such that $P(\lambda)$ is a positive…
The completely bounded trace and spectral norms, for finite-dimensional spaces, are known to be efficiently expressible by semidefinite programs (J. Watrous, Theory of Computing 5: 11, 2009). This paper presents two new, and arguably much…
The expectation value of a smooth conformal line defect in a CFT is a conformal invariant functional of its path in space-time. For example, in large $N$ holographic theories, these fundamental observables are dual to the open string…
Polynomial optimization encompasses a broad class of problems in which both the objective function and constraints are polynomial functions of the decision variables. In recent years, a substantial body of research has focused on…
We consider the four-point correlator of the stress tensor multiplet in N=4 SYM. We construct all solutions consistent with crossing symmetry in the limit of large central charge c ~ N^2 and large g^2 N. While we find an infinite tower of…
We consider the six-vertex model with the rational weights on an $s\times N$ square lattice, $s\leq N$, with partial domain wall boundary conditions. We study the one-point function at the boundary where the free boundary conditions are…
We investigate $O(N)$ boundary conformal field theories (BCFTs) with boundary interactions in $d=4-\epsilon$ and $d=3-\epsilon$ employing the analytic bootstrap. By deriving universal constraints on conformal data, we show that infinitely…
Boundary conformal field theory (BCFT) is the study of conformal field theory (CFT) on manifolds with a boundary. We can use conformal symmetry to constrain correlation functions of conformal invariant fields. We compute two-point and…
In this letter we study how the exact non-perturbative integrability methods in 4D N=4 Super-Yang-Mills can work efficiently together with the numerical conformal bootstrap techniques to go beyond the spectral observables and access…
We study three-point correlation functions of scalar operators in conformal field theories with boundaries and interfaces. We focus on two cases where there are one bulk and two boundary operators (B$\partial\partial$), or two bulk and one…
We use the embedding formalism to study correlation functions of a d-dimensional Euclidean CFT in the presence of a $q$ co-dimensional defect. The defect breaks the global conformal group $SO(d+1,1)$ into $SO(d-q+1,1) \times SO(q)$. We…
We present a method for solving the general mixed constrained convex quadratic programming problem using an active set method on the dual problem. The approach is similar to existing active set methods, but we present a new way of solving…
We study various correlation functions (two and three point functions) in a large $N$ matrix model of six commuting matrices with a numerical Monte Carlo algorithm. This is equivalent to a model of a gas of particles in six dimensions with…
The robust truss topology optimization against the uncertain static external load can be formulated as mixed-integer semidefinite programming. Although a global optimal solution can be computed with a branch-and-bound method, it is very…