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

随机跑者很孤独

Random runners are very lonely

Sebastian Czerwiński

摘要:

假设具有不同恒定速度的$k$跑步者在单位长度的圆形跑道上跑圈。孤独跑步者猜想指出,迟早,任何特定的跑步者都会与所有其他跑步者保持至少$1/k$的距离。我们证明,概率趋于一,一个更强的声明持有随机集,其中绑定$1/k$被替换为\thinspace $1/2-\varepsilon $。证明采用傅立叶分析方法。我们还指出了我们的结果的随机整数距离图的着色的一些后果。

英文摘要:

Suppose that $k$ runners having different constant speeds run laps on a circular track of unit length. The Lonely Runner Conjecture states that, sooner or later, any given runner will be at distance at least $1/k$ from all the other runners. We prove that, with probability tending to one, a much stronger statement holds for random sets in which the bound $1/k$ is replaced by \thinspace $1/2-\varepsilon $. The proof uses Fourier analytic methods. We also point out some consequences of our result for colouring of random integer distance graphs.

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

↑