Papers
Topics
Authors
Recent
Search
2000 character limit reached

The disc random packing problem: a disorder criterion and an explicit solution

Published 20 Jun 2021 in cond-mat.stat-mech, cond-mat.soft, math-ph, and math.MP | (2106.11774v3)

Abstract: Predicting the densest random disc packing fraction is an unsolved paradigm problem relevant to a number of disciplines and technologies. One difficulty is that it is ill-defined without setting a criterion for the disorder. Another is that the density depends on the packing protocol and the multitude of possible protocol parameters has so far hindered a general solution. A new approach is proposed here. After formulating a well-posed form of the general protocol-independent problem for planar packings of discs, a systematic criterion is proposed to avoid crystalline hexagonal order as well as further topological order. The highest possible random packing fraction is then derived exactly: $\phi_{RCP}=0.852525...$. The solution is based on the cell order distribution that is shown to: (i) yield directly the packing fraction; (ii) parameterise all possible packing protocols; (iii) make it possible to define and limit all topological disorder. The method is further useful for predicting the highest packing fraction in specific protocols, which is illustrated for a family of simply-sheared packings that generate maximum-entropy cell order distributions.

Authors (1)

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.