Lonely Runner Polyhedra

zbMath1421.52017arXiv1606.01783MaRDI QIDQ5383284

Matthias Beck, Serkan Hoşten, Matthias Schymura

Publication date: 21 June 2019

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

zbMATH Keywords

lonely runner conjecture

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31) Simultaneous homogeneous approximation, linear forms (11J13)

Related Items (2)

On the time for a runner to get lonely ⋮ Computing the covering radius of a polytope with an application to lonely runners

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the covering radius of lattice zonotopes and its relation to view-obstructions and the lonely runner conjecture
• On a conjecture in diophantine approximations. II
• Colouring the real line
• Invisible runners in finite fields
• The lonely runner with seven runners
• On the chromatic number of circulant graphs
• View-obstruction problems. III
• Flows, view obstructions, and the lonely runner
• The lonely runner problem for lacunary sequences
• View-obstruction: a shorter proof for 6 lonely runners
• Zur simultanen homogenen diophantischen Approximation. I, II, III
• Untere Schranken für zwei diophantische Approximations-Funktionen
• View-obstruction problems
• Some remarks on the lonely runner conjecture
• Lectures on Polytopes
• Convex and Discrete Geometry
• Six lonely runners

This page was built for publication: Lonely Runner Polyhedra