Optimality of the Leech lattice for sphere lattice coverings in R^24

Determine whether the Leech lattice in 24 dimensions minimizes the lattice covering density among all lattices for coverings of R^24 by congruent Euclidean balls; equivalently, prove or refute that the Leech lattice achieves the optimal lattice sphere covering density in dimension 24.

Background

The paper studies the classical lattice covering problem, where the goal is to cover Rn with translates of an equal-radius Euclidean ball centered at lattice points and to minimize the covering density. The optimal lattice covering density in dimension n is denoted Θ_n.

While exact values of Θ_n are known only for n ≤ 5, the authors note that many questions remain unresolved. Among these is the widely discussed question of whether the Leech lattice in 24 dimensions provides the optimal lattice sphere covering, i.e., whether it minimizes the covering density among all lattices in R24.

Establishing the optimality (or otherwise) of the Leech lattice for coverings would settle Θ_24 and serve as a landmark result in the theory of lattice coverings, analogous to its central role in sphere packing.

References

Determining $\Theta_n$ seems a very difficult problem, with exact values known only for $n\le 5$ (see) and with many questions (such as, for example, whether the Leech lattice is optimal) being still open.

New upper bound for lattice covering by spheres  (2508.06446 - Gao et al., 8 Aug 2025) in Introduction, paragraph discussing known exact values and open questions (after the definition of Θ_n)