Amending the Lonely Runner Spectrum Conjecture

arXiv2306.10417MaRDI QIDQ6440641FDOQ6440641

Authors: Ho Tin Fan, Alec Sun 

Publication date: 17 June 2023

Abstract: Let $|x|$ be the absolute distance from $x$ to the nearest integer. For a set of distinct positive integral speeds $v_1,ldots,v_n$, we define its maximum loneliness to be ${\displaystyle }$ ext{ML}(v_1,ldots,v_n) = max_{t in mathbb{R}}min_{1 leq i leq n} |tv_i|${\displaystyle }$ The Loneliness Spectrum Conjecture, recently proposed by Kravitz, asserts that ${\displaystyle }$exists s in mathbb{N}, ext{ML}(v_1,ldots,v_n) = frac{s} {sn + 1} ext{ or } ext{ML}(v_1,ldots,v_n) ge frac{1}{n}${\displaystyle }$ We disprove the Loneliness Spectrum Conjecture for $n=4$ and propose an alternative conjecture. We confirm the amended conjecture for $n=4$ if any pair of speeds share a common factor of at least $3$ and also prove some related results.

This page was built for publication: Amending the Lonely Runner Spectrum Conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6440641)