Eleven, twelve, and thirteen lonely runners
Touch Sungkawichai, Tanupat Trakulthongchai

TL;DR
This paper advances the proof of the Lonely Runner Conjecture for up to 12 runners by refining computational methods and employing new sieving and polynomial techniques.
Contribution
It introduces refined sieving and polynomial methods to verify the conjecture for specific cases up to 12 runners, extending previous computational verifications.
Findings
Verified the conjecture for k=10, 11, 12 using computer-assisted proofs.
Developed new sieving techniques to improve computational verification.
Applied polynomial methods to establish the conjecture under certain modular conditions.
Abstract
Wills conjectured that, for any non-zero integers , there is a real number such that, for all , \[\lVert tu_i\rVert\geq\frac{1}{k+1},\] where is the distance from to the closest integer. This statement is known as the Lonely Runner Conjecture. A computational method developed by Rosenfeld and the second author verified the conjecture for . We further refine this method with new sieving techniques and employ a polynomial method argument to show that any with satisfies the conjecture when and are both odd primes. Ultimately, we provide a computer-assisted proof of the Lonely Runner Conjecture for .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
