The short-progression exclusion for the Loneliness Spectrum

At least 6 years old · documented by

Let n≥2n\geq2 and let v1,…,vnv_1,\ldots,v_n be positive integers, each at most 1.501n1.501n. Define

ML⁡(v1,…,vn)=max⁡t∈Rmin⁡1≤i≤n∥tvi∥.\operatorname{ML}(v_1,\ldots,v_n)=\max_{t\in\mathbb{R}}\min_{1\leq i\leq n}\Vert tv_i\Vert.

Short-progression exclusion conjecture. One has

ML⁡(v1,…,vn)≠33n+2.\operatorname{ML}(v_1,\ldots,v_n)\neq\frac{3}{3n+2}.

The claim is presented as a proposed first step toward extending the spectrum results to larger ranges of speeds. It is not established in the stated passage and remains open.

References

Primary source

Noah Kravitz, “Barely lonely runners and very lonely runners”, arXiv:1912.06034 (2019).

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.