The finite-group formulation of the Lonely Runner Conjecture

About 14 years old · traced to

Let kk be a positive integer, let S⊂NS\subset\mathbb{N} have size kk, and for a natural number nn let Zn\mathbb{Z}_n denote the cyclic group of order nn. For an integer mm, set

B=±{0,1,…,m},m=⌈nk+1⌉−1.B=\pm\{0,1,\ldots,m\},\qquad m=\left\lceil\frac{n}{k+1}\right\rceil-1.

The finite-group formulation. There exist a natural number nn and an element x∈Znx\in\mathbb{Z}_n such that

xS∩B=∅.xS\cap B=\varnothing.

This is presented as an equivalent formulation of the Lonely Runner Conjecture in terms of dilates in cyclic groups. The general conjecture remains open.

References

Primary source

Clayton Barnes, “The Lonely Runner Conjecture”, arXiv:1211.2482 (2012).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.