Related papers: Sphere packings III
Non-spherical emulsion droplets can be stabilized by densely packed colloidal particles adsorbed at their surface. In order to understand the microstructure of these surface packings, the ordering of hard spheres on ellipsoidal surfaces is…
Motivated by Guo-Luo's generalized circle packings on surfaces with boundary \cite{GL2}, we introduce the generalized sphere packings on 3-dimensional manifolds with boundary. Then we investigate the rigidity of the generalized sphere…
In 2008, Schmidt and Tuller stated a conjecture concerning optimal packing and covering of integers by translates of a given three-point set. In this note, we confirm their conjecture and relate it to several other problems in…
Building on Viazovska's recent solution of the sphere packing problem in eight dimensions, we prove that the Leech lattice is the densest packing of congruent spheres in twenty-four dimensions and that it is the unique optimal periodic…
Let $M$ be a complete Riemannian $3$-manifold with sectional curvatures between $0$ and $1$. A minimal $2$-sphere immersed in $M$ has area at least $4\pi$. If an embedded minimal sphere has area $4\pi$, then $M$ is isometric to the unit…
We use numerical simulation to investigate and analyze the way that rigid disks and spheres arrange themselves when compressed next to incommensurate substrates. For disks, a movable set is pressed into a jammed state against an ordered…
The Cohn-Elkies linear programming (LP) bound for sphere packing is known to be sharp in dimensions 8 and 24 but in no other dimension above 2. We investigate why by examining three independent necessary conditions for LP sharpness, drawn…
We say that a tiling separates discs of a packing in the Euclidean plane, if each tile contains exactly one member of the packing. It is a known elementary geometric problem to show that for each locally finite packing of circular discs,…
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…
Despite its long history, there are many fundamental issues concerning random packings of spheres that remain elusive, including a precise definition of random close packing (RCP). We argue that the current picture of RCP cannot be made…
In this paper we study the hard sphere packing problem in the Hamming space by the cavity method. We show that both the replica symmetric and the replica symmetry breaking approximations give maximum rates of packing that are asymptotically…
In hyperbolic space density cannot be defined by a limit as we define it in Euclidean space. We describe the local density bounds for sphere packings and we discuss the different attempts to define optimal arrangements in hyperbolic space.
Using computed x-ray tomography we determine the three dimensional (3d) structure of binary hard sphere mixtures as a function of composition and size ratio of the particles, q. Using a recently introduced four-point correlation function we…
A brief report on recent work on the sphere-packing problem.
In this paper we have proved several approximation theorems for the family of minimal surfaces in R^3 that imply, among other things, that complete minimal surfaces are dense in the space of all minimal surfaces endowed with the topology of…
This is an innovative treatise on triangles, resting upon 1) 3-body problem techniques including mass-weighted relative Jacobi coordinates. 2) Part I's detailed layer-by-layer topological and geometrical study of Kendall-type shape spaces -…
Inversive geometry can be used to generate exactly self-similar space-filling sphere packings. We present a construction method in two dimensions and generalize it to search for packings in higher dimensions. We newly discover 29…
The high-density plaquette percolation model in d dimensions contains a surface that is homeomorphic to the (d-1)-sphere and encloses the origin. This is proved by a path-counting argument in a dual model. When d=3, this permits an improved…
By means of numerical simulations, we study the influence of confinement on three-dimensional random close packed (RCP) granular materials subject to gravity. The effects of grain shape (spherical or polyhedral) and polydispersity on this…
The main purpose of this article is to demonstrate three techniques for proving algebraicity statements about circle packings. We give proofs of three related theorems: (1) that every finite simple planar graph is the contact graph of a…