Related papers: Universal bounds for spherical codes: the Levensht…
A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…
We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…
We show an alternative proof of the sharpest known lower bound for the logarithmic energy on the unit sphere $\mathbb{S}^2$. We then generalize this proof to get new lower bounds for the Green energy on the unit $n$-sphere $\mathbb{S}^n$.
We consider the coding problem in the Stiefel manifold with chordal distance. After considering various low-dimensional instances of this problem, we use Rankin's bounds on spherical codes to prove upper bounds on the minimum distance of a…
Inspired by the boolean discrepancy problem, we study the following optimization problem which we term \textsc{Spherical Discrepancy}: given $m$ unit vectors $v_1, \dots, v_m$, find another unit vector $x$ that minimizes $\max_i \langle x,…
Quantum metrology promises improved sensitivity in parameter estimation over classical procedures. However, there is an extensive debate over the question how the sensitivity scales with the resources (such as the average photon number) and…
We derive the first positivity bounds for low-energy Effective Field Theories (EFTs) that are not invariant under Lorentz boosts. "Positivity bounds" are the low-energy manifestation of certain fundamental properties in the UV -- to date…
For $t \in [-1, 1)$, a set of points on the $(n-1)$-dimensional unit sphere is called $t$-almost equiangular if among any three distinct points there is a pair with inner product $t$. We propose a semidefinite programming upper bound for…
We establish $L^{p_1}(\mathbb R^d) \times \cdots \times L^{p_n}(\mathbb R^d) \rightarrow L^r(\mathbb R^d)$ bounds for spherical averaging operators $\mathcal A^n$ in dimensions $d \geq 2$ for indices $1\le p_1,\dots , p_n\le \infty$ and…
We show that within any quantum stabilizer code there lurks a classical binary linear code with similar error-correcting capabilities, thereby demonstrating new connections between quantum codes and classical codes. Using this result --…
The model problem of a plane angle for a second-order elliptic system subject to Dirichlet, mixed, and Neumann boundary conditions is analyzed. For each boundary condition, the existence of solutions of the form $r^\lambda v$ is reduced to…
R. W. Hamming published the Hamming codes and the sphere packing bound in 1950. In the past 75 years, infinite families of distance-optimal linear codes over finite fields with minimum distance at most 8 with respect to the sphere packing…
We investigate a two-dimensional statistical model of N charged particles interacting via logarithmic repulsion in the presence of an oppositely charged compact region K whose charge density is determined by its equilibrium potential at an…
In a general supersymmetric standard model there is an upper bound $m_h$ on the tree level mass of the $CP=+1$ lightest Higgs boson which depends on the electroweak scale, $\tan \beta$ and the gauge and Yukawa couplings of the theory. When…
We derive a linear programming bound on the maximum cardinality of error-correcting codes in the sum-rank metric. Based on computational experiments on relatively small instances, we observe that the obtained bounds outperform all…
Efficient global optimization is a widely used method for optimizing expensive black-box functions such as tuning hyperparameter, and designing new material, etc. Despite its popularity, less attention has been paid to analyzing the…
The capacity of a graph is defined as the rate of exponential grow of independent sets in the strong powers of the graph. In strong power, an edge connects two sequences if at each position letters are equal or adjacent. We consider a…
We reconsider the possibility that all standard model gauge couplings blow up at a common scale in the ultraviolet. The simplest implementation of this idea assumes supersymmetry and the addition of a single vector-like generation of matter…
Assuming the existence of a local, analytic, unitary UV completion in a Poincar\'{e} invariant scalar field theory with a mass gap, we derive an infinite number of positivity requirements using the known properties of the amplitude at and…
Lipschitz decomposition is a useful tool in the design of efficient algorithms involving metric spaces. While many bounds are known for different families of finite metrics, the optimal parameters for $n$-point subsets of $\ell_p$, for $p >…