Related papers: On polarization of spherical codes and designs
Many of the classic problems of coding theory are highly symmetric, which makes it easy to derive sphere-packing upper bounds and sphere-covering lower bounds on the size of codes. We discuss the generalizations of sphere-packing and…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
We derive lower bounds on the maximal rates for multiple packings in high-dimensional Euclidean spaces. Multiple packing is a natural generalization of the sphere packing problem. For any $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $, a multiple…
We use methods of approximation theory to find the absolute minima on the sphere of the potential of spherical $(2m-3)$-designs with a non-trivial index $2m$ that are contained in a union of $m$ parallel hyperplanes, $m\geq 2$, whose…
We use linear programming techniques to find points of absolute minimum over the unit sphere $S^{d}$ in $\mathbb R^{d+1}$ of the total potential of a point configuration $\omega_N\subset S^{d}$ which is a spherical $(2m-1)$-design contained…
The densest local packing (DLP) problem in d-dimensional Euclidean space Rd involves the placement of N nonoverlapping spheres of unit diameter near an additional fixed unit-diameter sphere such that the greatest distance from the center of…
Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…
We identify universal polar dual pairs of spherical codes $C$ and $D$ such that for a large class of potential functions $h$ the minima of the discrete $h$-potential of $C$ on the sphere occur at the points of $D$ and vice versa. Moreover,…
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,…
We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…
The densest local packings of N identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained using a nonlinear programming method operating in conjunction with a stochastic search of…
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 prove that among all 1-periodic configurations $\Gamma$ of points on the real line $\mathbb{R}$ the quantities $$ \min_{x \in \mathbb{R}} \sum_{\gamma \in \Gamma} e^{- \pi \alpha (x - \gamma)^2} \quad \text{and} \quad \max_{x \in…
Three-point semidefinite programming bounds are one of the most powerful known tools for bounding the size of spherical codes. In this paper, we use them to prove lower bounds for the potential energy of particles interacting via a pair…
For a low energy effective theory to admit a standard local, unitary, analytic and Lorentz-invariant UV completion, its scattering amplitudes must satisfy certain inequalities. While these bounds are known in the forward limit for real…
We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances, and universal lower bounds on the potential energy…
This paper develops a systematic and geometric theory of optimal quantization on the unit sphere $\mathbb S^2$, focusing on finite uniform probability distributions supported on the spherical surface - rather than on lower-dimensional…
In this paper we study the asymptotic properties of point configurations that achieve optimal covering of sets lacking smoothness. Our results include the proofs of the existence of asymptotics of best covering and maximal polarization for…
We show that the spectral embeddings of all known triangle-free strongly regular graphs are optimal spherical codes (the new cases are $56$ points in $20$ dimensions, $50$ points in $21$ dimensions, and $77$ points in $21$ dimensions), as…