2009 Annual Meeting

(175c) Monte Carlo Simulation of Dense Packings of Hard Tetrahedra

Authors

Amir Haji-Akbari - Presenter, University of Michigan
Michael Engel - Presenter, University of Michigan- Ann Arbor
Aaron S. Keys - Presenter, University of Michigan
Xiaoyu Zheng - Presenter, Kent State University
Rolfe Petschek - Presenter, Case Western Reserve University
Peter Palffy-Muhoray - Presenter, Kent State University


The densest packing of tetrahedra remains an unsolved problem, and there has been much recent debate. We simulate dense packings of mathematically smooth, hard regular tetrahedra using NPT Monte Carlo simulations and determine the density- pressure equation of state. We find disordered and ordered packings with densities that significantly exceed the hard-sphere FCC packing density of 0.740480490. Our findings thus demonstrate that tetrahedra obey Ulam's conjecture that spheres pack with a lower maximum packing density than any other hard convex object, despite recent conjecture to the contrary. We show that the system is able to achieve such high packing densities by the local ordering of tetrahedra into certain favorable motifs, forming larger structures that pack efficiently but are overall jammed.