Lonely runner polyhedra

MaRDI QIDQ5383284zbMATH OpenFDO

Authors Matthias Beck, Serkan Hoşten, Matthias Henze

Publication date 21 June 2019

Full work available at URL https://arxiv.org/abs/1606.01783, http://math.colgate.edu/~integers/t29/t29.pdf

zbMATH Keywords

lonely runner conjecture

Mathematics Subject Classification ID

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

Abstract: We study the emph{Lonely Runner Conjecture}, conceived by J"org M.~Wills in the 1960's: Given positive integers $n_1,n_2,dots,n_k$, there exists a positive real number $t$ such that for all $1lejlek$ the distance of $t,n_j$ to the nearest integer is at least $frac1k+1$. Continuing a view-obstruction approach by Cusick and recent work by Henze and Malikiosis, our goal is to promote a polyhedral emph{ansatz} to the Lonely Runner Conjecture. Our results include geometric proofs of some folklore results that are only implicit in the existing literature, a new family of affirmative instances defined by the parities of the speeds, and geometrically motivated conjectures whose resolution would shed further light on the Lonely Runner Conjecture.

Recommendations

• Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem
• Some remarks on the lonely runner conjecture
• scientific article; zbMATH DE number 5919365
• On the Lonely Runner Conjecture.
• Six lonely runners

Cites work

• A note on the lonely runner conjecture
• Colouring the real line
• Convex and Discrete Geometry
• Flows, view obstructions, and the lonely runner
• scientific article; zbMATH DE number 5919365 (Why is no real title available?)
• scientific article; zbMATH DE number 3125787 (Why is no real title available?)
• scientific article; zbMATH DE number 3557558 (Why is no real title available?)
• Invisible runners in finite fields
• Lectures on Polytopes
• On a conjecture in diophantine approximations. II
• On the chromatic number of circulant graphs
• On the covering radius of lattice zonotopes and its relation to view-obstructions and the lonely runner conjecture
• Six lonely runners
• Some remarks on the lonely runner conjecture
• The lonely runner problem for lacunary sequences
• The lonely runner with seven runners
• Untere Schranken für zwei diophantische Approximations-Funktionen
• View-obstruction problems
• View-obstruction problems. III
• View-obstruction: a shorter proof for 6 lonely runners
• Zur simultanen homogenen diophantischen Approximation. I, II, III

Cited in

(9)

• The lonely runner with seven runners
• Computing the covering radius of a polytope with an application to lonely runners
• On the time for a runner to get lonely
• Solving lonely runner conjecture through differential geometry
• On the covering radius of lattice zonotopes and its relation to view-obstructions and the lonely runner conjecture
• LONELY RUNNERS IN FUNCTION FIELDS
• Deep lattice points in zonotopes, lonely runners, and lonely rabbits
• The structure of lonely runner spectra
• Linearly exponential checking is enough for the lonely runner conjecture and some of its variants

This page was built for publication: Lonely runner polyhedra

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