Exact semidefinite programming bounds for packing problems

DOI10.1137/20M1351692MaRDI QIDQ6332144arXivFDO

Authors M. Dostert, David de Laat, Philippe Moustrou

Publication date 1 January 2020

Published in arXiv

Full work available at URL https://doi.org/10.1137/20M1351692

Mathematics Subject Classification ID

Semidefinite programming (90C22) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

arXiv classification

math.OCmath.MG

Abstract: In this paper we give an algorithm to round the floating point output of a semidefinite programming solver to a solution over the rationals or a quadratic extension of the rationals. We apply this to get sharp bounds for packing problems, and we use these sharp bounds to prove that certain optimal packing configurations are unique up to rotations. In particular, we show that the configuration coming from the $mathsf{E}_8$ root lattice is the unique optimal code with minimal angular distance $pi/3$ on the hemisphere in $mathbb{R}^8$, and we prove that the three-point bound for the $(3,8,vartheta)$-spherical code, where $vartheta$ is such that $cosvartheta=(2sqrt2-1)/7$, is sharp by rounding to $mathbbQ[sqrt2]$. We also use our machinery to compute sharp upper bounds on the number of spheres that can be packed into a larger sphere.

This page was built for publication: Exact semidefinite programming bounds for packing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6332144)