A packing of spherical caps on the surface of a sphere (that is, a spherical code) is called rigid or jammed if it is isolated within the space of packings. In other words, aside from applying a global isometry, the packing cannot be deformed. In this paper, we systematically study the rigidity of spherical codes, particularly kissing configurations. One surprise is that the kissing configuration of the Coxeter–Todd lattice is not jammed, despite being locally jammed (each individual cap is held in place if its neighbors are fixed); in this respect, the Coxeter–Todd lattice is analogous to the face-centered cubic lattice in three dimensions. By contrast, we find that many other packings have jammed kissing configurations, including the Barn...
This thesis concentrates on a set of problems and approaches relating to the generation and analysis...
Packing problems, such as how densely objects can fill a volume, are among the most ancient and pers...
We identify the maximally dense lattice packings of tangent-disk trimers with fixed bond angles (θ =...
A packing of spherical caps on the surface of a sphere (that is, a spherical code) is called rigid ...
In this work we search for spherical codes in three to five dimensions using different global optimi...
The kissing number problem asks for the maximal number of non-overlapping unit balls in R^n that tou...
Motivated by biological questions, we study configurations of equal spheres that neither pack nor co...
Motivated by biological questions, we study configurations of equal spheres that neither pack nor co...
. The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which ...
We study packings of hard spheres on lattices. The partition function, and therefore the pressure, m...
This dissertation describes an investigation of jammed packings of frictionless hard particles, incl...
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. ...
Abstract—A new class of spherical codes is constructed by selecting a finite subset of flat tori fro...
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. ...
Packing problems, such as how densely objects can fill a volume, are among the most ancient and pers...
This thesis concentrates on a set of problems and approaches relating to the generation and analysis...
Packing problems, such as how densely objects can fill a volume, are among the most ancient and pers...
We identify the maximally dense lattice packings of tangent-disk trimers with fixed bond angles (θ =...
A packing of spherical caps on the surface of a sphere (that is, a spherical code) is called rigid ...
In this work we search for spherical codes in three to five dimensions using different global optimi...
The kissing number problem asks for the maximal number of non-overlapping unit balls in R^n that tou...
Motivated by biological questions, we study configurations of equal spheres that neither pack nor co...
Motivated by biological questions, we study configurations of equal spheres that neither pack nor co...
. The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which ...
We study packings of hard spheres on lattices. The partition function, and therefore the pressure, m...
This dissertation describes an investigation of jammed packings of frictionless hard particles, incl...
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. ...
Abstract—A new class of spherical codes is constructed by selecting a finite subset of flat tori fro...
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. ...
Packing problems, such as how densely objects can fill a volume, are among the most ancient and pers...
This thesis concentrates on a set of problems and approaches relating to the generation and analysis...
Packing problems, such as how densely objects can fill a volume, are among the most ancient and pers...
We identify the maximally dense lattice packings of tangent-disk trimers with fixed bond angles (θ =...