Bounds for the Lonely Runner Problem via Linear Programming
Number Theory
2020-10-13 v2 Classical Analysis and ODEs
Optimization and Control
Abstract
In this note we develop a linear programming framework to produce upper and lower bounds for the lonely runner problem.
Cite
@article{arxiv.2010.02271,
title = {Bounds for the Lonely Runner Problem via Linear Programming},
author = {Felipe Gonçalves and João P. G. Ramos},
journal= {arXiv preprint arXiv:2010.02271},
year = {2020}
}
Comments
6 pages, 1 figure; plot was fixed and improved, acknowledgements added