EUVIMEDObjevte EUVIMED
Crossref

Nine and Ten Lonely Runners

Tanupat Trakulthongchai

The Electronic Journal of Combinatorics · 2026-06-05 · 33 (2)

DOI: 10.37236/14972 ↗

At a glance

Journal article in The Electronic Journal of Combinatorics, published online on 2026-06-05. Written by Tanupat Trakulthongchai. Cited 2 times so far (Crossref).

AbstraktBibliografické údajeCiteRelated studies

Abstract (original language)

The Lonely Runner Conjecture of Wills and Cusick states that if $k+1$ runners start running at distinct constant speeds around a unit-length circular track, then for each runner there is a time when he/she is at least $1/(k+1)$ away from all other runners. Rosenfeld recently obtained a computer-assisted proof of the conjecture for $8$ runners. By refining his approach with a sieve, we obtain proofs (also computer-assisted) for $9$ and $10$ runners.

Cite

APA

Trakulthongchai, T. (2026). Nine and Ten Lonely Runners. The Electronic Journal of Combinatorics, 33(2). https://doi.org/10.37236/14972

Vancouver

Trakulthongchai T. Nine and Ten Lonely Runners. The Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/14972

BibTeX
@article{Trakulthongchai2026,
  author = {Trakulthongchai, Tanupat},
  title = {Nine and Ten Lonely Runners},
  journal = {The Electronic Journal of Combinatorics},
  year = {2026},
  volume = {33},
  number = {2},
  doi = {10.37236/14972}
}
Start for free →