Related papers: Rigidity of spherical codes
An elementary construction using binary codes gives new record kissing numbers in dimensions from 32 to 128.
We study the ground states of cold atoms in the tight-binding bands built from p-orbitals on a two dimensional honeycomb optical lattice. The band structure includes two completely flat bands. Exact many-body ground states with on-site…
Spherical colloidal crystals (CCs) self-assemble on the interface between two liquids. These 2D structures unconventionally combine local hexagonal order and spherical geometry. Nowadays CCs are actively studied by altering their…
It was proven in the first author's paper "Contact 3-manifolds twenty years since J. Martinet's work" (Ann. Inst. Fourier, 42(1992), 165--192) that any tight contact structure on the 3-sphere is diffeomorphic to the standard one. It was…
Rod-like objects at high packing fractions can form smectic phases, where the rods break rotational and translational symmetry by forming lamellae. Smectic defects thereby include both discontinuities in the rod orientational order…
We introduce tile codes, a simple yet powerful way of constructing quantum codes that are local on a planar 2D-lattice. Tile codes generalize the usual surface code by allowing for a bit more flexibility in terms of locality and stabilizer…
We study 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…
Nearly perfect packing codes are those codes that meet the Johnson upper bound on the size of error-correcting codes. This bound is an improvement to the sphere-packing bound. A related bound for covering codes is known as the van Wee…
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…
Lattice and special nonlattice multilevel constellations constructed from binary codes, such as Constructions A, C, and D, have relevant applications in Mathematics (sphere packing) and in Communication (multi-stage decoding and efficient…
The suppression of density fluctuations at different length scales is the hallmark of hyperuniformity. However, its existence and significance in jammed solids is still a matter of debate. We explore the presence of this hidden order in a…
The self-assembly of hard polyhedral particles confined to a flat interface is studied using Monte Carlo simulations. The particles are pinned to the interface by restricting their movement in the direction perpendicular to it while…
In this paper, we give some new lower bounds for the kissing number of $\ell_p$-spheres. These results improve the previous work due to Xu (2007). Our method is based on coding theory.
Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions.…
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…
In this paper we show the existence of three dimensional rigid, and thus unfoldable, lattice conformations. The structure we found has 450+ bonds, and we provide a computer assisted proof of the existence of such structures. The existence…
We study the deformation of spherical conical metrics with at least some of the cone angles larger than $2\pi$. We show in this note via synthetic geometry that for one family of such metrics, there is local rigidity in the choice of cone…
Codes which attain the sphere packing bound are called perfect codes. The most important metrics in coding theory on which perfect codes are defined are the Hamming metric and the Johnson metric. While for the Hamming metric all perfect…
The densest local packing (DLP) problem in d-dimensional Euclidean space Rd involves the placement of N nonoverlapping spheres of unit diameter near an additional fixed unit-diameter sphere such that the greatest distance from the center of…
Ordered phases on curved substrates experience a complex interplay of ordering and intrinsic curvature, commonly producing frustration and singularities. This is an especially important issue in crystals as ever-smaller scale materials are…