The structure of Lonely Runner spectra

preprint2025arXivOpen access

Abstract

For each subtorus TT of (R/Z)n(\mathbb{R}/\mathbb{Z})^n, let D(T)D(T) denote the (infimal) L∞L^\infty-distance from TT to the point (1/2,…,1/2)(1/2,\ldots, 1/2). The nn-th Lonely Runner spectrum S(n)\mathcal{S}(n) is defined to be the set of all values achieved by D(T)D(T) as TT ranges over the 11-dimensional subtori of (R/Z)n(\mathbb{R}/\mathbb{Z})^n that are not contained in the coordinate hyperplanes. The Lonely Runner Conjecture predicts that S(n)⊆[0,1/2−1/(n+1)]\mathcal{S}(n) \subseteq [0,1/2-1/(n+1)]. Rather than attack this conjecture, we study the structure of the sets S(n)\mathcal{S}(n). The main purpose of this note is to show that the set of accumulation points of S(n)\mathcal{S}(n) is precisely S(n−1)\mathcal{S}(n-1).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.