Estimate for the fractal dimension of the Apollonian gasket in d dimensions

The number of independent sets is equivalent to the partition function of the hard-core lattice gas model with nearest-neighbor exclusion and unit activity. We study the number of independent sets $m_{d,b}(n)$ on the generalized Sierpinski gasket $SG_{d,b}(n)$ at stage $n$ with dimension $d$ equal to two, three and four for $b=2$, and layer $b$ equal to three for $d=2$. The upper and lower bounds for the asymptotic growth constant, defined as $z_{SG_{d,b}}=\lim_{v \to \infty}...

Packings of identical objects have fascinated both scientists and laymen alike for centuries, in particular the sphere packings and the packings of identical regular tetrahedra. Mathematicians have tried for centuries to determine the densest packings; Crystallographers and chemists have been fascinated by the lattice packings for centuries as well. On the other hand, physicists, geologists, material scientists and engineers have been challenged by the mysterious random packi...

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 $\phi_{\mathrm{RCP}}=0.65896$ in $d=3$ and $\phi_{\mathrm{RCP}}=0.88648$ in $d=2$. These values are well within the interval of values reported in the literature using different methods (experiments and numerical simulations) and protocols. This order-...

A set of $N$ points is chosen randomly in a $D$-dimensional volume $V=a^D$, with periodic boundary conditions. For each point $i$, its distance $d_i$ is found to its nearest neighbour. Then, the maximal value is found, $d_{max}=max(d_i, i=1,...,N)$. Our numerical calculations indicate, that when the density $N/V$=const, $d_{max}$ scales with the linear system size as $d^2_{max}\propto a^\phi$, with $\phi=0.24\pm0.04$ for $D=1,2,3,4$.

In this paper, we explore the geometry and the arithmetic of a family of polytopal sphere packings induced by regular polytopes in any dimension. We prove that every integral polytope is crystallographic, and we show that there are 11 crystallographic regular polytopes in any dimension. After introducing the notion of Apollonian section, we determine which Platonic crystallographic packings emerge as cross-sections of the Apollonian arrangements of the regular 4-polytopes. Ad...

In this article, we investigate several properties of high-dimensional random Apollonian networks (HDRANs), including two types of degree profiles, the small-world effect (clustering property), sparsity, and three distance-based metrics. The characterizations of degree profiles are based on several rigorous mathematical and probabilistic methods, such as a two-dimensional mathematical induction, analytic combinatorics, and P\'{o}lya urns, etc. The small-world property is unco...

Matter gets organized at several levels of structural rearrangements. At mesoscopic level one can distinguish between two types of rearrangements, conforming to different close-packing or densification conditions, appearing during different evolution stages. The cluster formations appear to be temperature- and space-dimension dependent. They suffer a type of Verhulst-like saturation (frustration) when one couples the growing (instability) and mechanical stress relaxation mode...

Motivated by a recently identified severe discrepancy between a static and a dynamic theory of glasses, we numerically investigate the behavior of dense hard spheres in spatial dimensions 3 to 12. Our results are consistent with the static replica theory, but disagree with the dynamic mode-coupling theory, indicating that key ingredients of high-dimensional physics are missing from the latter. We also obtain numerical estimates of the random close packing density, which provi...

The densest local packing (DLP) problem in d-dimensional Euclidean space Rd involves the placement of N nonoverlapping spheres of unit diameter near an additional fixed unit-diameter sphere such that the greatest distance from the center of the fixed sphere to the centers of any of the N surrounding spheres is minimized. Solutions to the DLP problem are relevant to the realizability of pair correlation functions for packings of nonoverlapping spheres and might prove useful in...

Random packing of spheres inside fractal collectors of dimension 2 < d < 3 is studied numerically using Random Sequential Adsorption (RSA) algorithm. The paper focuses mainly on the measurement of random packing saturation limit. Additionally, scaling properties of density autocorrelations in the obtained packing are analyzed. The RSA kinetics coefficients are also measured. Obtained results allow to test phenomenological relation between random packing saturation density and...