A computer-assisted proof establishes the Lonely Runner Conjecture for k=10, 11, and 12 using refined sieving and a polynomial method for specific congruence classes.
Wills,Zwei S¨ atze ¨ uber inhomogene diophantische Approximation von I rrationalzehlen, Monatshefte f¨ ur Mathematik71(1967), no
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Eleven, twelve, and thirteen lonely runners
A computer-assisted proof establishes the Lonely Runner Conjecture for k=10, 11, and 12 using refined sieving and a polynomial method for specific congruence classes.