A Computer Approach to Determine the Densest Translative Tetrahedron Packings

DOI10.1080/10586458.2019.1582378zbMath1486.52051arXiv1805.02222OpenAlexW2962884295WikidataQ128078786 ScholiaQ128078786MaRDI QIDQ5070638

Chuan Ming Zong

Publication date: 14 April 2022

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.02222

zbMATH Keywords

optimizationcolor graphoctahedron packingtetrahedron packing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Coloring of graphs and hypergraphs (05C15)

Related Items

Reciprocals and Flowers in Convexity

Uses Software

• kepler98

Cites Work

• Unnamed Item
• Unnamed Item
• Functionals on the spaces of convex bodies
• Über Treffanzahlen bei translationsgleichen Eikörpern
• On a reverse form of the Brascamp-Lieb inequality
• Über die dichteste gitterförmige Lagerung kongruenter Tetraeder
• On the kissing numbers of some special convex bodies
• The translative kissing number of tetrahedra is 18
• The sphere packing problem in dimension 8
• The sphere packing problem in dimension \(24\)
• New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
• On the translative packing densities of tetrahedra and cuboctahedra
• A proof of the Kepler conjecture
• A new packing density bound in 3-space
• Über die dichteste Kugellagerung
• A Census of Planar Triangulations
• The dodecahedral conjecture
• Isoperimetric Inequalities and the Dodecahedral Conjecture
• Mathematical problems
• Mysteries in Packing Regular Tetrahedra
• The densest lattice packing of tetrahedra