arXiv Analytics

Sign in

arXiv:1603.06518 [math.NT]AbstractReferencesReviewsResources

The sphere packing problem in dimension 24

Henry Cohn, Abhinav Kumar, Stephen D. Miller, Danylo Radchenko, Maryna Viazovska

Published 2016-03-21Version 1

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.

Related articles: Most relevant | Search more
arXiv:1603.04246 [math.NT] (Published 2016-03-14)
The sphere packing problem in dimension 8
arXiv:math/9911195 [math.NT] (Published 1999-11-24)
The Leech lattice and other lattices
arXiv:0907.0776 [math.NT] (Published 2009-07-04)
Delaunay polytopes derived from the Leech lattice