The author shows that there is a lattice packing of tetrahedra such that each tetrahedron contacts 18 others, and that any other packing lattice permits a smaller contact- or kissing-number. So he solves the lattice kissing number problem for the tetrahedron completely. The kissing number for the tetrahedron is remarkably larger than that of the 3-ball, which is 12 according to the famous Newton-Gregory problem. Another surprising phenomenon: The kissing number in the densest lattice packing of tetrahedron is 14, i.e. considerably smaller than the optimum; in contrast to the sphere-case.
- Abschätzungen für die Anzahl der konvexen Körper, die einen konvexen Körper berühren
- Das Problem der dreizehn Kugeln
- scientific article; zbMATH DE number 3868125 (Why is no real title available?)
- scientific article; zbMATH DE number 3680654 (Why is no real title available?)
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- scientific article; zbMATH DE number 480248 (Why is no real title available?)
- scientific article; zbMATH DE number 3342057 (Why is no real title available?)
- scientific article; zbMATH DE number 3078635 (Why is no real title available?)
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- On a conjecture of H. Hadwiger
- The densest lattice packing of tetrahedra
- The Problem of the Thirteen Spheres
- Über Treffanzahlen bei translationsgleichen Eikörpern
- The translative kissing number of tetrahedra is 18
- Local optimality of the critical lattice sphere-packing of regular tetrahedra
- Average kissing numbers for non-congruent sphere packings
- On the translative packing densities of tetrahedra and cuboctahedra
- scientific article; zbMATH DE number 2115094 (Why is no real title available?)
- Packing, tiling, and covering with tetrahedra
- On generalized kissing numbers of convex bodies
- Laminating lattices with symmetrical glue
This page was built for publication: The kissing numbers of tetrahedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1913596)