arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2511.16636math.COmath.NT
收藏

里斯茨积与孤独跑者猜想:更大的孤独间隔

Riesz products and the Lonely Runner Conjecture: A wider gap of loneliness

Benjamin Bedert

AI总结:

本文通过里斯茨积方法,改进了孤独跑者猜想的下界,得到1/(2n)+1/n^{5/3+o(1)}的更优结果。

摘要:

孤独跑者猜想由Wills和Cusick提出,指出如果n个速度各不相同的跑者同时从同一地点出发,在圆形单位长度跑道上跑步,则每个跑者在某个时间点至少会与其它所有跑者相距至少1/n。通过所谓的平凡联合界,可以得到一个较弱的下界1/(2n-2),后续工作将其提升为形式为1/(2n)+c/n²的下界,其中c>0为常数。陶将此进一步提升为1/(2n)+ (log n)^{1-o(1)}/n²。在本文中,我们得到了一个多项式改进,形式为1/(2n)+1/n^{5/3+o(1)}。

英文摘要:

The lonely runner conjecture of Wills and Cusick asserts that if $n$ runners with distinct constant speeds run around a a circular unit length track, starting at a common time and place, then each runner will at some time be separated by a distance of at least $\frac{1}{n}$ from all other runners. A weaker lower bound of $\frac{1}{2n-2}$ follows from the so-called trivial union bound, and subsequent work upgraded this to bounds of the form $\frac{1}{2n}+\frac{c}{n^2}$ for various constants $c>0$. Tao strengthened this to $\frac{1}{2n}+\frac{(\log n)^{1-o(1)}}{n^2}$. In this paper, we obtain a polynomial improvement of the form $$\frac{1}{2n}+\frac{1}{n^{5/3+o(1)}}.$$

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑