Tight instances of the Lonely Runner Conjecture: one-entry modifications and the growth of speeds

Yuhan Zhang

For a set $V$ of $n-1$ distinct positive integers let $\mathrm{LR}(V)={\max }_t{\min }_{v\in V}\Vert vt\Vert$, where $\Vert x\Vert$ is the distance from $x$ to the nearest integer. The Lonely Runner…