Related papers: On the hard sphere model and sphere packings in hi…
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…
We obtain new restrictions on the linear programming bound for sphere packing, by optimizing over spaces of modular forms to produce feasible points in the dual linear program. In contrast to the situation in dimensions 8 and 24, where the…
We apply a recent one-dimensional algorithm for predicting random close packing fractions of polydisperse hard spheres [Farr and Groot, J. Chem. Phys. 133, 244104 (2009)] to the case of lognormal distributions of sphere sizes and mixtures…
In this letter, we used a combination of DEM and the multi-sphere method to investigate the random packing dynamics of $\Sigma_{2v}(2\pi/3)$-triplets. These triplets consist of three overlapping primary spheres, forming a bent structure…
We consider the hypergraph Tur\'an problem of determining $\mathrm{ex}(n, S^d)$, the maximum number of facets in a $d$-dimensional simplicial complex on $n$ vertices that does not contain a simplicial $d$-sphere (a homeomorph of $S^d$) as a…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…
We study a random partial covering model on the $(d-1)$-dimensional unit sphere, where $N$ spherical caps are placed independently and uniformly at random, each covering a surface fraction of $1/N$. This model provides a continuous…
We show that near densest-packing the perturbations of the HCP structure yield higher entropy than perturbations of any other densest packing. The difference between the various structures shows up in the correlations between motions of…
We consolidate what is currently known about packing densities of 4-point permutations and in the process improve the lower bounds for the packing densities of 1324 and 1342. We also provide rigorous upper bounds for the packing densities…
In a recent paper by Giuliani and Rothman \cite{GR}, the problem of finding a lower bound on the radius $R$ of a charged sphere with mass M and charge Q<M is addressed. Such a bound is referred to as the critical stability radius.…
Packing problems have been of great interest in many diverse contexts for many centuries. The optimal packing of identical objects has been often invoked to understand the nature of low temperature phases of matter. In celebrated work,…
The isoperimetric problem with a density or weighting seeks to enclose prescribed weighted area with minimum weighted perimeter. According to Chambers' recent proof of the Log Convex Density Conjecture, for many densities on $\mathbb{R}^n$…
Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…
We have identified some necessary conditions for the existence of rigid sphere designs. In particular, we have successfully resolved the conjecture proposed by [Ban87]; Given fixed positive integers t and d, we show that there exist only…
The amount of information propagated by an intermediate heavy particle exhibits characteristic features in inelastic scatterings with $n\geq 3$ final particles. As the total energy increases, the entanglement entropy, between its decay…
The packing density of the regular cross-polytope in Euclidean $n$-space is unknown except in dimensions $2$ and $4$ where it is 1. The only non-trivial upper bound is due to Gravel, Elser, and Kallus (2011) who proved that for $n=3$ the…
The entropic moments of the probability density of a quantum system in position and momentum spaces describe not only some fundamental and/or experimentally accessible quantities of the system, but also the entropic uncertainty measures of…
In a previous work, a simple approach to derive the jamming packing fraction of a hard-sphere mixture from the knowledge of the random close-packing fraction of the monocomponent system was proposed. Now, an extension of that approach is…
This paper encompasses the mathematical derivations of the analytic and generalized formula and recurrence relations to find out the radii of n umber of circles inscribed or packed in the plane region bounded by circular arcs (including…
The goal of random sequential adsorption (RSA), a time-dependent packing method, is to create a regular or asymmetric covering of an empty space that can fit in the allocated space without overlapping. The density of coverage tends to reach…