The site and bond percolation problems are conventionally studied on (hyper)cubic lattices, which afford straightforward numerical treatments. The recent implementation of efficient simulation algorithms for high-dimensional systems now also facilitates the study of $D_n$ root lattices in $n$ dimension as well as $E_8$-related dense packing lattices. Here, we consider the percolation problem on $D_n$ for $n=3$ to $13$ and on $E_8$ relatives for $n=6$ to 9. Precise estimates for both site and bond percolation thresholds obtained from invasion percolation simulations are compared with dimensional series expansion on $D_n$ lattices based on lattice animal enumeration. As expected, the bond percolation threshold rapidly approaches the Bethe lattice limit as $n$ increases for these high-connectivity lattices. Corrections, however, exhibit clear yet unexplained trends. Interestingly, the finite-size scaling exponent for invasion percolation is found to be lattice and percolation-type specific.
Connectedness percolation phenomena in two-dimensional packings of elongated particles (discorectangles) were studied numerically. The packings were produced using random sequential adsorption (RSA) off-lattice model with preferential orientations of particles along a given direction. The partial ordering was characterized by order parameter $S$, with $S=0$ for completely disordered films (random orientation of particles) and $S=1$ for completely aligned particles along the horizontal direction $x$. The aspect ratio (length-to-width ratio) for the particles was varied within the range $\vareps…
Dense packings have served as useful models of the structure of liquid, glassy and crystal states of matter, granular media, heterogeneous materials, and biological systems. Probing the symmetries and other mathematical properties of the densest packings is a problem of long-standing interest in discrete geometry and number theory. The preponderance of previous work has focused on spherical particles, and very little is known about dense polyhedral packings. We formulate the problem of generating dense packings of polyhedra within an adaptive fundamental cell subject to periodic boundary condi…
Dense packings of nonoverlapping bodies in three-dimensional Euclidean space are useful models of the structure of a variety of many-particle systems that arise in the physical and biological sciences. Here we investigate the packing behavior of congruent ring tori, which are multiply connected nonconvex bodies of genus 1, as well as horn and spindle tori. We analytically construct a family of dense periodic packings of unlinked tori guided by the organizing principles originally devised for simply connected solid bodies [Torquato and Jiao, PRE 86, 011102 (2012)]. We find that the horn tori as…
The determination of the densest packings of regular tetrahedra (one of the five Platonic solids) is attracting great attention as evidenced by the rapid pace at which packing records are being broken and the fascinating packing structures that have emerged. Here we provide the most general analytical formulation to date to construct dense periodic packings of tetrahedra with four particles per fundamental cell. This analysis results in six-parameter family of dense tetrahedron packings that includes as special cases recently discovered "dimer" packings of tetrahedra, including the densest kno…
Dense packings of hard particles have important applications in many fields, including condensed matter physics, discrete geometry and cell biology. In this paper, we employ a stochastic search implementation of the Torquato-Jiao Adaptive-Shrinking-Cell optimization scheme [Nature 460, 876 (2009)] to find maximally dense particle packings in d-dimensional Euclidean space $\mathbb{R}^d$. While the original implementation was designed to study spheres and convex polyhedra in $d\ge3$, our implementation focuses on $d=2$ and extends the algorithm to include both concave polygons and certain convex…
In dense, static, polydisperse granular media under isotropic pressure, the probability density and the correlations of particle-wall contact forces are studied. Furthermore, the probability density functions of the populations of pressures measured with different sized circular pressure cells is examined. The questions answered are: (i) What is the number of contacts that has to be considered so that the measured pressure lies within a certain error margin from its expectation value? (ii) What is the statistics of the pressure probability density as function of the size of the pressure cell? …
I consider a one dimensional system of particles which interact through a hard core of diameter $\si$ and can connect to each other if they are closer than a distance $d$. The mean cluster size increases as a function of the density $ρ$ until it diverges at some critical density, the percolation threshold. This system can be mapped onto an off-lattice generalization of the Potts model which I have called the Potts fluid, and in this way, the mean cluster size, pair connectedness and percolation probability can be calculated exactly. The mean cluster size is $S = 2 \exp[ ρ(d -\si)/(1 - ρ\si)] -…
The determination of the densest packings of regular tetrahedra (one of the five Platonic solids) is attracting great attention as evidenced by the rapid pace at which packing records are being broken and the fascinating packing structures that have emerged. We have discovered the densest known packings of regular tetrahedra with a density $ϕ= {12250/14319} = 0.855506...$. These packings are special cases of an analytical two-parameter family of dense periodic packings with four particles per fundamental cell that we have constructed here. From this family, we can recover a set of recent packi…
The densest packings of N unit squares in a torus are studied using analytical methods as well as simulated annealing. A rich array of dense packing solutions are found: density-one packings when N is the sum of two square integers; a family of "gapped bricklayer" Bravais lattice solutions with density N/(N+1); and some surprising non-Bravais lattice configurations, including lattices of holes as well as a configuration for N=23 in which not all squares share the same orientation. The entropy of some of these configurations and the frequency and orientation of density-one solutions as N goes t…
Typical quasistatic compression algorithms for generating jammed packings of athermal, purely repulsive particles begin with dilute configurations and then apply successive compressions with relaxation of the elastic energy allowed between each compression step. It is well-known that during isotropic compression athermal systems with purely repulsive interactions undergo a jamming transition at packing fraction $ϕ_J$ from an unjammed state with zero pressure to a jammed, rigid state with nonzero pressure. Using extensive computer simulations, we show that a novel second-order-like transition, …
We have recently devised organizing principles to obtain maximally dense packings of the Platonic and Archimedean solids, and certain smoothly-shaped convex nonspherical particles [Torquato and Jiao, Phys. Rev. E 81, 041310 (2010)]. Here we generalize them in order to guide one to ascertain the densest packings of other convex nonspherical particles as well as concave shapes. Our generalized organizing principles are explicitly stated as four distinct propositions. We apply and test all of these organizing principles to the most comprehensive set of both convex and concave particle shapes to d…
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 analytic constructions, the importance of an efficient numerical method for conducting \textit{de novo} (from-scratch) searches for dense packings becomes crucial. In this paper, we use the \textit{divide and concur} framework to develop a general search method for the solution of periodic constraint problems, and we apply it to the discovery of dense perio…
We present a method for discovering dense packings of general convex hard particles and apply it to study the dense packing behavior of a one-parameter family of particles with tetrahedral symmetry representing a deformation of the ideal mathematical tetrahedron into a less ideal, physical, tetrahedron and all the way to the sphere. Thus, we also connect the two well studied problems of sphere packing and tetrahedron packing on a single axis. Our numerical results uncover a rich optimal-packing behavior, compared to that of other continuous families of particles previously studied. We present …
We present the densest known packing of regular tetrahedra with density phi = 4000/4671 = 0.856347... Like the recently discovered packings of Kallus et al. [arXiv:0910.5226] and Torquato-Jiao [arXiv:0912.4210], our packing is crystalline with a unit cell of four tetrahedra forming two triangular dipyramids (dimer clusters). We show that our packing has maximal density within a three-parameter family of dimer packings. Numerical compressions starting from random configurations suggest that the packing may be optimal at least for small cells with up to 16 tetrahedra and periodic boundaries.
We study dense packings of a large number of congruent non-overlapping circles inside a square by looking for configurations which maximize the packing density, defined as the ratio between the area occupied by the disks and the area of the square container. The search for these configurations is carried out with the help of two algorithms that we have devised: a first algorithm is in charge of obtaining sufficiently dense configurations starting from a random guess, while a second algorithm improves the configurations obtained in the first stage. The algorithms can be used sequentially or ind…
We present a one-parameter family of periodic packings of regular tetrahedra, with the packing fraction $100/117\approx0.8547$, that are simple in the sense that they are transitive and their repeating units involve only four tetrahedra. The construction of the packings was inspired from results of a numerical search that yielded a similar packing. We present an analytic construction of the packings and a description of their properties. We also present a transitive packing with a repeating unit of two tetrahedra and a packing fraction $\frac{139+40\sqrt{10}}{369}\approx0.7194$.
An ellipsoid, the simplest non-spherical shape, has been extensively used as models for elongated building blocks for a wide spectrum of molecular, colloidal and granular systems. Yet the densest packing of congruent hard ellipsoids, which is intimately related to the high-density phase of many condensed matter systems, is still an open problem. We discover a novel dense crystalline packing of ellipsoids containing 24 particles with a quasi-square-triangular (SQ-TR) tiling arrangement, whose packing density ϕ exceeds that of the SM2 crystal for aspect ratios α in (1.365, 1.5625), attaining a m…
Packings of regular convex polygons ($n$-gons) that are sufficiently dense have been studied extensively in the context of modeling physical and biological systems as well as discrete and computational geometry. Former results were mainly regarding densest lattice or double-lattice configurations. Here we consider all two-dimensional crystallographic symmetry groups (plane groups) by restricting the configuration space of the general packing problem of congruent copies of a compact subset of the two-dimensional Euclidean space to particular isomorphism classes of the discrete group of isometri…
Finding the densest sphere packing in $d$-dimensional Euclidean space $\mathbb{R}^d$ is an outstanding fundamental problem with relevance in many fields, including the ground states of molecular systems, colloidal crystal structures, coding theory, discrete geometry, number theory, and biological systems. Numerically generating the densest sphere packings becomes very challenging in high dimensions due to an exponentially increasing number of possible sphere contacts and sphere configurations, even for the restricted problem of finding the densest lattice sphere packings. In this paper, we app…
We consider dense random packing of disks with a power-law distribution of radii and investigate their correlation properties. We study the corresponding structure factor, mass-radius relation and pair distribution function of the disk centers. A toy model of dense segments in one dimension (1d) is solved exactly. It is shown theoretically in 1d and numerically in 1d and 2d that such packing exhibits fractal properties. It is found that the exponent of the power-law distribution and the fractal dimension coincide. An approximate relation for the structure factor in arbitrary dimension is deriv…
Among the family of hard convex lens-shaped particles (lenses), the one with aspect ratio equal to 2/3 is `optimal' in the sense that the maximally random jammed (MRJ) packings of such lenses achieve the highest packing fraction $ϕ_{\rm MRJ} \simeq 0.73$. This value is only a few percent lower than $ϕ_{\rm DKP} = 0.76210\dots$, the packing fraction of the corresponding densest-known crystalline (degenerate) packings. By exploiting the appreciably reduced propensity that a system of such optimal lenses has to positionally and orientationally order, disordered packings of them are progressively …
Dense hard-particle packings are intimately related to the structure of low-temperature phases of matter and are useful models of heterogeneous materials and granular media. Most studies of the densest packings in three dimensions have considered spherical shapes, and it is only more recently that nonspherical shapes (e.g., ellipsoids) have been investigated. Superballs (whose shapes are defined by |x1|^2p + |x2|^2p + |x3|^2p <= 1) provide a versatile family of convex particles (p >= 0.5) with both cubic- and octahedral-like shapes as well as concave particles (0 < p < 0.5) with octahedral-lik…
The densest local packings of N identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained using a nonlinear programming method operating in conjunction with a stochastic search of configuration space. Knowledge of Rmin(N) in d-dimensional Euclidean space allows for the construction both of a realizability condition for pair correlation functions of sphere packings and an upper bound on the maximal density of infinite sphere packings. In this paper, we focus on the two-dimensional circular disk problem. We find and present the putative dens…
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 objective function and impenetrability constraints can be exactly linearized for sphere packings with a size distribution in $d$-dimensional Euclidean space $\mathbb{R}^d$, it is most suitable and natural to solve the corresponding ASC optimization problem using sequential linear programming (SLP) techniques. We implement an SLP solution to produce robustly a wid…
Particle packing problems have fascinated people since the dawn of civilization, and continue to intrigue mathematicians and scientists. Resurgent interest has been spurred by the recent proof of Kepler's conjecture: the face-centered cubic lattice provides the densest packing of equal spheres with a packing fraction $ϕ\approx0.7405$ \cite{Kepler_Hales}. Here we report on the densest known packings of congruent ellipsoids. The family of new packings are crystal (periodic) arrangements of nearly spherically-shaped ellipsoids, and always surpass the densest lattice packing. A remarkable maximum …
Elementary smooth functions (beyond contact) are employed to construct pair correlation functions that mimic jammed disordered sphere packings. Using the g2-invariant optimization method of Torquato and Stillinger [J. Phys. Chem. B 106, 8354, 2002], parameters in these functions are optimized under necessary realizability conditions to maximize the packing fraction phi and average number of contacts per sphere Z. A pair correlation function that incorporates the salient features of a disordered packing and that is smooth beyond contact is shown to permit a phi of 0.6850: this value represents …
Packing spheres efficiently in large dimension $d$ is a particularly difficult optimization problem. In this paper we add an isotropic interaction potential to the pure hard-core repulsion, and show that one can tune it in order to maximize a lower bound on packing density. Our results suggest that exponentially many (in the number of particles) distinct disordered sphere packings can be effectively constructed by this method, up to a packing fraction close to $7\, d\, 2^{-d}$. The latter is determined by solving the inverse problem of maximizing the dynamical glass transition over the space o…
The influence of packing protocol, size ratio, and pore structure on fractal exponents in dense polydisperse packings
Joint Institute for Nuclear Research（俄罗斯联邦杜布纳联合核子研究所）；Dokuchaev Soil Science Institute（多卡恰耶夫土壤科学研究所）；Horia Hulubei National Institute of Physics and Nuclear Engineering（霍里亚·胡利贝伊国家物理与核工程研究所）；Craiova University（克赖奥瓦大学）
We study random dense packings of Heisenberg dipoles by numerical simulation. The dipoles are at the centers of identical spheres that occupy fixed random positions in space and fill a fraction $Φ$ of the spatial volume. The parameter $Φ$ ranges from rather low values, typical of amorphous ensembles, to the maximum $Φ$=0.64 that occurs in the random-close-packed limit. We assume that the dipoles can freely rotate and have no local anisotropies. As well as the usual thermodynamical variables, the physics of such systems depends on $Φ$. Concretely, we explore the magnetic ordering of these syste…
Packing frustration for confined fluids, i.e., the incompatibility between the preferred packing of the fluid particles and the packing constraints imposed by the confining surfaces, is studied for a dense hard-sphere fluid confined between planar hard surfaces at short separations. The detailed mechanism for the frustration is investigated via an analysis of the anisotropic pair distributions of the confined fluid, as obtained from integral equation theory for inhomogeneous fluids at pair correlation level within the anisotropic Percus-Yevick approximation. By examining the mean forces that a…
A finite element program is presented to simulate the process of packing and coiling elastic wires in two- and three-dimensional confining cavities. The wire is represented by third order beam elements and embedded into a corotational formulation to capture the geometric nonlinearity resulting from large rotations and deformations. The hyperbolic equations of motion are integrated in time using two different integration methods from the Newmark family: an implicit iterative Newton-Raphson line search solver, and an explicit predictor-corrector scheme, both with adaptive time stepping. These tw…
Using tempered Monte Carlo simulations, we study the the spin-glass phase of dense packings of Ising dipoles pointing along random axes. We consider systems of L^3 dipoles (a) placed on the sites of a simple cubic lattice with lattice constant $d$, (b) placed at the center of randomly closed packed spheres of diameter d that occupy a 64% of the volume. For both cases we find an equilibrium spin-glass phase below a temperature T_sg. We compute the spin-glass overlap parameter q and their associated correlation length xi_L. From the variation of xi_L with T and L we determine T_sg for both syste…
We use a hybrid Monte Carlo algorithm to simulate the shaking of spheres at different vibrational amplitudes, and find that spontaneous crystallisation occurs in specific dynamical regimes. Several crystallising transitions are typically observed, leading to end states which can be fully or partially ordered, depending on the shaking amplitude, which we investigate using metrics of global and local order. At the lowest amplitudes, crystallisation is incomplete, at least for our times of observation. For amplitude ranges where crystallisation is complete, there is typically a competition betwee…
Entropy drives the phase behavior of colloids ranging from dense suspensions of hard spheres or rods to dilute suspensions of hard spheres and depletants. Entropic ordering of anisotropic shapes into complex crystals, liquid crystals, and even quasicrystals has been demonstrated recently in computer simulations and experiments. The ordering of shapes appears to arise from the emergence of directional entropic forces (DEFs) that align neighboring particles, but these forces have been neither rigorously defined nor quantified in generic systems. Here, we show quantitatively that shape drives the…
