Random runners are very lonely

DOI10.1016/J.JCTA.2012.02.002zbMATH Open1242.05090OpenAlexW1993207395MaRDI QIDQ423640FDOQ423640

Authors Sebastian Czerwiński 

Publication date 4 June 2012

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

Diophantine approximationinteger distance graphslonely runner problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Diophantine inequalities (11J25)

Abstract: Suppose that $k$ runners having different constant speeds run laps on a circular track of unit length. The Lonely Runner Conjecture states that, sooner or later, any given runner will be at distance at least $1/k$ from all the other runners. We prove that, with probability tending to one, a much stronger statement holds for random sets in which the bound $1/k$ is replaced by hinspace $1/2-varepsilon$. The proof uses Fourier analytic methods. We also point out some consequences of our result for colouring of random integer distance graphs.

Recommendations

• On the Lonely Runner Conjecture.
• Invisible runners in finite fields
• The lonely runner with seven runners
• A note on the lonely runner conjecture
• Some remarks on the lonely runner conjecture

Cites Work

• scientific article; zbMATH DE number 5115930 (Why is no real title available?)
• scientific article; zbMATH DE number 699709 (Why is no real title available?)
• scientific article; zbMATH DE number 713428 (Why is no real title available?)
• Arithmetic progressions in sumsets
• Distance graphs with finite chromatic number
• Flows, view obstructions, and the lonely runner
• Invisible runners in finite fields
• Research Problems in Discrete Geometry
• Special volume in honor of Aviezri Fraenkel on the occasion of his 70th birthday
• The chromatic number of random Cayley graphs
• The lonely runner with seven runners
• The view-obstruction problem for \(n\)-dimensional cubes
• View-obstruction problems
• View-obstruction problems. III
• View-obstruction: a shorter proof for 6 lonely runners
• Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen

Cited In (12)

• Title not available (Why is no real title available?)
• Correlation among runners and some results on the lonely runner conjecture
• Some remarks on the lonely runner conjecture
• Runners in Action
• LONELY RUNNERS IN FUNCTION FIELDS
• The lonely runner with seven runners
• Invisible runners in finite fields
• Cosine sign correlation
• Title not available (Why is no real title available?)
• The chromatic number of random Cayley graphs
• The lonely runner problem for lacunary sequences
• On the covering radius of lattice zonotopes and its relation to view-obstructions and the lonely runner conjecture

This page was built for publication: Random runners are very lonely

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423640)