OpenAlex ·
Near optimal gap in the Lonely Runner Conjecture
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.23790
- Original
- Read it at the publisher
- Topics
Abstract
For a set $V$ of $n$ distinct positive integers, let $\mathrm{ML}(V)=\max_{t\in\mathbb{R}/\mathbb{Z}}\min_{v\in V}\|vt\|$, where $\|x\|$ is the distance from $x$ to the nearest integer. We prove that there is an absolute constant $c>0$ such that for every $n\ge2$ and every $V$, \[ \mathrm{ML}(V)>\frac{1+c}{2n}. \] The proof combines a refinement of the large GCD argument of Green and Walker with a new physical spillover inequality for interval multiplicities.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Combinatorics
BCC optimality for the three-dimensional Coulomb lattice energy
A simpler proof that there are no Landau--Siegel zeros
A new lower bound for the sixth Schur number: $S(6)\ge 537$
Failure of direct finiteness for group algebras in every odd characteristic
Contributions to the Stable Derived Categories of Gorenstein Rings
Get the few papers worth your time in Combinatorics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.