arXiv:math/0403263 [math.MG]AbstractReferencesReviewsResources
Optimality and uniqueness of the Leech lattice among lattices
Published 2004-03-16, updated 2017-08-22Version 3
We prove that the Leech lattice is the unique densest lattice in R^24. The proof combines human reasoning with computer verification of the properties of certain explicit polynomials. We furthermore prove that no sphere packing in R^24 can exceed the Leech lattice's density by a factor of more than 1+1.65*10^(-30), and we give a new proof that E_8 is the unique densest lattice in R^8.
Comments: 39 pages
Journal: Annals of Mathematics 170 (2009), 1003-1050
Categories: math.MG
Keywords: unique densest lattice, optimality, uniqueness, leech lattices density, computer verification
Tags: journal article
Related articles: Most relevant | Search more
On the optimality of gluing over scales
Uniqueness and Symmetry in Problems of Optimally Dense Packings
arXiv:math/0305012 [math.MG] (Published 2003-05-01)
A computer verification of the Kepler conjecture