Optimality and uniqueness of the Leech lattice among lattices

Abstract

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.

39 pages

References in corpus (2)

• New upper bounds on sphere packings I
• New upper bounds on sphere packings II

Cited by in corpus (33)

• Jammed Hard-Particle Packings: From Kepler to Bernal and Beyond
• The sphere packing problem in dimension 24
• Basic Understanding of Condensed Phases of Matter via Packing Models
• Precise Algorithm to Generate Random Sequential Addition of Hard Hyperspheres at Saturation
• Robust Algorithm to Generate a Diverse Class of Dense Disordered and Ordered Sphere Packings via Linear Programming
• Distributing many points on spheres: minimal energy and designs
• Sphere Packing and Quantum Gravity
• Reformulation of the Covering and Quantizer Problems as Ground States of Interacting Particles
• Improved sphere packing lower bounds from Hurwitz lattices
• Exact Constructions of a Family of Dense Periodic Packings of Tetrahedra
• Sphere packing bounds via spherical codes
• Upper bounds for packings of spheres of several radii
• Lattice Index Coding
• The 290 fixed-point sublattices of the Leech lattice
• Random perfect lattices and the sphere packing problem
• Statistical mechanics of the lattice sphere packing problem
• On the density of cyclotomic lattices constructed from codes
• Densest local packing diversity. II. Application to three dimensions
• Densest local sphere-packing diversity: General concepts and application to two dimensions
• Rigidity of spherical codes
• Random packing of spheres in Menger sponge
• An Efficient Linear Programming Algorithm to Generate the Densest Lattice Sphere Packings
• The 3-ball is a local pessimum for packing
• Perfect, strongly eutactic lattices are periodic extreme
• Spherical codes, maximal local packing density, and the golden ratio
• The packing density of the $n$-dimensional cross-polytope
• Computing upper bounds for the packing density of congruent copies of a convex body
• Inhomogeneous extreme forms
• Honeycomb Layered Frameworks with Metallophilic Bilayers
• Realizability of Iso-$g_2$ Processes via Effective Pair Interactions
• Restriction enzymes use a 24 dimensional coding space to recognize 6 base long DNA sequences
• Lattice-Based Analog Mappings for Low-Latency Wireless Sensor Networks
• Low dimensional strongly perfect lattices IV: The dual strongly perfect lattices of dimension 16