The sphere packing problem in dimension $24$
Authors:
Top Cited Papers
Open Access
- 1 May 2017
- journal article
- Published by Annals of Mathematics in Annals of Mathematics
- Vol. 185 (3) , 1017-1033
Abstract
Building on Viazovska's recent solution of the sphere packing problem in eight dimensions, we prove that the Leech lattice is the densest packing of congruent spheres in twenty-four dimensions and that it is the unique optimal periodic packing. In particular, we find an optimal auxiliary function for the linear programming bounds, which is an analogue of Viazovska's function for the eight-dimensional case.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- A FORMAL PROOF OF THE KEPLER CONJECTUREForum of Mathematics, Pi, 2017
- The sphere packing problem in dimension $8$Annals of Mathematics, 2017
- A Conceptual Breakthrough in Sphere PackingNotices of the American Mathematical Society, 2017
- Lattices and Codes2013
- Optimality and uniqueness of the Leech lattice among latticesAnnals of Mathematics, 2009
- Elliptic Modular Forms and Their Applications2008
- A proof of the Kepler conjectureAnnals of Mathematics, 2005
- New upper bounds on sphere packings IAnnals of Mathematics, 2003
- Sphere Packings, Lattices and Groups1999