The shifted Lonely Runner Conjecture holds for five runners, with exactly three primitive tight instances, two of which are also tight for the original conjecture.
Computing the covering radius of a polytope with an application to lonely runners
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Covering radii of $3$-zonotopes and the shifted Lonely Runner Conjecture
The shifted Lonely Runner Conjecture holds for five runners, with exactly three primitive tight instances, two of which are also tight for the original conjecture.