Some remarks on the lonely runner conjecture

zbMath1451.11088arXiv1701.02048MaRDI QIDQ3120645

Terence C. Tao

Publication date: 5 March 2019

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

zbMATH Keywords

lonely runner conjectureBohr setsgeneralized arithmetic progressions

Mathematics Subject Classification ID

Diophantine approximation in probabilistic number theory (11K60)

Related Items (13)

Bounds for the lonely runner problems via linear programming ⋮ On the time for a runner to get lonely ⋮ Coprime mappings and lonely runners ⋮ Maximal density and the kappa values for the families \(\{a,a+1,2a+1,n\}\) and \(\{a,a+1,2a+1,3a+1,n\}\) ⋮ Cosine sign correlation ⋮ The lonely runner problem for lacunary sequences ⋮ LONELY RUNNERS IN FUNCTION FIELDS ⋮ Unnamed Item ⋮ Coprime matchings ⋮ Lonely Runner Polyhedra ⋮ Density of sets with missing differences and applications ⋮ Maximal density of integral sets with missing differences and the kappa values ⋮ Computing the covering radius of a polytope with an application to lonely runners

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correlation among runners and some results on the lonely runner conjecture
• Random runners are very lonely
• On the chromatic number of circulant graphs
• The view-obstruction problem for \(n\)-dimensional cubes
• Flows, view obstructions, and the lonely runner
• Distance graphs with finite chromatic number
• The chromatic number of random Cayley graphs
• Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
• View-obstruction problems
• Intersection Theorems for Systems of Sets
• Circular chromatic number of distance graphs with distance sets of cardinality 3
• Special volume in honor of Aviezri Fraenkel on the occasion of his 70th birthday

This page was built for publication: Some remarks on the lonely runner conjecture