Relative Lonely Runner spectra
Abstract
For a subtorus T ⊂eq (R/Z)n, let D(T) denote the L∞-distance from T to the point (1/2, …, 1/2). For a subtorus U ⊂eq (R/Z)n, define S1(U), the Lonely Runner spectrum relative to U, to be the set of all values of D(T) as T ranges over the 1-dimensional subtori of U not contained in the union of the coordinate hyperplanes of (R/Z)n. The relative spectrum S1((R/Z)n) is the ordinary Lonely Runner spectrum that has been studied previously. Giri and the second author recently showed that the relative spectra S1(U) for 2-dimensional subtori U ⊂eq (R/Z)n essentially govern the accumulation points of the Lonely Runner spectrum S1((R/Z)n). In the present work, we prove that such relative spectra S1(U) have a very rigid arithmetic structure, and that one can explicitly find a complete characterization of each such relative spectrum with a finite calculation; carrying out this calculation for a few specific examples sheds light on previous constructions in the literature on the Lonely Runner Problem.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.