The densest lattice in twenty-four dimensions

@article{Cohn2004TheDL,
  title={The densest lattice in twenty-four dimensions},
  author={Henry Cohn and Abhinav Kumar},
  journal={Electronic Research Announcements of The American Mathematical Society},
  year={2004},
  volume={10},
  pages={58-67}
}
  • Henry Cohn, Abhinav Kumar
  • Published 17 June 2004
  • Mathematics
  • Electronic Research Announcements of The American Mathematical Society
In this research announcement we outline the methods used in our recent proof that the Leech lattice is the unique densest lattice in R^24. Complete details will appear elsewhere, but here we illustrate our techniques by applying them to the case of lattice packings in R^2, and we discuss the obstacles that arise in higher dimensions. 
The optimal isodual lattice quantizer in three dimensions
TLDR
The mean-centered cuboidal (or m.c.c.) lattice is shown to be the optimal packing and covering among all isodual three-dimensional lattices and also the best quantizer, joining the isodUAL lattices $\mathbb Z, $A_2$ and (presumably) $D_4, E_8$ and the Leech lattice in being simultaneously optimal with respect to all three criteria.
Lattice packing and covering of convex bodies
The aim of this article is twofold. First, to indicate briefly major problems and developments dealing with lattice packings and coverings of balls and convex bodies. Second, to survey more recent
Covering and Packing with Spheres by Diagonal Distortion in ℝn
TLDR
This work addresses the problem of covering Rn with congruent balls, while minimizing the number of balls that contain an average point, and gives a closed formula for the covering density that depends on the distortion parameter.
Historical Overview of the Kepler Conjecture
  • T. Hales
  • Mathematics, Computer Science
    Discret. Comput. Geom.
  • 2006
AbstractThis paper is the first in a series of six papers devoted to the proof of the Kepler conjecture, which asserts that no packing of congruent balls in three dimensions has density greater than
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 are
Computational Discrete Geometry
  • T. Hales
  • Mathematics, Computer Science
    ICMS
  • 2010
TLDR
The talk at ICMS 2010 will give a survey of the computational methods of discrete geometry, and mentions a few of the problems that will be discussed.
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 of
Hermite's Constant and Lattice Algorithms
TLDR
The main provable algorithms for solving the shortest vector problem (SVP), either exactly or approximately, are introduced and blockwise generalizations of LLL are presented as (more or less tight) algorithmic versions of Mordell’s inequality.
Unit Sphere Packings
Unit sphere packings are the classical core of (discrete) geometry. We survey old as well new results giving an overview of the art of the matters. The emphases are on the following five topics: the
2 PACKING AND COVERING
The basic problems in the classical theory of packings and coverings, the development of which was strongly influenced by the geometry of numbers and by crystallography, are the determination of the
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 24 REFERENCES
Sphere Packings, Lattices and Groups
  • J. Conway, N. Sloane
  • Mathematics, Computer Science
    Grundlehren der mathematischen Wissenschaften
  • 1988
The second edition of this book continues to pursue the question: what is the most efficient way to pack a large number of equal spheres in n-dimensional Euclidean space? The authors also continue to
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 related
New upper bounds on sphere packings II
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 related
New Bounds on the Number of Unit Spheres That Can Touch a Unit Sphere in n Dimensions
Abstract New upper bounds are given for the maximum number, τ n , of nonoverlapping unit spheres that can touch a unit sphere in n -dimensional Euclidean space, for n ⩽24. In particular it is shown
SPHERICAL CODES AND DESIGNS
Publisher Summary This chapter provides an overview of spherical codes and designs. A finite non-empty set X of unit vectors in Euclidean space R d has several characteristics, such as the dimension
The complete enumeration of extreme senary forms
  • E. S. Barnes
  • Mathematics
    Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences
  • 1957
Let f(x1..., x6)be a positive definite senary quadratic form of determinant D. Let M be its minimum value for integers x1..., x6, not all zero. The form is said to be extreme if, for all
MR
  • MR
  • 2003
Perfect Lattices in Euclidean Space
  • Perfect Lattices in Euclidean Space
  • 2003
New upper bounds on sphere packings II , Geom
  • New upper bounds on sphere packings II , Geom
  • 2002
Lattices, linear codes, and invariants
  • Notices Amer. Math. Soc
  • 2000
...
1
2
3
...