The structure of Lonely Runner spectra
Abstract For each closed subtorus T of $(\mathbb{R}/\mathbb{Z})^n$ , let D ( T ) denote the (infimal) $L^\infty$ -distance from T to the point $(1/2,\ldots, 1/2)$ . The n th Lonely Runner spectrum $\mathcal{S}(n)$ is defined to be the set of all values achieved by D ( T ) as T ranges over the 1-dimensional subtori of $(\mathbb{R}/\mathbb{Z})^n$ that are not contained in the coordinate hyperplanes. The Lonely Runner Conjecture predicts that $\mathcal{S}(n) \subseteq [0,1/2-1/(n+1)]$ . Rather than attack this conjecture directly, we study the qualitative structure of the sets $\mathcal{S}(n)$ via their accumulation points. This project brings into the picture the analogues of $\mathcal{S}(n)$ where 1-dimensional subtori are replaced by k -dimensional subtori or k -dimensional subgroups.
Authors
- Vikram Giri (ORCID: https://orcid.org/0000-0002-3047-9927)
- Noah Kravitz
Institutions
- Toronto Metropolitan University (CA)
Publication Details
- Journal
- Mathematical Proceedings of the Cambridge Philosophical Society
- Published
- 2025-10-24
- DOI
- https://doi.org/10.1017/s0305004125101497
- Primary Topic
- Mathematical Dynamics and Fractals
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation