Searcharxiv⌕ Search

arXiv subjects

Yoav Kallus

Publications and source records attributed to Yoav Kallus.

21 records · Page 2Linked to original sources

Upper bound on the packing density of regular tetrahedra and octahedra

We obtain an upper bound to the packing density of regular tetrahedra. The bound is obtained by showing the existence, in any packing of regular tetrahedra, of a set of disjoint spheres centered on tetrahedron edges, so that each sphere is not fully covered by the packing. The bound on the amount of space that is not covered in each sphere is obtained in a recursive way by building on the observation that non-overlapping regular tetrahedra cannot subtend a solid angle of $4π$ around a point if this point lies on a tetrahedron edge. The proof can be readily modified to apply to other polyhedra with the same property. The resulting lower bound on the fraction of empty space in a packing of regular tetrahedra is $2.6\ldots\times 10^{-25}$ and reaches $1.4\ldots\times 10^{-12}$ for regular octahedra.

math.MG↗

A method for dense packing discovery

The problem of packing a system of particles as densely as possible is foundational in the field of discrete geometry and is a powerful model in the material and biological sciences. As packing problems retreat from the reach of solution by analytic constructions, the importance of an efficient numerical method for conducting \textit{de novo} (from-scratch) searches for dense packings becomes crucial. In this paper, we use the \textit{divide and concur} framework to develop a general search method for the solution of periodic constraint problems, and we apply it to the discovery of dense periodic packings. An important feature of the method is the integration of the unit cell parameters with the other packing variables in the definition of the configuration space. The method we present led to improvements in the densest-known tetrahedron packing which are reported in [arXiv:0910.5226]. Here, we use the method to reproduce the densest known lattice sphere packings and the best known lattice kissing arrangements in up to 14 and 11 dimensions respectively (the first such numerical evidence for their optimality in some of these dimensions). For non-spherical particles, we report a new dense packing of regular four-dimensional simplices with density $ϕ=128/219\approx0.5845$ and with a similar structure to the densest known tetrahedron packing.

math.MG↗

Dense periodic packings of tetrahedra with small repeating units

We present a one-parameter family of periodic packings of regular tetrahedra, with the packing fraction $100/117\approx0.8547$, that are simple in the sense that they are transitive and their repeating units involve only four tetrahedra. The construction of the packings was inspired from results of a numerical search that yielded a similar packing. We present an analytic construction of the packings and a description of their properties. We also present a transitive packing with a repeating unit of two tetrahedra and a packing fraction $\frac{139+40\sqrt{10}}{369}\approx0.7194$.

math.MG↗