For an integer , a convex body is a compact convex set with nonempty interior. For a full-rank lattice , write for its covolume. An exact lattice covering of is a covering by translates with centers in . The density of this covering is , with Euclidean volume in the numerator. The lattice covering density is the infimum of these densities over all exact lattice coverings of . The question is the growth with of the largest possible .
Rogers proved that every convex body admits a translative covering of density at most , with centers that need not form one lattice. For lattice coverings, Rogers obtained the bound , and Ordentlich, Regev and Weiss the bound . Li and Liu proved uniformly over convex bodies, with an absolute constant and tending to zero as ; their binary-correction companion lowers the exponent of to . Li and Liu also give, in every large enough dimension, bodies with lattice covering density at least .
The preprint proves that there is an absolute constant such that, for every integer and every convex body , one full-rank lattice gives an exact covering of density at most . With the lower bound of Li and Liu, the largest lattice covering density in dimension is of order .
The Lean library LatticeCovering proves the preprint’s main theorem as the preprint states it, with no hypotheses beyond and being a convex body.
The results on these pages are those of the Lean library, each stated as the Lean library states it and linked to the Lean declaration behind it. Lean has checked every one of them, so the Lean library is the reference: where the preprint states a result differently, the statement on the page is the Lean library’s, and the preprint’s is given beside it. The preprint gives the results their order and their names.
LatticeCovering is a Lean library: 17 items, in six groups. Each has a page written by OctoInform, listed below.
No item matches.