arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.02048math.CO
收藏

关于孤独奔跑者猜想的几点注记

Some remarks on the lonely runner conjecture

Terence Tao

摘要:

威尔斯和库斯克的孤独跑步者猜想(lonely runner convention-of-the-Wills and Cusick)在其最流行的表述中断言,如果$n$跑步者以不同的恒定速度绕着单位圆${\bf R}/{\bf Z}$跑步,那么每个跑步者在某个时间与其他跑步者至少相隔$\frac{1}{n+1}$的距离。本文对这一猜想作了一些评论。首先,我们可以对大的$n$稍微改进$\frac{1}{2n}$的平凡下界,对某个绝对常数$c>0$改进为$\frac{1}{2n} + \frac{c \log n}{n^2 (\log\log n)^2}$;以前的改进大致是$\frac{1}{2n} + \frac{c}{n^2}$的形式。其次,我们证明,为了验证猜想,它足以这样做的假设下,速度是整数的大小$n^{O(n^2)}$。当所有的速度都是大小为$O(n)$的整数时,我们也得到了一些结果.

英文摘要:

The lonely runner conjecture of Wills and Cusick, in its most popular formulation, asserts that if $n$ runners with distinct constant speeds run around a unit circle ${\bf R}/{\bf Z}$ 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+1}$ from the others. In this paper we make some remarks on this conjecture. Firstly, we can improve the trivial lower bound of $\frac{1}{2n}$ slightly for large $n$, to $\frac{1}{2n} + \frac{c \log n}{n^2 (\log\log n)^2}$ for some absolute constant $c>0$; previous improvements were roughly of the form $\frac{1}{2n} + \frac{c}{n^2}$. Secondly, we show that to verify the conjecture, it suffices to do so under the assumption that the speeds are integers of size $n^{O(n^2)}$. We also obtain some results in the case when all the velocities are integers of size $O(n)$.

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

↑