The structure of Lonely Runner spectra

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…