Related papers: Accurate bootstrap bounds from optimal interpolati…
A numerical scheme is described for accurately accommodating oblique, non-aligned, boundaries, on a three-dimensional cartesian grid. The scheme gives second-order accuracy in the solution for potential of Poisson's equation using compact…
We consider a family of Gagliardo-Nirenberg-Sobolev interpolation inequalities which interpolate between Sobolev's inequality and the logarithmic Sobolev inequality, with optimal constants. The difference of the two terms in the…
In a common formulation of semi-infinite programs, the infinite constraint set is a requirement that a function parametrized by the decision variables is nonnegative over an interval. If this function is sufficiently closely approximable by…
We establish sufficient conditions of exact and almost full recovery of the node partition in Bipartite Stochastic Block Model (BSBM) using polynomial time algorithms. First, we improve upon the known conditions of almost full recovery by…
We consider the problem of bounding CFT correlators on the Euclidean section. By reformulating the question as an optimization problem, we construct functionals numerically which determine upper and lower bounds on correlators under several…
In computational practice, we often encounter situations where only measurements at equally spaced points are available. Using standard polynomial interpolation in such cases can lead to highly inaccurate results due to numerical…
In this paper, we analyze the convergence and optimality of a standard adaptive nonconforming linear element method for the Stokes problem. After establishing a special quasi--orthogonality property for both the velocity and the pressure in…
Submodular function minimization is well studied, and existing algorithms solve it exactly or up to arbitrary accuracy. However, in many applications, such as structured sparse learning or batch Bayesian optimization, the objective function…
This paper investigates the spectral norm version of the column subset selection problem. Given a matrix $\mathbf{A}\in\mathbb{R}^{n\times d}$ and a positive integer $k\leq\text{rank}(\mathbf{A})$, the objective is to select exactly $k$…
We compute observables of the critical 3d Ising model to high precision by applying the numerical conformal bootstrap to mixed correlators of the leading scalar operators $\sigma$ and $\epsilon$, and the stress tensor $T_{\mu\nu}$. We…
We propose a novel approach to study conformal field theories (CFTs) in general dimensions. In the conformal bootstrap program, one usually searches for consistent CFT data that satisfy crossing symmetry. In the new approach, we reverse the…
The paper is concerned with the sparse approximation of functions having hybrid regularity borrowed from the theory of solutions to electronic Schr\"odinger equations due to Yserentant [43]. We use hyperbolic wavelets to introduce…
This paper is concerned with estimating the intersection point of two densities, given a sample of both of the densities. This problem arises in classification theory. The main results provide lower bounds for the probability of the…
We continue the study of optimal chordal packings, with emphasis on packing subspaces of dimension greater than one. Following a principle outlined in a previous work, where the authors use maximal affine block designs and maximal sets of…
In this long overdue second installment, we continue to develop the conformal bootstrap program for ${\mathcal N}=4$ superconformal field theories in four dimensions via an analysis of the correlation function of four stress-tensor…
The submodular knapsack problem (SKP), which seeks to maximize a submodular set function by selecting a subset of elements within a given budget, is an important discrete optimization problem. The majority of existing approaches to solving…
We develop an interpolation-based framework for noisy linear systems with unknown system matrix with bounded norm (implying bounded growth or non-increasing energy), and bounded process noise energy. The proposed approach characterizes all…
In astrophysical and cosmological analyses, the increasing quality and volume of astronomical data demand efficient and precise computational tools. This work introduces a novel adaptive algorithm for automatic knots (AutoKnots) allocation…
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…
We use modern bootstrap techniques to study half-BPS line defects in 4d N=4 superconformal theories. Specifically, we consider the 1d CFT with OSP(4*|4) superconformal symmetry living on such a defect. Our analysis is general and based only…