Bounds on the density of smooth lattice coverings
Number Theory
2023-11-09 v1 Information Theory
math.IT
Abstract
Let be a convex body in , let be a lattice with covolume one, and let . We say that and form an -smooth cover if each point is covered by translates of by . We prove that for any positive , asymptotically as , for any of volume , one can find a lattice for which form an -smooth cover. Moreover, this property is satisfied with high probability for a lattice chosen randomly, according to the Haar-Siegel measure on the space of lattices. Similar results hold for random construction A lattices, albeit with a worse power law, provided the ratio between the covering and packing radii of with respect to is at most polynomial in . Our proofs rely on a recent breakthrough by Dhar and Dvir on the discrete Kakeya problem.
Cite
@article{arxiv.2311.04644,
title = {Bounds on the density of smooth lattice coverings},
author = {Or Ordentlich and Oded Regev and Barak Weiss},
journal= {arXiv preprint arXiv:2311.04644},
year = {2023}
}