Confined disordered strictly jammed binary sphere packings
arXiv:1512.08740 · doi:10.1103/PhysRevE.92.062207
Abstract
Disordered jammed packings under confinement have received considerably less attention than their \textit{bulk} counterparts and yet arise in a variety of practical situations. In this work, we study binary sphere packings that are confined between two parallel hard planes, and generalize the Torquato-Jiao (TJ) sequential linear programming algorithm [Phys. Rev. E {\bf 82}, 061302 (2010)] to obtain putative maximally random jammed (MRJ) packings that are exactly isostatic with high fidelity over a large range of plane separation distances , small to large sphere radius ratio and small sphere relative concentration . We find that packing characteristics can be substantially different from their bulk analogs, which is due to what we term "confinement frustration". Rattlers in confined packings are generally more prevalent than those in their bulk counterparts. We observe that packing fraction, rattler fraction and degree of disorder of MRJ packings generally increase with , though exceptions exist. Discontinuities in the packing characteristics as varies in the vicinity of certain values of are due to associated discontinuous transitions between different jammed states. We also apply the local volume-fraction variance to characterize confined packings and find that these packings possess essentially the same level of hyperuniformity as their bulk counterparts. Our findings are generally relevant to confined packings that arise in biology (e.g., structural color in birds and insects) and may have implications for the creation of high-density powders and improved battery designs.
References in corpus (29)
- Is Random Close Packing of Spheres Well Defined?
- Jammed Hard-Particle Packings: From Kepler to Bernal and Beyond
- Local Density Fluctuations, Hyperuniformity, and Order Metrics
- Dense Packings of the Platonic and Archimedean Solids
- Pair Correlation Function Characteristics of Nearly Jammed Disordered and Ordered Hard-Sphere Packings
- Avian photoreceptor patterns represent a disordered hyperuniform solution to a multiscale packing problem
- Hyperuniformity in point patterns and two-phase random heterogeneous media
- Dense Packings of Polyhedra: Platonic and Archimedean Solids
- Phase behavior of hard spheres confined between parallel hard plates: Manipulation of colloidal crystal structures by confinement
- Hyperuniform long-range correlations are a signature of disordered jammed hard-particle packings
- Random Close Packing of Disks and Spheres in Confined Geometries
- Mean-field theory of random close packings of axisymmetric particles
- A theory of amorphous packings of binary mixtures of hard spheres
- Robust Algorithm to Generate a Diverse Class of Dense Disordered and Ordered Sphere Packings via Linear Programming
- Diagnosing hyperuniformity in two-dimensional disordered jammed-packings of soft spheres
- Novel Features Arising in the Maximally Random Jammed Packings of Superballs
- Emergent Behaviors from A Cellular Automaton Model for Invasive Tumor Growth in Heterogeneous Microenvironments
- Densest binary sphere packings
- Hyperuniformity, quasi-long-range correlations, and void-space constraints in maximally random jammed particle packings. I. Polydisperse spheres
- Model of random packings of different size balls
- Toward an Ising Model of Cancer and Beyond
- Equilibrium Phase Behavior and Maximally Random Jammed State of Truncated Tetrahedra
- Non-universal Voronoi cell shapes in amorphous ellipsoid packings
- Packing Confined Hard Spheres Denser with Adaptive Prism Phases
- Hyperuniformity, quasi-long-range correlations, and void-space constraints in maximally random jammed particle packings. II. Anisotropy in particle shape
- Densest local packing diversity. II. Application to three dimensions
- A Cellular Automaton Model for Tumor Dormancy: Emergence of a Proliferative Switch
- Densest local sphere-packing diversity: General concepts and application to two dimensions
- An Efficient Linear Programming Algorithm to Generate the Densest Lattice Sphere Packings