The sphere packing problem in dimension 24

@article{Cohn2016TheSP,
  title={The sphere packing problem in dimension 24},
  author={Henry Cohn and Abhinav Kumar and Stephen D. Miller and Danylo V. Radchenko and Maryna S. Viazovska},
  journal={arXiv: Number Theory},
  year={2016}
}
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. 

Figures from this paper

Towards a proof of the 24-cell conjecture
This review paper is devoted to the problems of sphere packings in 4 dimensions. The main goal is to find reasonable approaches for solutions to problems related to densest sphere packings inExpand
Perfect Quadratic forms: an Upper Bound and Challenges in Enumeration
The lattice packing problem in dimension 9 is a long-standing open problem. We consider a classical algorithm by Voronoi to solve the lattice packing problem in any dimension, by enumerating allExpand
Sphere packings, Lattices and Codes
1. The sphere packing problem. Statement of the problem. Definition and basic properties of lattices: fundamental region, discriminant, Gram matrix. Density of a lattice packing and of a generalExpand
Sphere packing bounds via rescaling
We study the relationship between local and global density for sphere packings, and in particular the convergence of packing densities in large, compact regions to the Euclidean limit. We axiomatizeExpand
Some properties of optimal functions for sphere packing in dimensions 8 and 24
We study some sequences of functions of one real variable and conjecture that they converge uniformly to functions with certain positivity and growth properties. Our conjectures imply a conjecture ofExpand
A conceptual breakthrough in sphere packing
This expository paper describes Viazovska's breakthrough solution of the sphere packing problem in eight dimensions, as well as its extension to twenty-four dimensions by Cohn, Kumar, Miller,Expand
Compact Packings of Space with Two Sizes of Spheres
TLDR
It is shown that the compact packings of Euclidean three-dimensional space with two sizes of spheres are exactly those obtained by filling with spheres of size 2-1, and the octahedral holes of a close-packing of sphere of size 1. Expand
The Local Optimality of the Double Lattice Packing
TLDR
A new technique for proving the local optimality of packing configurations of Euclidean space is introduced, applying it to a general convex polygon, and it is proved that under mild assumptions satisfied generically, the construction of the optimal double lattice packing by Kuperberg andKuperberg is also locally optimal in the full space of packings. Expand
SHARP SPHERE PACKINGS
  • M. Viazovska
  • Physics
  • Proceedings of the International Congress of Mathematicians (ICM 2018)
  • 2019
The classical sphere packing problem asks for the densest possible configuration of nonoverlapping equal balls in the three dimensional Euclidean space. This natural and even naive question remainedExpand
Dense packings via lifts of codes to division rings
We obtain algorithmically effective versions of the dense lattice sphere packings constructed from orders in Q-division rings by the first author. The lattices in question are lifts of suitable codesExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 34 REFERENCES
The sphere packing problem in dimension 8The sphere packing problem in dimension 8
In this paper we prove that no packing of unit balls in Euclidean space R-8 has density greater than that of the E8-lattice packing.
Some properties of optimal functions for sphere packing in dimensions 8 and 24
We study some sequences of functions of one real variable and conjecture that they converge uniformly to functions with certain positivity and growth properties. Our conjectures imply a conjecture ofExpand
A conceptual breakthrough in sphere packing
This expository paper describes Viazovska's breakthrough solution of the sphere packing problem in eight dimensions, as well as its extension to twenty-four dimensions by Cohn, Kumar, Miller,Expand
Sphere packings, I
  • T. Hales
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
  • 1997
TLDR
A program to prove the Kepler conjecture on sphere packings is described and it is shown that every Delaunay star that satisfies a certain regularity condition satisfies the conjecture. Expand
New upper bounds on sphere packings I
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 relatedExpand
What are all the best sphere packings in low dimensions?
We describe what may beall the best packings of nonoverlapping equal spheres in dimensionsn ≤10, where “best” means both having the highest density and not permitting any local improvement. ForExpand
Optimality and uniqueness of the Leech lattice among lattices
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 furthermoreExpand
Kissing numbers, sphere packings, and some unexpected proofs
The ikissing number problemi asks for the maximal number of white spheres that can touch a black sphere of the same size in n-dimensional space. The answers in dimensions one, two and three areExpand
A Breakthrough in Sphere Packing: The Search for Magic Functions
This paper is an exposition, written for the Nieuw Archief voor Wiskunde, about the two recent breakthrough results in the theory of sphere packings. It includes an interview with Henry Cohn, AbhinavExpand
Optimal asymptotic bounds for spherical designs
In this paper we prove the conjecture of Korevaar and Meyers: for each $N\ge c_dt^d$ there exists a spherical $t$-design in the sphere $S^d$ consisting of $N$ points, where $c_d$ is a constantExpand
...
1
2
3
4
...