Related papers: Accurate bootstrap bounds from optimal interpolati…
We use the conformal bootstrap program to derive necessary conditions for emergent symmetry enhancement from discrete symmetry (e.g. $\mathbb{Z}_n$) to continuous symmetry (e.g. $U(1)$) under the renormalization group flow. In three…
For any real numbers $B \ge 1$ and $\delta \in (0, 1)$ and function $f: [0, B] \rightarrow \mathbb{R}$, let $d_{B; \delta} (f) \in \mathbb{Z}_{> 0}$ denote the minimum degree of a polynomial $p(x)$ satisfying $\sup_{x \in [0, B]} \big| p(x)…
Consider the Poisson equation with the Dirichlet boundary condition on a three-dimensional polyhedral domain. For singular solutions from the non-smoothness of the domain boundary, we propose new anisotropic tetrahedral mesh refinement…
Given a function f defined on a bidimensional bounded domain and a positive integer N, we study the properties of the triangulation that minimizes the distance between f and its interpolation on the associated finite element space, over all…
We propose a novel method for training deep neural networks that are capable of interpolation, that is, driving the empirical loss to zero. At each iteration, our method constructs a stochastic approximation of the learning objective. The…
We consider the numerical approximation of variational problems with orthotropic growth, that is those where the integrand depends strongly on the coordinate directions with possibly different growth in each direction. Under realistic…
Applications of the bootstrap program to superconformal field theories promise unique new insights into their landscape and could even lead to the discovery of new models. Most existing results of the superconformal bootstrap were obtained…
These lectures were given at the Weizmann Institute in the spring of 2019. They are intended to familiarize students with the nuts and bolts of the numerical bootstrap as efficiently as possible. After a brief review of the basics of…
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…
We study the problem of maximizing a monotone submodular function subject to a Multiple Knapsack constraint. The input is a set $I$ of items, each has a non-negative weight, and a set of bins of arbitrary capacities. Also, we are given a…
In this thesis, we introduce new tools for the conformal bootstrap, autoboot and qboot. Each tool solves a different step in the whole computational stack, and combined with an existing efficient tool SDPB which solves semidefinite…
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…
In this note we report an improved determination of the scaling dimensions and OPE coefficients of the minimal supersymmetric extension of the 3d Ising model using the conformal bootstrap. We also show how this data can be used as input to…
We study half-BPS line defects in $\mathcal{N}=2$ superconformal theories using the bootstrap approach. We concentrate on local excitations constrained to the defect, which means the system is a $1d$ defect CFT with $\mathfrak{osp}(4^*|2)$…
We introduce a novel type of approximation spaces for functions with values in a nonlinear manifold. The discrete functions are constructed by piecewise polynomial interpolation in a Euclidean embedding space, and then projecting pointwise…
The numerical conformal bootstrap has become in the last 15 years an indispensable tool for studying strongly coupled CFTs in various dimensions. Here we review the main developments in the field in the last 5 years, since the appearance of…
In this paper, we investigate the problem of designing compact support interpolation kernels for a given class of signals. By using calculus of variations, we simplify the optimization problem from an infinite nonlinear problem to a finite…
Motivated by the need to better understand the properties of sparse cutting-planes used in mixed integer programming solvers, the paper [2] studied the idealized problem of how well a polytope is approximated by the use of sparse valid…
We apply recently constructed functional bases to the numerical conformal bootstrap for 1D CFTs. We argue and show that numerical results in this basis converge much faster than the traditional derivative basis. In particular, truncations…
The conformal bootstrap is applied to percolation and dilute self-avoiding polymers, two theories with Virasoro central charge $c=0$ in two dimensions. In both cases we propose a spectrum of operators motivated by Virasoro symmetry which is…