Bounds for the lonely runner problems via linear programming

DOI10.1007/S00574-021-00272-7MaRDI QIDQ2145179zbMATH OpenOpenAlexFDO

Authors 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)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

Dirichlet's approximation theoremgap of lonelinesslinear programminglonely runnerview obstruction

Mathematics Subject Classification ID

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

Abstract: In this note we develop a linear programming framework to produce upper and lower bounds for the lonely runner problem.

Cites work

• Correlation among runners and some results on the lonely runner conjecture
• scientific article; zbMATH DE number 5115930 (Why is no real title available?)
• scientific article; zbMATH DE number 699709 (Why is no real title available?)
• Some remarks on the lonely runner conjecture
• Special volume in honor of Aviezri Fraenkel on the occasion of his 70th birthday
• View-obstruction problems
• Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen

Cited in

(3)

• Mathematical formulation of optimal competitive running by Pontryagin's minimum principle
• scientific article; zbMATH DE number 5827338 (Why is no real title available?)
• scientific article; zbMATH DE number 5555985 (Why is no real title available?)

Describes a project that uses

Uses Software

• Gurobi

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

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