Linearly-exponential checking is enough for the Lonely Runner Conjecture and some of its variants

Romanos Diogenes Malikiosis, Francisco Santos, Matthias Schymura

Tao (2018) showed that in order to prove the Lonely Runner Conjecture (LRC) up to $n+1$ runners it suffices to consider positive integer velocities in the order of $n^{O(n^2)}$. Us…