math.MG — Metric Geometry
Contributed by Scott Kominers
We show that for every convex body K⊂Rn (n≥2), every 0<ε<1, and every prescribed density ρ≥Aεnlogn, there is an arrangement of translates of K along a single lattice with mean multiplicity exactly ρ and multiplicity at least (1−ε)ρ everywhere. Consequently, lattice k-fold coverings exist with density at most max{(1+ε)k,Cεnlogn}, where Cε depends only on ε. In sufficiently large dimension n, a version with prescribed common covolume holds simultaneously for up to exp(nc0) bodies whose uniform distributions have a common covariance matrix, with
c0>0 absolute. The proof builds on OpenAI's horizontal–vertical construction for single-lattice coverings and uses Gaussian layer averaging and Laplace bounds for covering counts.
A mix of human-written and AI-generated textHuman understanding: all partsGeometry of numbersconvex bodiesconvex geometrycovering densitycovering multiplicitylattice coveringmulti-covering