The covering-radius conjecture for lattice zonotopes in general linear position
The covering-radius conjecture for lattice zonotopes in general linear position
Let and let be the lattice zonotope generated by . The set is in LGP (general linear position) when every subset of at most vectors is linearly independent. The covering-radius conjecture. If is in LGP, then
This would sharpen the asymptotic bounds for covering radii of lattice zonotopes and, through the paper's equivalences, improve the corresponding bounds for billiard-ball motions and view-obstruction problems. The source gives no resolution evidence.
Sources & referencesView supporting material
Primary source
Matthias Henze and Romanos-Diogenes Malikiosis, “On the covering radius of lattice zonotopes and its relation to view-obstructions and the lonely runner conjecture”, arXiv:1609.01939 (2016).
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
Sign in to submit a solution.
No solutions have been posted yet.