- Source: Lonely runner conjecture
In number theory, specifically the study of Diophantine approximation, the lonely runner conjecture is a conjecture about the long-term behavior of runners on a circular track. It states that
n
{\displaystyle n}
runners on a track of unit length, with constant speeds all distinct from one another, will each be lonely at some time—at least
1
/
n
{\displaystyle 1/n}
units away from all others.
The conjecture was first posed in 1967 by German mathematician Jörg M. Wills, in purely number-theoretic terms, and independently in 1974 by T. W. Cusick; its illustrative and now-popular formulation dates to 1998. The conjecture is known to be true for seven runners or fewer, but the general case remains unsolved. Implications of the conjecture include solutions to view-obstruction problems and bounds on properties, related to chromatic numbers, of certain graphs.
Formulation
Consider
n
{\displaystyle n}
runners on a circular track of unit length. At the initial time
t
=
0
{\displaystyle t=0}
, all runners are at the same position and start to run; the runners' speeds are constant, all distinct, and may be negative. A runner is said to be lonely at time
t
{\displaystyle t}
if they are at a distance (measured along the circle) of at least
1
/
n
{\displaystyle 1/n}
from every other runner. The lonely runner conjecture states that each runner is lonely at some time, no matter the choice of speeds.
This visual formulation of the conjecture was first published in 1998. In many formulations, including the original by Jörg M. Wills, some simplifications are made. The runner to be lonely is stationary at 0 (with zero speed), and therefore
n
−
1
{\displaystyle n-1}
other runners, with nonzero speeds, are considered. The moving runners may be further restricted to positive speeds only: by symmetry, runners with speeds
x
{\displaystyle x}
and
−
x
{\displaystyle -x}
have the same distance from 0 at all times, and so are essentially equivalent. Proving the result for any stationary runner implies the general result for all runners, since they can be made stationary by subtracting their speed from all runners, leaving them with zero speed. The conjecture then states that, for any collection
v
1
,
v
2
,
.
.
.
,
v
n
−
1
{\displaystyle v_{1},v_{2},...,v_{n-1}}
of positive, distinct speeds, there exists some time
t
>
0
{\displaystyle t>0}
such that
1
n
≤
frac
(
v
i
t
)
≤
1
−
1
n
(
i
=
1
,
.
.
.
,
n
−
1
)
,
{\displaystyle {\frac {1}{n}}\leq \operatorname {frac} (v_{i}t)\leq 1-{\frac {1}{n}}\qquad (i=1,...,n-1),}
where
frac
(
x
)
{\displaystyle \operatorname {frac} (x)}
denotes the fractional part of
x
{\displaystyle x}
. Interpreted visually, if the runners are running counterclockwise, the middle term of the inequality is the distance from the origin to the
i
{\displaystyle i}
th runner at time
t
{\displaystyle t}
, measured counterclockwise. This convention is used for the rest of this article. Wills' conjecture was part of his work in Diophantine approximation, the study of how closely fractions can approximate irrational numbers.
Implications
Suppose
C
{\displaystyle C}
is a n-hypercube of side length
s
{\displaystyle s}
in n-dimensional space (
n
≥
2
{\displaystyle n\geq 2}
). Place a centered copy of
C
{\displaystyle C}
at every point with half-integer coordinates. A ray from the origin may either miss all of the copies of
C
{\displaystyle C}
, in which case there is a (infinitesimal) gap, or hit at least one copy. Cusick (1973) made an independent formulation of the lonely runner conjecture in this context; the conjecture implies that there are gaps if and only if
s
<
(
n
−
1
)
/
(
n
+
1
)
{\displaystyle s<(n-1)/(n+1)}
, ignoring rays lying in one of the coordinate hyperplanes. For example, placed in 2-dimensional space, squares any smaller than
1
/
3
{\displaystyle 1/3}
in side length will leave gaps, as shown, and squares with side length
1
/
3
{\displaystyle 1/3}
or greater will obstruct every ray that is not parallel to an axis. The conjecture generalizes this observation into any number of dimensions.
In graph theory, a distance graph
G
{\displaystyle G}
on the set of integers, and using some finite set
D
{\displaystyle D}
of positive integer distances, has an edge between
x
,
y
{\displaystyle x,y}
if and only if
|
x
−
y
|
∈
D
{\displaystyle |x-y|\in D}
. For example, if
D
=
{
2
}
{\displaystyle D=\{2\}}
, every consecutive pair of even integers, and of odd integers, is adjacent, all together forming two connected components. A k-regular coloring of the integers with step
λ
∈
R
{\displaystyle \lambda \in \mathbb {R} }
assigns to each integer
n
{\displaystyle n}
one of
k
{\displaystyle k}
colors based on the residue of
⌊
λ
n
⌋
{\displaystyle \lfloor \lambda n\rfloor }
modulo
k
{\displaystyle k}
. For example, if
λ
=
0.5
{\displaystyle \lambda =0.5}
, the coloring repeats every
2
k
{\displaystyle 2k}
integers and each pair of integers
2
m
,
2
m
+
1
{\displaystyle 2m,2m+1}
are the same color. Taking
k
=
|
D
|
+
1
{\displaystyle k=|D|+1}
, the lonely runner conjecture implies
G
{\displaystyle G}
admits a proper k-regular coloring (i.e., each node is colored differently than its adjacencies) for some step value. For example,
(
k
,
λ
)
=
(
2
,
0.5
)
{\displaystyle (k,\lambda )=(2,0.5)}
generates a proper coloring on the distance graph generated by
D
=
{
2
}
{\displaystyle D=\{2\}}
. (
k
{\displaystyle k}
is known as the regular chromatic number of
D
{\displaystyle D}
.)
Given a directed graph
G
{\displaystyle G}
, a nowhere-zero flow on
G
{\displaystyle G}
associates a positive value
f
(
e
)
{\displaystyle f(e)}
to each edge
e
{\displaystyle e}
, such that the flow outward from each node is equal to the flow inward. The lonely runner conjecture implies that, if
G
{\displaystyle G}
has a nowhere-zero flow with at most
k
{\displaystyle k}
distinct integer values, then
G
{\displaystyle G}
has a nowhere-zero flow with values only in
{
1
,
2
,
…
,
k
}
{\displaystyle \{1,2,\ldots ,k\}}
(possibly after reversing the directions of some arcs of
G
{\displaystyle G}
). This result was proven for
k
≥
5
{\displaystyle k\geq 5}
with separate methods, and because the smaller cases of the lonely runner conjecture are settled, the full theorem is proven.
Known results
For a given setup of runners, let
δ
{\displaystyle \delta }
denote the smallest of the runners' maximum distances of loneliness, and the gap of loneliness
δ
n
{\displaystyle \delta _{n}}
denote the minimum
δ
{\displaystyle \delta }
across all setups with
n
{\displaystyle n}
runners. In this notation, the conjecture asserts that
δ
n
≥
1
/
n
{\displaystyle \delta _{n}\geq 1/n}
, a bound which, if correct, cannot be improved. For example, if the runner to be lonely is stationary and speeds
v
i
=
i
{\displaystyle v_{i}=i}
are chosen, then there is no time at which they are strictly more than
1
/
n
{\displaystyle 1/n}
units away from all others, showing that
δ
n
≤
1
/
n
{\displaystyle \delta _{n}\leq 1/n}
. Alternatively, this conclusion can be quickly derived from the Dirichlet approximation theorem. For
n
≥
2
{\displaystyle n\geq 2}
a simple lower bound
δ
n
≥
1
/
(
2
n
−
2
)
{\displaystyle \delta _{n}\geq 1/(2n-2)}
may be obtained via a probability argument.
The conjecture can be reduced to restricting the runners' speeds to positive integers: If the conjecture is true for
n
{\displaystyle n}
runners with integer speeds, it is true for
n
{\displaystyle n}
runners with real speeds.
= Tighter bounds
=Slight improvements on the lower bound
1
/
(
2
n
−
2
)
{\displaystyle 1/(2n-2)}
are known. Chen & Cusick (1999) showed for
n
≥
5
{\displaystyle n\geq 5}
that if
2
n
−
5
{\displaystyle 2n-5}
is prime, then
δ
n
≥
1
2
n
−
5
{\displaystyle \delta _{n}\geq {\tfrac {1}{2n-5}}}
, and if
4
n
−
9
{\displaystyle 4n-9}
is prime, then
δ
n
≥
2
4
n
−
9
{\displaystyle \delta _{n}\geq {\tfrac {2}{4n-9}}}
. Perarnau & Serra (2016) showed unconditionally for sufficiently large
n
{\displaystyle n}
that
δ
n
≥
1
2
n
−
4
+
o
(
1
)
.
{\displaystyle \delta _{n}\geq {\frac {1}{2n-4+o(1)}}.}
Tao (2018) proved the current best known asymptotic result: for sufficiently large
n
{\displaystyle n}
,
δ
n
≥
1
2
n
−
2
+
c
log
n
n
2
(
log
log
n
)
2
{\displaystyle \delta _{n}\geq {\frac {1}{2n-2}}+{\frac {c\log n}{n^{2}(\log \log n)^{2}}}}
for some constant
c
>
0
{\displaystyle c>0}
. He also showed that the full conjecture is implied by proving the conjecture for integer speeds of size
n
O
(
n
2
)
{\displaystyle n^{O(n^{2})}}
(see big O notation). This implication theoretically allows proving the conjecture for a given
n
{\displaystyle n}
by checking a finite set of cases, but the number of cases grows too quickly to be practical.
The conjecture has been proven under specific assumptions on the runners' speeds. For sufficiently large
n
{\displaystyle n}
, it holds true if
v
i
+
1
v
i
≥
1
+
22
log
(
n
−
1
)
n
−
1
(
i
=
1
,
.
.
.
,
n
−
2
)
.
{\displaystyle {\frac {v_{i+1}}{v_{i}}}\geq 1+{\frac {22\log(n-1)}{n-1}}\qquad (i=1,...,n-2).}
In other words, the conjecture holds true for large
n
{\displaystyle n}
if the speeds grow quickly enough. If the constant 22 is replaced with 33, then the conjecture holds true for
n
≥
16343
{\displaystyle n\geq 16343}
. A similar result for sufficiently large
n
{\displaystyle n}
only requires a similar assumption for
i
=
⌊
n
/
22
⌋
−
1
,
.
.
.
,
n
−
2
{\displaystyle i=\lfloor n/22\rfloor -1,...,n-2}
. Unconditionally on
n
{\displaystyle n}
, the conjecture is true if
v
i
+
1
/
v
i
≥
2
{\displaystyle v_{i+1}/v_{i}\geq 2}
for all
i
{\displaystyle i}
.
= For specific n
=The conjecture is true for
n
≤
7
{\displaystyle n\leq 7}
runners. The proofs for
n
≤
3
{\displaystyle n\leq 3}
are elementary; the
n
=
4
{\displaystyle n=4}
case was established in 1972. The
n
=
5
{\displaystyle n=5}
,
n
=
6
{\displaystyle n=6}
, and
n
=
7
{\displaystyle n=7}
cases were settled in 1984, 2001 and 2008, respectively. The first proof for
n
=
5
{\displaystyle n=5}
was computer-assisted, but all cases have since been proved with elementary methods.
For some
n
{\displaystyle n}
, there exist sporadic examples with a maximum separation of
1
/
n
{\displaystyle 1/n}
besides the example of
v
i
=
i
{\displaystyle v_{i}=i}
given above. For
n
=
5
{\displaystyle n=5}
, the only known example (up to shifts and scaling) is
{
0
,
1
,
3
,
4
,
7
}
{\displaystyle \{0,1,3,4,7\}}
; for
n
=
6
{\displaystyle n=6}
the only known example is
{
0
,
1
,
3
,
4
,
5
,
9
}
{\displaystyle \{0,1,3,4,5,9\}}
; and for
n
=
8
{\displaystyle n=8}
the known examples are
{
0
,
1
,
4
,
5
,
6
,
7
,
11
,
13
}
{\displaystyle \{0,1,4,5,6,7,11,13\}}
and
{
0
,
1
,
2
,
3
,
4
,
5
,
7
,
12
}
{\displaystyle \{0,1,2,3,4,5,7,12\}}
. There exists an explicit infinite family of such sporadic cases.
Kravitz (2021) formulated a sharper version of the conjecture that addresses near-equality cases. More specifically, he conjectures that for a given set of speeds
v
i
{\displaystyle v_{i}}
, either
δ
=
s
/
(
s
(
n
−
1
)
+
1
)
{\displaystyle \delta =s/(s(n-1)+1)}
for some positive integer
s
{\displaystyle s}
, or
δ
≥
1
/
(
n
−
1
)
{\displaystyle \delta \geq 1/(n-1)}
, where
δ
{\displaystyle \delta }
is that setup's gap of loneliness. He confirmed this conjecture for
n
≤
4
{\displaystyle n\leq 4}
and a few special cases.
Rifford (2022) addressed the question of the size of the time required for a runner to get lonely. He formulated a stronger conjecture stating that for every integer
n
≥
3
{\displaystyle n\geq 3}
there is a positive integer
N
{\displaystyle N}
such that for any collection
v
1
,
v
2
,
.
.
.
,
v
n
−
1
{\displaystyle v_{1},v_{2},...,v_{n-1}}
of positive, distinct speeds, there exists some time
t
>
0
{\displaystyle t>0}
such that
frac
(
v
i
t
)
∈
[
1
/
n
,
1
−
1
/
n
]
{\displaystyle \operatorname {frac} (v_{i}t)\in [1/n,1-1/n]}
for
i
=
1
,
.
.
.
n
−
1
{\displaystyle i=1,...n-1}
with
t
≤
N
min
(
v
1
,
.
.
.
,
v
n
−
1
)
.
{\displaystyle t\leq {\frac {N}{\operatorname {min} (v_{1},...,v_{n-1})}}.}
Rifford confirmed this conjecture for
n
=
3
,
4
,
5
,
6
{\displaystyle n=3,4,5,6}
and showed that the minimal
N
{\displaystyle N}
in each case is given by
N
=
1
{\displaystyle N=1}
for
n
=
3
,
4
,
5
{\displaystyle n=3,4,5}
and
N
=
2
{\displaystyle N=2}
for
n
=
6
{\displaystyle n=6}
. The latter result (
N
=
2
{\displaystyle N=2}
for
n
=
6
{\displaystyle n=6}
) shows that if we consider six runners starting from
0
{\displaystyle 0}
at time
t
=
0
{\displaystyle t=0}
with constant speeds
v
0
,
v
1
,
.
.
.
,
v
5
{\displaystyle v_{0},v_{1},...,v_{5}}
with
v
0
=
0
{\displaystyle v_{0}=0}
and
v
1
,
.
.
.
,
v
5
{\displaystyle v_{1},...,v_{5}}
distinct and positive then the static runner is separated by a distance at least
1
/
6
{\displaystyle 1/6}
from the others during the first two rounds of the slowest non-static runner (but not necessary during the first round).
= Other results
=A much stronger result exists for randomly chosen speeds: using the stationary-runner convention, if
n
{\displaystyle n}
and
ε
>
0
{\displaystyle \varepsilon >0}
are fixed and
n
−
1
{\displaystyle n-1}
runners with nonzero speeds are chosen uniformly at random from
{
1
,
2
,
…
,
k
}
{\displaystyle \{1,2,\ldots ,k\}}
, then
P
(
δ
≥
1
/
2
−
ε
)
→
1
{\displaystyle P(\delta \geq 1/2-\varepsilon )\to 1}
as
k
→
∞
{\displaystyle k\to \infty }
. In other words, runners with random speeds are likely at some point to be "very lonely"—nearly
1
/
2
{\displaystyle 1/2}
units from the nearest other runner. The full conjecture is true if "loneliness" is replaced with "almost aloneness", meaning at most one other runner is within
1
/
n
{\displaystyle 1/n}
of a given runner. The conjecture has been generalized to an analog in algebraic function fields.
Notes and references
= Notes
== Citations
== Works cited
=External links
Article in the Open Problem Garden no. 4, 551–562.