Regular packings on periodic lattices

Abstract

We investigate the problem of packing identical hard objects on regular lattices in d dimensions. Restricting configuration space to parallel alignment of the objects, we study the densest packing at a given aspect ratio X. For rectangles and ellipses on the square lattice as well as for biaxial ellipsoids on a simple cubic lattice, we calculate the maximum packing fraction φd(X). It is proved to be continuous with an infinite number of singular points X min, X max, =0, 1, 2,... In two dimensions, all maxima have the same height, whereas there is a unique global maximum for the case of ellipsoids. The form of φd(X) is discussed in the context of geometrical frustration effects, transitions in the contact numbers and number theoretical properties. Implications and generalizations for more general packing problems are outlined.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…