Related papers: Geometrical Frustration: A Study of 4d Hard Sphere…
The determination of the densest packings of regular tetrahedra (one of the five Platonic solids) is attracting great attention as evidenced by the rapid pace at which packing records are being broken and the fascinating packing structures…
The isothermal, isobaric spontaneous crystallization of a supercooled polymer melt is investigated by MD simulation of an ensemble of fully-flexible linear chains. Frustration is introduced via two incommensurate length scales set by the…
We study the sphere packing problem in Euclidean space where we impose additional constraints on the separations of the center points. We prove that any sphere packing in dimension $48$, with spheres of radii $r$, such that no two centers…
The icosidodecahedron has 30 vertices, one at the center of each edge of a regular icosahedron -- or equivalently, one at the center of each edge of a regular dodecahedron. It is a beautiful, highly symmetrical shape. But it is just a…
We study polyiamonds (polygons arising from the triangular grid) that fold into the smallest yet unstudied platonic solid -- the octahedron. We show a number of results. Firstly, we characterize foldable polyiamonds containing a hole of…
Hard spheres are ubiquitous in condensed matter: they have been used as models for liquids, crystals, colloidal systems, granular systems, and powders. Packings of hard spheres are of even wider interest, as they are related to important…
Geometric frustration is an approach to the glass transition based upon the consideration of locally favoured structures (LFS), which are geometric motifs which minimise the local free energy. Geometric frustration proposes that a…
The probability of finding a spherical "hole" of a given radius $r$ contains crucial structural information about many-body systems. Such hole statistics, including the void conditional nearest-neighbor probability functions $G_V(r)$, have…
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,…
This is the eighth and final paper in a series giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is…
We consider the computation of the volume of the union of high-dimensional geometric objects. While showing that this problem is #P-hard already for very simple bodies (i.e., axis-parallel boxes), we give a fast FPRAS for all objects where…
This is the fifth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…
Geometric frustration inhibits magnetic systems from ordering, opening a window to unconventional phases of matter. The paradigmatic frustrated lattice in three dimensions to host a spin liquid is the pyrochlore, although there remain few…
The density of a code is the fraction of the coding space covered by packing balls centered around the codewords. This paper investigates the density of codes in the complex Stiefel and Grassmann manifolds equipped with the chordal…
Halbach spheres provide a theoretically elegant means of generating highly homogeneous magnetic fields, but practical implementation is hindered by challenging fabrication and restricted interior access. This study examines discrete…
How many unit $n-$dimensional spheres can simultaneously touch or kiss a central $n-$dimensional unit sphere? Beyond mathematics this question has implications for fields such as cryptography and the structure of biologic and chemical…
The formation of quasi-spherical cages from protein building blocks is a remarkable self-assembly process in many natural systems, where a small number of elementary building blocks are assembled to build a highly symmetric icosahedral…
The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of any set of n points in R^3 with spread D has complexity O(D^3). This bound is tight in the…
In this paper, we determine the topology of the spaces of convex polyhedra inscribed in the unit $2$-sphere and the spaces of strictly Delaunay geodesic triangulations of the unit $2$-sphere. These spaces can be regarded as discretized…
As an instance of geometrical frustration with non-magnetic degrees of freedom, we explore the physics of local spin $S\geq 1$ moments on the pyrochlore lattice that interact via pure quadrupolar couplings. In the presence of spin-orbit…