Maximal covering density of the lattices LDnLD_n among covering maxima

For each n6n\geq 6, let LDnLD_n be the lattice defined in Dutour (2005), and let a covering maximum be a lattice whose covering density decreases under perturbation. The covering-density conjecture for LDnLD_n. The lattice LDnLD_n has maximal covering density among all covering maxima. This is motivated by the identification of LDnLD_n as a covering maximum and by the theorem classifying the seven-dimensional perfect Delaunay polytopes; partial enumerations in dimensions 88, 99, and 1010 support the conjecture, but the claim is not stated as resolved.

Sources & referencesView supporting material

Primary source

Mathieu Dutour Sikiric, “The seven dimensional perfect Delaunay polytopes and Delaunay simplices”, arXiv:1505.03687 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.