New upper bounds on sphere packings I
Henry Cohn, Noam Elkies
Abstract
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.
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