Related papers: The densest lattice in twenty-four dimensions
Experimental designs that spread out points apart from each other on projections are important for computer experiments when not necessarily all factors have substantial influence on the response. We provide a theoretical framework to…
This paper provides the currently best known upper bound on the density of a packing in three-dimensional Euclidean space of two types of spheres whose size ratio is the largest one that allows the insertion of a small sphere in each…
We study the polarization problem in dimension 2 for the honeycomb structure and compare it to the maximal polarization lattice, the hexagonal lattice. As expected, the hexagonal lattice has higher polarization than the honeycomb at all…
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…
We propose a unified framework that synthesizes advances in high-dimensional lattice theory with novel computational algorithms for the shortest vector problem (SVP) to model pure root lattices and compute sphere packing densities. Building…
Consider the integer best approximations of a linear form in $n\ge 2$ real variables. While it is well-known that any tail of this sequence always spans a lattice is sharp for any $n\ge 2$. In this paper, we determine the exact Hausdorff…
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…
The densest local packings of N identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained using a nonlinear programming method operating in conjunction with a stochastic search of…
In previous work [Phys. Rev. X 5, 021020 (2015)], it was shown that stealthy hyperuniform systems can be regarded as hard spheres in Fourier-space in the sense that the the structure factor is exactly zero in a spherical region around the…
Dense packings of hard particles have important applications in many fields, including condensed matter physics, discrete geometry and cell biology. In this paper, we employ a stochastic search implementation of the Torquato-Jiao…
We introduce an analytical iterative method, the density matrix recursion method, to generate arbitrary reduced density matrices of superpositions of short-range dimer coverings on periodic or non-periodic quantum spin-1/2 ladder lattices,…
In this paper, we present a method to construct the Leech lattice from other Niemeier lattices.
Suppose one has a collection of disks of various sizes with disjoint interiors, a packing in the plane, and suppose the ratio of the smallest radius divided by the largest radius lies between $1$ and $q$. In his 1964 book Regular Figures…
The problem of communicating over the additive white Gaussian noise (AWGN) channel with lattice codes is addressed in this paper. Theoretically, Voronoi constellations have proved to yield very powerful lattice codes when the fine/coding…
Optimal geometrical arrangements, such as the stacking of atoms, are of relevance in diverse disciplines. A classic problem is the determination of the optimal arrangement of spheres in three dimensions in order to achieve the highest…
We note that each lattice $L$ has a unique largest distributive quotient, of which every distributive quotient of $L$ is itself a quotient.
We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e.,…
We introduce a solvable lattice model for supersymmetric LLT polynomials, also known as super LLT polynomials, based upon particle interactions in super n-ribbon tableaux. Using operators on a Fock space, we prove a Cauchy identity for…
40 years ago, Conway and Sloane proposed using the highly symmetrical Coxeter-Todd lattice $K_{12}$ for quantization, and estimated its second moment. Since then, all published lists identify $K_{12}$ as the best 12-dimensional lattice…
We review a lattice construction arising from quaternion algebras over number fields and use it to obtain some known extremal and densest lattices in dimensions 8 and 16. The benefit of using quaternion algebras over number fields is that…