Related papers: Explicit Analytical Solution for Random Close Pack…
A recent letter titled "Explicit Analytical Solution for Random Close Packing in d=2 and d=3" published in Physical Review Letters proposes a first-principle computation of the random close packing (RCP) density in spatial dimensions d=2…
An analytical theory for the random close packing density, $\phi_\textrm{RCP}$, of polydisperse hard disks is provided using an equilibrium model of crowding [A. Zaccone, Phys. Rev. Lett. 128, 028002 (2022)] which has been justified on the…
We link the thermodynamics of colloidal suspensions to the statistics of regular and random packings. Random close packing has defied a rigorous definition yet, in three dimensions, there is near universal agreement on the volume fraction…
Using sedimentation to obtain precisely controlled packings of noncohesive spheres, we find that the volume fraction $\phi_{\rm RLP}$ of the loosest mechanically stable packing is in an operational sense well defined by a limit process.…
Randomly packing spheres of equal size into a container consistently results in a static configuration with a density of ~64%. The ubiquity of random close packing (RCP) rather than the optimal crystalline array at 74% begs the question of…
A Comment by Morse and Charbonneau shows that our recent analytical solution to the random close packing (RCP) problem is in good agreement with packings data in dimensions $d<6$ but deviates from the data for $d\geq6$. In this Reply we…
We numerically study structural properties of mechanically stable packings of hard spheres (HS), in a wide range of packing fractions $0.53 \le \phi \le 0.72$. Detailed structural information is obtained from the analysis of orientational…
We show that an analogy between crowding in fluid and jammed phases of hard spheres captures the density dependence of the kissing number for a family of numerically generated jammed states. We extend this analogy to jams of mixtures of…
A collection of spherical particles can be packed tightly together into an amorphous packing known as "random close packing" (RCP). This structure is of interest as a model for the arrangement of molecules in simple liquids and glasses, as…
Predicting theoretically the highest density, which a disordered packing of discs can achieve, has been a long-standing unresolved problem. Such predictions are hindered by two difficulties - the dependence of the density on the packing…
The method, proposed in \cite{Za22} to derive the densest packing fraction of random disc and sphere packings, is shown to yield in two dimensions too high a value that (i) violates the very assumption underlying the method and (ii)…
The problem of finding the most efficient way to pack spheres has an illustrious history, dating back to the crystalline arrays conjectured by Kepler and the random geometries explored by Bernal in the 60's. This problem finds applications…
A random packing of hard particles represents a fundamental model for granular matter. Despite its importance, analytical modeling of random packings remains difficult due to the existence of strong correlations which preclude the…
We investigate the random close packing density, $\phi_\textrm{RCP}$, of polydisperse hard sphere systems using a theoretical framework based on the equilibrium model of crowding. We derive a closed-form solution for $\phi_\textrm{RCP}$ in…
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…
We create collectively jammed (CJ) packings of 50-50 bidisperse mixtures of smooth disks in 2d using an algorithm in which we successively compress or expand soft particles and minimize the total energy at each step until the particles are…
We propose a simple and accurate approach to estimate the random close packing (RCP) fraction of binary hard-disk mixtures. By introducing a parameter based on the mixture's reduced third virial coefficient -- which effectively captures…
A simple dynamical model, Biased Random Organization, BRO, appears to produce configurations known as Random Close Packing (RCP) as BRO's densest critical point in dimension $d=3$. We conjecture that BRO likewise produces RCP in any…
We review a recently proposed theory of random packings. We describe the volume fluctuations in jammed matter through a volume function, amenable to analytical and numerical calculations. We combine an extended statistical mechanics…
We measure the number Omega(phi) of mechanically stable states of volume fraction phi of a granular assembly under gravity. The granular entropy S(phi) = log Omega(phi) vanishes both at high density, at phi = phi_rcp, and a low density, at…