OpenAlex ·
More (shifted) runners, less loneliness
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.23952
- Original
- Read it at the publisher
- Topics
Abstract
The shifted lonely runner conjecture was recently disproved by Blanco, Criado and Santos. We give quantitative bounds on its failure as the number of runners grows. The loneliness of a configuration is the maximum, over time, of the distance from the origin to the nearest runner. We write $1/(n+1+E_n)$ for the infimum of loneliness over configurations of $n$ runners on the unit circle with distinct positive integer velocities and arbitrary initial shifts. We prove $E_n\ge\lfloor n/287\rfloor$, which together with the elementary bound $E_n\leq n-1$ implies that $E_n$ grows linearly in $n$. We also show that $E_n\geq1$ for every $n\geq95$.
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 Mathematical Physics
On the generation of multiplicative groups by small primes
A two-step supercongruence for an Apéry-like sequence
Continuous Optimization for p-adic Models
Finding New Limit Points of Mahler Measure by Methods of Missing Data Restoration
Inverse Baer deformations and finite simple skew braces of nilpotent type
Get the few papers worth your time in Mathematical Physics 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.