Bounds for the lonely runner problems via linear programming

DOI10.1007/s00574-021-00272-7zbMath1489.11112arXiv2010.02271OpenAlexW3192789197MaRDI QIDQ2145179

Felipe Gonçalves, João Pedro Ramos

Publication date: 17 June 2022

Published in: Bulletin of the Brazilian Mathematical Society. New Series (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingDirichlet's approximation theoremview obstructiongap of lonelinesslonely runner

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear programming (90C05) Trigonometric polynomials, inequalities, extremal problems (42A05) Diophantine approximation in probabilistic number theory (11K60)

Uses Software

• Gurobi

Cites Work

• Correlation among runners and some results on the lonely runner conjecture
• Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
• View-obstruction problems
• Some remarks on the lonely runner conjecture
• Special volume in honor of Aviezri Fraenkel on the occasion of his 70th birthday
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds for the lonely runner problems via linear programming