The restricted amended Loneliness Spectrum Conjecture for four speeds

Let v1,v2,v3,v4v_1,v_2,v_3,v_4 be positive integers, and let

ML(v1,v2,v3,v4)=maxtRmin1i4tvi,\operatorname{ML}(v_1,v_2,v_3,v_4)=\max_{t\in\mathbb{R}}\min_{1\leq i\leq 4}\lVert tv_i\rVert,

where x\lVert x\rVert denotes the absolute distance from xx to the nearest integer. The restricted amended Loneliness Spectrum Conjecture. One has either

s,kN,k{1,2},ML(v1,v2,v3,v4)=s4s+k,\exists s,k\in\mathbb{N},\quad k\in\{1,2\},\quad \operatorname{ML}(v_1,v_2,v_3,v_4)=\frac{s}{4s+k},

or

ML(v1,v2,v3,v4)=15.\operatorname{ML}(v_1,v_2,v_3,v_4)=\frac{1}{5}.

The claim is motivated by computational evidence for four speeds: values with k{1,2}k\notin\{1,2\} were not found below the stated bound. The source presents it as a further conjecture, without a general proof.

Sources & referencesView supporting material

Primary source

Ho Tin Fan and Alec Sun, “Amending the Lonely Runner Spectrum Conjecture”, arXiv:2306.10417 (2026).

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.