The cosimple zonotope covering-radius conjecture
The cosimple zonotope covering-radius conjecture
Let a finite collection of lattice vectors spanning be cosimple if it has a linear dependence whose coefficients are all non-zero and have pairwise different absolute values. A lattice zonotope generated by a cosimple collection is a cosimple zonotope. Cosimple zonotope covering-radius conjecture. Every cosimple zonotope with generators in has covering radius at most
This conjecture generalizes the shifted Lonely Runner Conjecture because every Strong Lonely Runner Zonotope with generators is a cosimple -zonotope. The paper introduces it to address the fact that projections of Strong Lonely Runner Zonotopes need not remain Strong Lonely Runner Zonotopes; its general status is open.
Sources & referencesView supporting material
Primary source
Romanos Diogenes Malikiosis, Francisco Santos and Matthias Schymura, “Linearly-exponential checking is enough for the Lonely Runner Conjecture and some of its variants”, arXiv:2411.06903 (2025).
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.