The zonotopal Lonely Runner Conjecture

Let Z=i=1n[0,ui]Rn1Z=\sum_{i=1}^n[\mathbf{0},\mathbf{u}_i]\subseteq\mathbb{R}^{n-1} be a lattice zonotope of dimension n1n-1 with nn generators, whose every n1n-1 generators are linearly independent; such a zonotope is a Lonely Runner Zonotope. Let

x=12(u1++un)\mathbf{x}=\frac{1}{2}(\mathbf{u}_1+\dotsb+\mathbf{u}_n)

be its center. Zonotopal Lonely Runner Conjecture. For every Lonely Runner Zonotope ZZ,

n1n+1(Zx)(x+Zn1).\frac{n-1}{n+1}(Z-\mathbf{x})\cap(\mathbf{x}+\mathbb{Z}^{n-1})\neq\varnothing.

This is a geometric reformulation of the Lonely Runner Conjecture. The paper uses it to translate the problem into lattice-point and covering questions for zonotopes; its general validity remains 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

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.