pith. sign in

arxiv: cond-mat/0003416 · v1 · submitted 2000-03-25 · ❄️ cond-mat.stat-mech · cond-mat.mtrl-sci

Is Random Close Packing of Spheres Well Defined?

classification ❄️ cond-mat.stat-mech cond-mat.mtrl-sci
keywords randomprecisespheresclosemadepackingalgorithmargue
0
0 comments X
read the original abstract

Despite its long history, there are many fundamental issues concerning random packings of spheres that remain elusive, including a precise definition of random close packing (RCP). We argue that the current picture of RCP cannot be made mathematically precise and support this conclusion via a molecular dynamics study of hard spheres using the Lubachevsky-Stillinger compression algorithm. We suggest that this impasse can be broken by introducing the new concept of a maximally random jammed state, which can be made precise.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.