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 well as certain spindle and ring tori can achieve a packing density higher than the densest known packing of both sphere and ellipsoids. In addition, we study dense packings of cluster of pair-linked ring tori (i.e., Hopf links).
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…
尽可能密集地填充粒子系统的问题是离散几何领域的基础,也是材料和生物科学中的一个强大模型。随着填充问题从解析构造的解决方案范围内撤退,进行\textit{de novo}(从头开始)搜索密集填充的有效数值方法的重要性变得至关重要。在本文中,我们使用\textit{divide and concur}框架,发展了一个通用的搜索法的周期约束问题的解决方案,我们把它应用到发现密集周期包装。该方法的一个重要特点是将晶胞参数与组态空间定义中的其他填充变量相结合。我们提出的方法导致了[arXiv:0910.5226]中报道的最密集的已知四面体堆积的改进。在这里,我们使用的方法来重现dennies已知的晶格球包装和最知名的晶格接吻安排分别在14和11维(第一个这样的数字证据,他们的最优性,在这些方面)。对于非球形粒子,我们报告了一个新的密度为$ϕ=128/219\approx0.5845$的规则四维单形的稠密堆积,并具有与已知的四面体堆积类似的结构。
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 …
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(克赖奥瓦大学)
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 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 dimensiona…
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…