Metraipolis › archive › dc_3d024405ad3b
Lonely Runner Relations — arXiv:2609.06259
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.06259
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:48:32.848Z
- SHA-256 of the archived text
9561c9dedbcadbd166d6904f04ec285acf2ae43821b1495e05ecce725ec5a07e- Stable URL of this page
https://metraipolis.com/documento/dc_3d024405ad3b
How to cite
Lonely Runner Relations — arXiv:2609.06259 — arXiv (en), https://arxiv.org/abs/2609.06259 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3d024405ad3b (Metraipolis archive dc_3d024405ad3b, sha256 9561c9dedbcadbd166d6904f04ec285acf2ae43821b1495e05ecce725ec5a07e)
BibTeX
@misc{dc3d024405ad3b,
title = {Lonely Runner Relations — arXiv:2609.06259},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.06259},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3d024405ad3b; sha256 9561c9dedbcadbd166d6904f04ec285acf2ae43821b1495e05ecce725ec5a07e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06259. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the Lonely Runner Conjecture (LRC), conceived by Jörg M. Wills in the 1960's: Given positive integers $n_1, n_2, \dots, n_k$, there exists a positive real number $t$ such that for all $1 \le j \le k$ the distance of $t \,n_j$ to the nearest integer is at least $\frac{ 1 }{ k+1 }$. We prove that for any counterexample or tight instance $\mathbf{n}$ of LRC, $\mathbf{m} \cdot \mathbf{n} = 0$ for some $\mathbf{m} \in \mathbb{Z}^k$ with $0 < \| \mathbf{m} \|_1 \le \min(2k+3, \ \frac{ k+1 }{ k-1 } \mathrm{flt}(k))$ where $\mathrm{flt}(k)$ denotes Khinchin's (1948) flatness constant limiting the lattice width of a $k$-dimensional convex body without interior integer points. In other words, potential counterexamples to LRC lie on a finite set of hyperplanes in the parameter space. Our proofs use Fourier analysis and a geometric reformulation of LRC, and our results generalize to the situation of shifted lonely runners of varying measures of loneliness. Our results imply and generalize a theorem of Czerwiński (2012) that when we choose $\mathbf{n}$ at random then, with probability tending to 1, the measure of loneliness $\frac{1}{ k+1 }$ can be replaced by $\frac 1 2 - \epsilon$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Number Theory (math.NT).
Pagina del lavoro: https://arxiv.org/abs/2609.06259 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:32:29.782Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).