Hypersphere Packing

Contribute to this entry CirclePacking

In two dimensions, there are two periodic circle packings for identical circles: square lattice and hexagonal lattice. In 1940, Fejes Tóth proved that the hexagonal lattice is the densest of all possible plane packings (Conway and Sloane 1993, pp. 8-9).

The analog of face-centered cubic packing is the densest lattice packing in four and five dimensions. In eight dimensions, the densest lattice packing is made up of two copies of face-centered cubic. In six and seven dimensions, the densest lattice packings are cross sections of the eight-dimensional case. In 24 dimensions, the densest packing appears to be the Leech lattice. For high dimensions (∼1000-D), the densest known packings are nonlattice.

The densest lattice packings of hyperspheres in n dimensions are known rigorously for n=1, 2, ..., 8, and have packing densities delta_n summarized in the following table, which also gives the corresponding Hermite constants gamma_n (Gruber and Lekkerkerker 1987, p. 518; Hilbert and Cohn-Vossen 1999, p. 47; Finch) and relevant literature citations.

ndelta_n(gamma_n)^nreference
21/6pisqrt(3)4/3Kepler 1611, 1619; Lagrange 1773
31/6pisqrt(2)2Kepler 1611, 1619; Gauss 1840
41/(16)pi^24Korkin and Zolotarev 1877
51/(30)pi^2sqrt(2)8Korkin and Zolotarev 1877
61/(144)pi^3sqrt(3)(64)/3Blichfeldt 1934, Barnes 1957, Vetčinkin 1980
71/(105)pi^364Blichfeldt 1934, Watson 1966, Vetčinkin 1980
81/(384)pi^4256Blichfeldt 1934, Watson 1966, Vetčinkin 1980

The packing densities Delta_n of the densest known non-lattice packings of hyperspheres in dimensions up to 10 are given by Conway and Sloane (1995), However, there are no proofs that any packing in dimensions greater than 3 is optimal (Sloane 1998).

CircleSpherePacking

The largest number of unit circles which can touch a given unit circle is six. For spheres, the maximum number is 12. Newton considered this question long before a proof was published in 1874. The maximum number of hyperspheres that can touch another in n dimensions is the so-called kissing number.

The following example illustrates the sometimes counterintuitive properties of hypersphere packings. Draw unit n-spheres in an n-dimensional space centered at all +/-1 coordinates. Now place an additional hypersphere at the origin tangent to the other hyperspheres. For values of n between 2 and 8, the central hypersphere is contained inside the hypercube with polytope vertices at the centers of the other spheres. However, for n=9, the central hypersphere just touches the hypercube of centers, and for n>9, the central hypersphere is partially outside the hypercube.

This fact can be demonstrated by finding the distance from the origin to the center of one of the n hyperspheres, which is given by

 sqrt((+/-1)^2+...+(+/-1)^2)_()_(n)=sqrt(n).

The radius of the central sphere is therefore sqrt(n)-1. Now, the distance from the origin to the center of a facet bounding the hypercube is always 1 (one hypersphere radius), so the center hypersphere is tangent to the hypercube when sqrt(n)-1=1, or n=4, and partially outside it for n>4.

Wolfram Web Resources

Mathematica »

The #1 tool for creating Demonstrations and anything technical.

Wolfram|Alpha »

Explore anything with the first computational knowledge engine.

Wolfram Demonstrations Project »

Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.

Computerbasedmath.org »

Join the initiative for modernizing math education.

Online Integral Calculator »

Solve integrals with Wolfram|Alpha.

Step-by-step Solutions »

Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.

Wolfram Problem Generator »

Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.

Wolfram Education Portal »

Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.

Wolfram Language »

Knowledge-based programming for everyone.