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

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: φ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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…