The covering-radius conjecture for lattice zonotopes in general linear position

Let S={z1,,zm}ZnS=\{\boldsymbol{z}_1,\dotsc,\boldsymbol{z}_m\}\subseteq\mathbb{Z}^n and let ZZ be the lattice zonotope generated by SS. The set SS is in LGP (general linear position) when every subset of at most nn vectors is linearly independent. The covering-radius conjecture. If SS is in LGP, then

μ(Z)nm.\mu(Z)\leq\frac{n}{m}.

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

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.