Correlation among runners and some results on the lonely runner conjecture

zbMath1415.11095arXiv1407.3381MaRDI QIDQ278889

Oriol Serra, Guillem Perarnau

Publication date: 3 May 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.3381

zbMATH Keywords

lonely runner conjecture

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Simultaneous homogeneous approximation, linear forms (11J13) Distribution modulo one (11J71)

Related Items

Bounds for the lonely runner problems via linear programming ⋮ On the time for a runner to get lonely ⋮ Cosine sign correlation ⋮ The lonely runner problem for lacunary sequences ⋮ LONELY RUNNERS IN FUNCTION FIELDS ⋮ Some remarks on the lonely runner conjecture ⋮ On the covering radius of lattice zonotopes and its relation to view-obstructions and the lonely runner conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random runners are very lonely
• Invisible runners in finite fields
• The lonely runner with seven runners
• View-obstruction problems. III
• The view-obstruction problem for \(n\)-dimensional cubes
• Non-averaging subsets and non-vanishing transversals
• Flows, view obstructions, and the lonely runner
• The chromatic number of random Cayley graphs
• Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
• Untere Schranken für zwei diophantische Approximations-Funktionen
• Two Erdős problems on lacunary sequences: Chromatic number and Diophantine approximation
• View-Obstruction Problems. II
• An upper bound for the probability of a union
• On the structure of linear graphs
• Six lonely runners