Papers
Topics
Authors
Recent
Search
2000 character limit reached

Regular packings on periodic lattices

Published 21 Oct 2011 in cond-mat.stat-mech, math-ph, and math.MP | (1110.4775v1)

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 \phi_d(X). It is proved to be continuous with an infinite number of singular points X{\rm min}\nu, X{\rm max}\nu, \nu=0, \pm 1, \pm 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 \phi_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.

Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.