Related papers: Deriving Finite Sphere Packings
What is the longest rope on the unit sphere? Intuition tells us that the answer to this packing problem depends on the rope's thickness. For a countably infinite number of prescribed thickness values we construct and classify all solution…
An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper carries out the second step of that program. A sphere packing leads to a decomposition of $R^3$ into polyhedra. The polyhedra are divided…
Packings of hard polyhedra have been studied for centuries due to their mathematical aesthetic and more recently for their applications in fields such as nanoscience, granular and colloidal matter, and biology. In all these fields, particle…
We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…
We study the elliptic curves given by $y^2 = x^3 + b x + t^{3^n+1}$ over global function fields of characteristic $3$; in particular we perform an explicit computation of the $L$-function by relating it to the zeta function of a certain…
Dense, disordered packings of particles are useful models of low-temperature amorphous phases of matter, biological systems, granular media, and colloidal systems. The study of dense packings of nonspherical particles enables one to…
The article presents the mathematical sequences describing circle packing densities in four different geometric configurations involving a hexagonal lattice based equal circle packing in the Euclidian plane. The calculated sequences take…
It is shown that there is no quasi-sphere packing of the lattice grid Z^{d+1} or a co-compact hyperbolic lattice of H^{d+1} or the 3-regular tree \times Z, in R^d, for all d. A similar result is proved for some other graphs too. Rather than…
In this article we explore a symplectic packing problem where the targets and domains are $2n$-dimensional symplectic manifolds. We work in the context where the manifolds have first homology group equal to $\mathbb{Z}^n$, and we require…
It is known that any contact 3-manifold can be obtained by rational contact Dehn surgery along a Legendrian link L in the standard tight contact 3-sphere. We define and study various versions of contact surgery numbers, the minimal number…
The study on the relationship between the spheres and voids in packing system suggests that the edge effect at the interface between the container and the particles is an important factor lowering the packing ratio. To pack spheres in a…
In the first paper of this series, we introduced Voronoi correlation functions to characterize the structure of maximally random jammed (MRJ) sphere packings across length scales. In the present paper, we determine a variety of correlation…
We revisit the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
Here we study the multipacking problems for geometric point sets with respect to their Euclidean distances. We consider a set of $n$ points $P$ and define $N_s[v]$ as the subset of $P$ that includes the $s$ nearest points of $v \in P$ and…
Apollonian circle packings arise by repeatedly filling the interstices between mutually tangent circles with further tangent circles. In Euclidean space it is possible for every circle in such a packing to have integer radius of curvature,…
In this dissertation we attempt to answer the question of whether non-abelian gauge groups occur in all F-theory models with Picard number 20 and with a Calabi-Yau four-fold CY4 K3xK3. To do so we employ the Kneser-Nishiyama method to study…
For dealing with the equal sphere packing problem, we propose a serial symmetrical relocation algorithm, which is effective in terms of the quality of the numerical results. We have densely packed up to 200 equal spheres in spherical…
Using elementary number theory, we prove several results about the complexity of CR mappings between spheres. It is known that CR mappings between spheres, invariant under finite groups, lead to sharp bounds for degree estimates on real…
Packing problems have been a source of fascination for millenia and their study has produced a rich literature that spans numerous disciplines. Investigations of hard-particle packing models have provided basic insights into the structure…
Let $S_{0,n}$ be an $n$-punctured sphere. For $n\geq 4$, we construct a sequence $(\mathcal{X}_i)_{i\in\mathbb{N}}$ of finite rigid sets in the pants graph $\mathcal{P}(S_{0,n})$ such that $\mathcal{X}_1 \subset \mathcal{X}_2 \subset…