The lonely runner problem for lacunary sequences

DOI10.1016/j.disc.2018.02.002zbMath1406.11064OpenAlexW2790125290MaRDI QIDQ1709528

Sebastian Czerwiński

Publication date: 5 April 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.02.002

zbMATH Keywords

lacunary sequencesthe lonely runner conjecture

Mathematics Subject Classification ID

Simultaneous homogeneous approximation, linear forms (11J13) Distribution modulo one (11J71) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (1)

Lonely Runner Polyhedra

Cites Work

• 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
• From rainbow to the lonely runner: A survey on coloring parameters of distances graphs
• Invisible runners in finite fields
• The lonely runner with seven runners
• On the chromatic number of circulant graphs
• View-obstruction problems. III
• The view-obstruction problem for \(n\)-dimensional cubes
• Flows, view obstructions, and the lonely runner
• Distance graphs with finite chromatic number
• View-obstruction: a shorter proof for 6 lonely runners
• The local cut lemma
• The chromatic number of random Cayley graphs
• Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
• View-obstruction problems
• Some remarks on the lonely runner conjecture
• Two Erdős problems on lacunary sequences: Chromatic number and Diophantine approximation

This page was built for publication: The lonely runner problem for lacunary sequences