Maximum-loneliness formulation of the Lonely Runner Conjecture

Let $V=\{v_1,v_2,\dots,v_n\}$ be a set of $n$ distinct positive integers, and define the maximum loneliness by

$$\operatorname{ML}(V)=\operatorname{ML}(v_1,\dots,v_n)\vcentcolon=\max_{t\in\mathbf{T}}\left(\min_{j=1,\dots,n}\lVert tv_j\rVert_{\mathbf{T}}\right),$$

where $\mathbf{T}=\mathbf{R}/\mathbf{Z}$ and $\lVert\cdot\rVert_{\mathbf{T}}$ denotes the distance to the nearest integer. Lonely Runner Conjecture, maximum-loneliness formulation. If $v_1,v_2,\dots,v_n$ are $n$ distinct positive integers, then

$$\operatorname{ML}(v_1,\dots,v_n)\geqslant \frac{1}{n+1}.$$

This is the succinct formulation obtained after translating one runner's speed to zero; it is equivalent to the Lonely Runner Conjecture for $n+1$ runners. The notation is attributed in the source to Kravitz, and the conjecture remains open.