The strong Lonely Runner Conjecture

Let mm be a positive integer, let dd be a parameter, and let v1,,vmR>0v_1,\dotsc,v_m\in\mathbb{R}_{>0} satisfy dimQ(v1,,vm)d\dim_{\mathbb{Q}}(v_1,\dotsc,v_m)\geq d. The strong Lonely Runner Conjecture. There exists tRt\in\mathbb{R} such that

1m+2d{tvi}m+1dm+2d,1im.\frac{1}{m+2-d}\leq\{tv_i\}\leq\frac{m+1-d}{m+2-d},\qquad 1\leq i\leq m.

This strengthens the Diophantine-approximation formulation of the Lonely Runner Conjecture by allowing arbitrary positive real velocities with a prescribed rational dimension. 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.