On the covering radius of lattice zonotopes and its relation to view-obstructions and the lonely runner conjecture

DOI10.1007/S00010-016-0458-3zbMath1367.52017arXiv1609.01939OpenAlexW3102699240WikidataQ123116008 ScholiaQ123116008MaRDI QIDQ525086

Romanos-Diogenes Malikiosis, Matthias Schymura

Publication date: 28 April 2017

Published in: Aequationes Mathematicae (Search for Journal in Brave)

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

zbMATH Keywords

covering radiuszonotopelonely runner conjectureflatness theorembilliard ball motionview-obstruction

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 (5)

On the time for a runner to get lonely ⋮ Isoperimetric problems for zonotopes ⋮ Lonely Runner Polyhedra ⋮ The covering radius and a discrete surface area for non-hollow simplices ⋮ 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
• Correlation among runners and some results on the lonely runner conjecture
• Random runners are very lonely
• Restricted successive minima
• The lonely runner with seven runners
• Rotations by roots of unity and Diophantine approximation
• Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\). II: Application of \(K\)-convexity
• Zur simultanen homogenen diophantischen Approximation. I, II, III
• View-obstruction problems
• Combinatorial Properties of Associated Zonotopes
• Convex and Discrete Geometry
• Six lonely runners

This page was built for publication: On the covering radius of lattice zonotopes and its relation to view-obstructions and the lonely runner conjecture