Related papers: The sphere packing problem in dimension 8
We introduce a new method from number fields and codes to construct dense packings in the Euclidean spaces. Via the canonical $\mathbb{Q}$-embedding of arbitrary number field $K$ into $\mathbb{R}^{[K:\mathbb{Q}]}$, both the prime ideal…
We study the elliptic curves given by $y^2 = x^3 + b x + t^{3^n+1}$ over global function fields of characteristic $3$; in particular we perform an explicit computation of the $L$-function by relating it to the zeta function of a certain…
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…
Motivated by the search for best lattice sphere packings in Euclidean spaces of large dimensions we study randomly generated perfect lattices in moderately large dimensions (up to d=19 included). Perfect lattices are relevant in the…
We prove the existence of exotic but homotopically trivial contact structures on spheres of dimension 8k-1. Together with previous results of Eliashberg and the second author this establishes the existence of such structures on all…
We analyze the general problem of determining optimally dense packings, in a Euclidean or hyperbolic space, of congruent copies of some fixed finite set of bodies. We are strongly guided by examples of aperiodic tilings in Euclidean space…
This paper presents new lower bounds for the lattice covering densities of simplices by studying the Degree-Diameter Problem for abelian Cayley digraphs. In particular, it proves that the density of any lattice covering of a tetrahedron is…
We define three-point bounds for sphere packing that refine the linear programming bound, and we compute these bounds numerically using semidefinite programming by choosing a truncation radius for the three-point function. As a result, we…
Using transversality and a dimension reduction argument, a result of A. Bezdek and W. Kuperberg is applied to polycylinders $\mathbb{D}^2\times \mathbb{R}^n$, showing that the optimal packing density is $\pi/\sqrt{12}$ in any dimension.
The minimal spherical cap dispersion ${\rm disp}_{\mathcal{C}}(n,d)$ is the largest number $\varepsilon\in (0,1]$ such that, for every $n$ points on the $d$-dimensional Euclidean unit sphere $\mathbb{S}^d$, there exists a spherical cap with…
We develop the notion of a Kleinian Sphere Packing, a generalization of "crystallographic" (Apollonian-like) sphere packings defined by Kontorovich-Nakamura [KN19]. Unlike crystallographic packings, Kleinian packings exist in all…
Let $\Gamma$ denote a lattice in $SU(1,p)$, with $p$ greater than 1. We show that there exists no Zariski dense maximal representation with target $SU(m,n)$ if $n>m>1$. The proof is geometric and is based on the study of the rigidity…
We prove that the discrete Hardy-Littlewood maximal function associated with Euclidean spheres with small radii has dimension-free estimates on $\ell^p(\mathbb{Z}^d)$ for $p\in[2,\infty).$ This implies an analogous result for the Euclidean…
Two constructions of lattice packings of $ n $-dimensional cross-polytopes ($ \ell_1 $ balls) are described, the density of which exceeds that of any prior construction by a factor of at least $ 2^{\frac{n}{\ln n}(1 + o(1))} $ when $ n \to…
In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…
In this article we obtain linear programming bounds for the maximal sphere packing density of commutative spaces. A special case of our results solves a conjecture by Cohn and Zhao on linear programming bounds for sphere packings in…
Packing problems have been a source of fascination for millenia and their study has produced a rich literature that spans numerous disciplines. Investigations of hard-particle packing models have provided basic insights into the structure…
The problem of finding the asymptotic behavior of the maximal density of sphere packings in high Euclidean dimensions is one of the most fascinating and challenging problems in discrete geometry. One century ago, Minkowski obtained a…
The maximal density of a measurable subset of R^n avoiding Euclidean distance1 is unknown except in the trivial case of dimension 1. In this paper, we consider thecase of a distance associated to a polytope that tiles space, where it is…
We discuss the high density behavior of a system of hard spheres of diameter d on the hypercubic lattice of dimension n, in the limit n -> oo, d -> oo, d/n=delta. The problem is relevant for coding theory. We find a solution to the…