Hostname: page-component-76d6cb85b7-kcxw8 Total loading time: 0 Render date: 2026-07-21T22:18:26.849Z Has data issue: false hasContentIssue false

Linearly exponential checking is enough for the lonely runner conjecture and some of its variants

Published online by Cambridge University Press:  01 October 2025

Romanos Diogenes Malikiosis*
Affiliation:
Department of Mathematics, Aristotle University of Thessaloniki , Thessaloniki 54124, Greece;
Francisco Santos
Affiliation:
Departmento de Matemáticas, Estadística y Computación, Universidad de Cantabria , E-39005 Santander, Spain; E-mail: santosf@unican.es
Matthias Schymura
Affiliation:
Institut für Mathematik, University of Rostock , 18057 Rostock, Germany; E-mail: matthias.schymura@uni-rostock.de
*
E-mail: rwmanos@gmail.com (corresponding author)

Abstract

Tao (2018) showed that in order to prove the Lonely Runner Conjecture (LRC) up to $n+1$ runners it suffices to consider positive integer velocities in the order of $n^{O(n^2)}$. Using the zonotopal reinterpretation of the conjecture due to the first and third authors (2017) we here drastically improve this result, showing that velocities up to $\binom {n+1}{2}^{n-1} \le n^{2n}$ are enough.

We prove the same finite-checking result, with the same bound, for the more general shifted Lonely Runner Conjecture (sLRC), except in this case our result depends on the solution of a question, that we dub the Lonely Vector Problem (LVP), about sumsets of n rational vectors in dimension two. We also prove the same finite-checking bound for a further generalization of sLRC that concerns cosimple zonotopes with n generators, a class of lattice zonotopes that we introduce.

In the last sections we look at dimensions two and three. In dimension two we prove our generalized version of sLRC (hence we reprove the sLRC for four runners), and in dimension three we show that to prove sLRC for five runners it suffices to look at velocities adding up to $195$.

Information

Type
Discrete Mathematics
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2025. Published by Cambridge University Press
Figure 0

Figure 1 The five hexagons in the proof of Theorem 6.3, with their volume vectors. In each of them a parallelepiped with base and height equal to 2 is shown, to illustrate that the hexagons have $\mu \le \frac 12$.

Figure 1

Figure 2 The octagon in the proof of Theorem 6.3, with an inscribed square implying $\mu \le \frac 12$.

Figure 2

Figure 3 The covering radius of the parallelogram $Q \cong P_{2,5}$ equals $3/5$: The left picture shows that Q contains a translation of the square $[0,5/3]^2$; hence $\mu (P_{2,5}) \le 3/5$. For the equality, consider the right picture, where we scale down Q by $3/5$ about its centre, so that the axes-parallel square in it becomes a lattice unit square with its vertices in the boundary of $(3/5)Q$. Since any smaller dilation will fail to contain points from $\mathbb {Z}^2$, we have that $\mu \cdot P_{2,5} + \mathbb {Z}^{2}$ does not cover $\mathbb {R}^2$ for any $\mu < 3/5$.