Covering product conjecture
Let be a convex body in and let be a lattice in . Let denote the covering minima.
Covering product conjecture. One has
and this bound is best possible.
The conjecture is presented as a covering-minima analogue of the volume inequalities for packing minima and is attributed to the cited work. Its validity is not resolved in the source.
References
Primary source
Martin Henk, Matthias Schymura and Fei Xue, “Packing minima and lattice points in convex bodies”, arXiv:2005.02234 (2020).
Additional references
2 papers in this index state this conjecture (2019–2020). The statement above is taken from the most recent of them; the others are arXiv:1903.02866.
Progress summary
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.