The densest lattice packing of tetrahedra

DOI10.1090/S0002-9904-1970-12400-4zbMath0201.24303WikidataQ56780025 ScholiaQ56780025MaRDI QIDQ5598875

D. J. Hoylman

Publication date: 1970

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Related Items (12)

A Computer Approach to Determine the Densest Translative Tetrahedron Packings ⋮ The kissing numbers of tetrahedra ⋮ New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry ⋮ Lower Bounds on Lattice Covering Densities of Simplices ⋮ Improved Bounds on Sidon Sets via Lattice Packings of Simplices ⋮ Upper bound on the packing density of regular tetrahedra and octahedra ⋮ Packing, tiling, and covering with tetrahedra ⋮ On the translative packing densities of tetrahedra and cuboctahedra ⋮ A dense packing of regular tetrahedra ⋮ Dense periodic packings of tetrahedra with small repeating units ⋮ Dense crystalline dimer packings of regular tetrahedra ⋮ Combinatorial geometry

Cites Work

• Über die dichteste gitterförmige Lagerung kongruenter Tetraeder
• Unnamed Item

This page was built for publication: The densest lattice packing of tetrahedra