The Densest Lattice Packing of Tetrahedra

  title={The Densest Lattice Packing of Tetrahedra},
  author={DOUGLAS J. HOYLMAN and Victor Klee and D. J. HOYLMAN},
  • Published 2007
The problem of finding the densest packing of tetrahedra was first suggested by Hubert [3, p. 319]. Minkowski [4] attempted to find the densest lattice packing of tetrahedra, but his result is invalid due to the incorrect assumption that the difference body of a regular tetrahedron was a regular octahedron. A lower bound for the maximum density of such a packing has been given by Groemer [ l ] as 18/49. The purpose of this paper is to announce the proof that 18/49 is in fact the maximum… CONTINUE READING

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 11 extracted citations


Publications referenced by this paper.
Showing 1-4 of 4 references

Mathematische Problème", Archiv

D. Hubert
Math. Phys. 3 (1901), no. 1 44-63; 213-237, in Gesammelte Abhandlungen. Vol. Ill, Chelsea, New York, • 1965

liber die dichteste gitterförtnige Lagerung kongruenter Tetraeder

H. Groemer
Monatsh. Math • 1962

Development of the Minkowski geometry of numbers, Macmillan

H. Hancock
New York, • 1939
View 2 Excerpts

Dichteste gitterförmige Lagerung kongruenter Körper", Nachr

H. Minkowski
K. Ges. Wiss. Göttingen, 1904, 311-355, in Gesammelte Abhandlungen. Vol. II, Teubner, Berlin, • 1911
View 2 Excerpts

Similar Papers

Loading similar papers…