Related papers: The disc random packing problem: a disorder criter…
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…
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 provide, for any $r\in (0,1)$, lower and upper bounds on the maximal density of a packing in the Euclidean plane of discs of radius $1$ and $r$. The lower bounds are mostly folk, but the upper bounds improve the best previously known…
In a previous work, a simple approach to derive the jamming packing fraction of a hard-sphere mixture from the knowledge of the random close-packing fraction of the monocomponent system was proposed. Now, an extension of that approach is…
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…
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)…
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…
We have formulated the problem of generating periodic dense paritcle packings as an optimization problem called the Adaptive Shrinking Cell (ASC) formulation [S. Torquato and Y. Jiao, Phys. Rev. E {\bf 80}, 041104 (2009)]. Because the…
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…
We study the Hard Core Model on the graphs ${\rm {\bf \scriptstyle G}}$ obtained from Archimedean tilings i.e. configurations in $\scriptstyle \{0,1\}^{{\rm {\bf G}}}$ with the nearest neighbor 1's forbidden. Our particular aim in choosing…
Patterns of different symmetries may arise after solution to reaction-diffusion equations. Hexagonal arrays, layers and their perturbations are observed in different models after numerical solution to the corresponding initial-boundary…
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 consider hard-disc mixtures with disc sizes within ratio $\sqrt{2}-1$, that is, the small disc exactly fits in the hole between four large discs. For each prescribed stoichiometry of large and small discs, the densest packings are…
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…
Circles of a single size can pack together densely in a hexagonal lattice, but adding in size variety disrupts the order of those packings. We conduct simulations which generate dense random packings of circles with specified size…
We show for the first time that collectively jammed disordered packings of three-dimensional monodisperse frictionless hard spheres can be produced and tuned using a novel numerical protocol with packing density $\phi$ as low as 0.6. This…
We report calculations of the density of maximally random jamming (aka random close packing) of one-component and binary hard disc fluids. The theoretical structure used provides a common framework for description of the hard disc liquid to…
Obtaining general relations between macroscopic properties of random assemblies, such as density, and the microscopic properties of their constituent particles, such as shape, is a foundational challenge in the study of amorphous materials.…
What particle shape will generate the highest packing fraction when randomly poured into a container? In order to explore and navigate the enormous search space efficiently, we pair molecular dynamics simulations with artificial evolution.…
The problem of packing a system of particles as densely as possible is foundational in the field of discrete geometry and is a powerful model in the material and biological sciences. As packing problems retreat from the reach of solution by…