geometry Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is c ...

, tetrahedron packing is the problem of arranging identical regular

tetrahedra In geometry, a tetrahedron (plural: tetrahedra or tetrahedrons), also known as a triangular pyramid, is a polyhedron composed of four triangular faces, six straight edges, and four vertex corners. The tetrahedron is the simplest of all th ...

throughout three-dimensional space so as to fill the maximum possible fraction of space. Tetrahedron packing structure png

Currently, the best lower bound achieved on the optimal packing fraction of regular tetrahedra is 85.63%. Tetrahedra do not

tile Tiles are usually thin, square or rectangular coverings manufactured from hard-wearing material such as ceramic, stone, metal, baked clay, or even glass. They are generally fixed in place in an array to cover roofs, floors, walls, edges, or ...

space, and an upper bound below 100% (namely, 1 − (2.6...)·10⁻²⁵) has been reported.

Historical results

Aristotle Aristotle (; grc-gre, Ἀριστοτέλης ''Aristotélēs'', ; 384–322 BC) was a Greek philosopher and polymath during the Classical period in Ancient Greece. Taught by Plato, he was the founder of the Peripatetic school of ...

claimed that tetrahedra could fill space completely. In 2006, Conway and Torquato showed that a packing fraction about 72% can be obtained by constructing a non-Bravais lattice packing of tetrahedra (with multiple particles with generally different orientations per repeating unit), and thus they showed that the best tetrahedron packing cannot be a lattice packing (with one particle per repeating unit such that each particle has a common orientation). These packing constructions almost doubled the optimal Bravais-lattice-packing fraction 36.73% obtained by Hoylman. In 2007 and 2010, Chaikin and coworkers experimentally showed that tetrahedron-like dice can randomly pack in a finite container up to a packing fraction between 75% and 76%. In 2008, Chen was the first to propose a packing of hard, regular tetrahedra that packed more densely than spheres, demonstrating numerically a packing fraction of 77.86%. A further improvement was made in 2009 by Torquato and Jiao, who compressed Chen's structure using a computer algorithm to a packing fraction of 78.2021%. In mid-2009 Haji-Akbari et al. showed, using MC simulations of initially random systems that at packing densities >50% an equilibrium fluid of hard tetrahedra spontaneously transforms to a dodecagonal

quasicrystal A quasiperiodic crystal, or quasicrystal, is a structure that is ordered but not periodic. A quasicrystalline pattern can continuously fill all available space, but it lacks translational symmetry. While crystals, according to the classical ...

, which can be compressed to 83.24%. They also reported a glassy, disordered packing at densities exceeding 78%. For a periodic approximant to a quasicrystal with an 82-tetrahedron unit cell, they obtained a packing density as high as 85.03%. In late 2009, a new, much simpler family of packings with a packing fraction of 85.47% was discovered by Kallus, Elser, and Gravel. These packings were also the basis of a slightly improved packing obtained by Torquato and Jiao at the end of 2009 with a packing fraction of 85.55%, and by Chen, Engel, and Glotzer in early 2010 with a packing fraction of 85.63%. The Chen, Engel and Glotzer result currently stands as the densest known packing of hard, regular tetrahedra. Surprisingly, the square-triangle tiling packs denser than this

double lattice In mathematics, especially in geometry, a double lattice in is a discrete subgroup of the group of Euclidean motions that consists only of translations and point reflections and such that the subgroup of translations is a lattice. The orbit of a ...

of triangular bipyramids when tetrahedra are slightly rounded (the

Minkowski sum In geometry, the Minkowski sum (also known as dilation) of two sets of position vectors ''A'' and ''B'' in Euclidean space is formed by adding each vector in ''A'' to each vector in ''B'', i.e., the set : A + B = \. Analogously, the Minkowski ...

of a tetrahedron and a sphere), making the 82-tetrahedron crystal the largest unit cell for a densest packing of identical particles to date.

Relationship to other packing problems

Because the earliest lower bound known for packings of tetrahedra was less than that of

spheres The Synchronized Position Hold Engage and Reorient Experimental Satellite (SPHERES) are a series of miniaturized satellites developed by MIT's Space Systems Laboratory for NASA and US Military, to be used as a low-risk, extensible test bed for the ...

, it was suggested that the regular tetrahedra might be a counterexample to Ulam's conjecture that the optimal density for packing congruent spheres is smaller than that for any other convex body. However, the more recent results have shown that this is not the case.

References

External links

Packing Tetrahedrons, and Closing in on a Perfect Fit
NYTimes
Efficient shapes
The Economist

New Scientist {{Packing problem History of geometry Packing problems

Historical results

Relationship to other packing problems

See also

References

External links