Related papers: Reply to Morse and Charbonneau on "Explicit analyt…
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…
We present an analytical derivation of the volume fractions for random close packing (RCP) in both $d=3$ and $d=2$, based on the same methodology. Using suitably modified nearest neigbhour statistics for hard spheres, we obtain…
In this short commentary we provide our comment on the article "Explicit Analytical Solution for Random Close Packing in $d=2$ and $d=3$" and its subsequent Erratum that are recently published in Physical Review Letters. In that Letter, the…
A Comment by R. Blumenfeld on our recent analytical solution for the random close packing density [A. Zaccone, Phys. Rev. Lett. 128, 028002 (2022)] is shown to be plagued by important errors and to contain incorrect statements.
We show that very clear answers to the queries raised by D. Chen and R. Ni in their Comment on our recent paper [A. Zaccone, Phys. Rev. Lett. 128, 028002 (2022)] can be found in our original paper already. The paper [A. Zaccone, Phys. Rev.…
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…
The range closest-pair (RCP) problem is the range-search version of the classical closest-pair problem, which aims to store a given dataset of points in some data structure such that when a query range $X$ is specified, the closest pair of…
I comment on Zaccone, Phys. Rev. Lett. {\bf 128}, 028002 (2022) highlighting a flaw in the derivation that led to a spurious divergent factor. This renders the derivation of the random close packing density invalid.
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…
Range closest-pair (RCP) search is a range-search variant of the classical closest-pair problem, which aims to store a given set $S$ of points into some space-efficient data structure such that when a query range $Q$ is specified, the…
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…
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 direct ring coupled-cluster doubles (drCCD)-based random phase approximation (RPA) has provided an attractive framework for the development and application of RPA-related methods. However, a potential unphysical solution issue recently…
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…
In this paper the random packing fraction of hard disks in a plane is analyzed, following a geometric probabilistic approach. First, the random close packing (RCP) of equally sized disks is modelled. Subsequently, following the same…
Given a dataset $S$ of points in $\mathbb{R}^2$, the range closest-pair (RCP) problem aims to preprocess $S$ into a data structure such that when a query range $X$ is specified, the closest-pair in $S \cap X$ can be reported efficiently.…
Packing problems, even of objects with regular geometries, are in general non-trivial. For few special shapes, the features of crystalline as well as random, irregular two-dimensional (2D) packings are known. The packing of 2D crosses does…
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…
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…
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…