Related papers: Explicit Analytical Solution for Random Close Pack…
A reproducible RCP state is obtained by a well-defined rate process, which is first-order in free volume, starting from an equilibrium thermodynamic state of the hard-sphere fluid. The RCP state is also reproduced by a thermodynamic pathway…
We develop a model to describe the properties of random assemblies of polydisperse hard spheres. We show that the key features to describe the system are (i) the dependence between the free volume of a sphere and the various coordination…
The structure of random sphere packings in mechanical equilibrium in prescribed stress states, as studied by molecular dynamics simulations, strongly depends on the assembling procedure. Frictionless packings in the limit of low pressure…
For any integers $n\geq 2$ and $1\leq r\leq n-1$ satisfying $3r\geq 2n-1$, we show that the expected volume fraction of a random degree $d$ complex submanifold of $\C\mathbb{P}^n$ of codimension $r$ where the bisectional holomorphic…
We develop a simple analytical theory that relates dense sphere packings in a cylinder to corresponding disk packings on its surface. It applies for ratios R=D/d (where d and D are the diameters of the hard spheres and the bounding…
We present a statistical mechanical description of randomly packed spherical particles, where the average coordination number is treated as a macroscopic thermodynamic variable. The overall packing entropy is shown to have two…
We study the structural properties of two-dimensional granular packings prepared by random deposition from a source line. We consider a class of random ballistic deposition models based on single-particle relaxation rules controlled by a…
Sphere packing problems have a rich history in both mathematics and physics; yet, relatively few analytical analyses of sphere packings exist, and answers to seemingly simple questions are unknown. Here, we present an analytical method for…
We propose a theory which describes the density relaxation of loosely packed, cohesionless granular material under mechanical tapping. Using the compactivity concept we develope a formalism of statistical mechanics which allows us to…
The {\it number rigidity} of a stationary point process $\mathsf{P}$ entails that for a bounded set $A$ the knowledge of $\mathsf{P}$ on $A^{c}$ a.s. determines $\mathsf{P}(A)$; the $k$-order rigidity means the moments of $\mathsf{P}1_{A}$…
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…
We continue our investigation of the fractal uncertainty principle (FUP) for random fractal sets. In the prequel (arXiv:2107.08276), we considered the Cantor sets in the discrete setting with alphabets randomly chosen from a base of digits…
Discrete particle simulations have become the standard in science and industrial applications exploring the properties of particulate systems. Most of such simulations rely on the concept of interacting spherical particles to describe the…
Random packings and their properties are a popular and active field of research. Numerical algorithms that can efficiently generate them are useful tools in their study. This paper focuses on random packings produced according to the random…
We study the $d$-dimensional Vector Bin Packing ($d$VBP) problem, a generalization of Bin Packing with central applications in resource allocation and scheduling. In $d$VBP, we are given a set of items, each of which is characterized by a…
Motivated by the search for best lattice sphere packings in Euclidean spaces of large dimensions we study randomly generated perfect lattices in moderately large dimensions (up to d=19 included). Perfect lattices are relevant in the…
We revisit the deadline version of the discrete time-cost tradeoff problem for the special case of bounded depth. Such instances occur for example in VLSI design. The depth of an instance is the number of jobs in a longest chain and is…
Various real-world problems consist of partitioning a set of locations into disjoint subsets, each subset spread in a way that it covers the whole set with a certain radius. Given a finite set S, a metric d, and a radius r, define a subset…
We study the hard-core model of statistical mechanics on a unit cubic lattice $\mathbb{Z}^3$, which is intrinsically related to the sphere-packing problem for spheres with centers in $\mathbb{Z}^3$. The model is defined by the sphere…
Disordered assemblies with maximum packing fraction are studied by discrete element numerical simulation for monodisperse or bidisperse spherical particles, the diameter ratio being set at three. A maximum packing fraction value corresponds…