The structure of Lonely Runner spectra
Combinatorics
2026-01-14 v4 Number Theory
Abstract
For each subtorus of , let denote the (infimal) -distance from to the point . The -th Lonely Runner spectrum is defined to be the set of all values achieved by as ranges over the -dimensional subtori of that are not contained in the coordinate hyperplanes. The Lonely Runner Conjecture predicts that . Rather than attack this conjecture, we study the structure of the sets . The main purpose of this note is to show that the set of accumulation points of is precisely .
Cite
@article{arxiv.2304.01462,
title = {The structure of Lonely Runner spectra},
author = {Vikram Giri and Noah Kravitz},
journal= {arXiv preprint arXiv:2304.01462},
year = {2026}
}
Comments
Fixed error from previous version