New upper bounds on sphere packings II
Henry Cohn
Abstract
We continue the study of the linear programming bounds for sphere packing introduced by Cohn and Elkies. We use theta series to give another proof of the principal theorem, and present some related results and conjectures.
Create a lesson
Related papers
On the geometry of real polynomials of the 7-th degree with simple complex critical points
Elizaveta Khokhlova, Yury Kochetkov
Uniqueness of the hexagonal lattice's universal optimality
Markus Faulhuber, Philipp Petersen
Hadamard configurations and sharp cubic-period bounds for stealth in dimensions 10, 11, and 12
Josiah Park
Scaling Limits and Fractal Dimensions of ω-Substitution Graph Systems
Qingcheng Zeng, Yumei Xue, Cheng Zeng
Filling Lipschitz spheres in metric spaces
Noa Vikman, Stefan Wenger
Logarithmically Slim Polygons
Panagiotis Tselekidis