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

孤独的跑步者和七个跑步者

The lonely runner with seven runners

J. Barajas, O. Serra

摘要:

假设$k+1$运动员具有非零的恒定速度,在同一时间和地点开始的单位长度的圆形跑道上跑圈。如果一个跑步者在跑道上与其他跑步者的距离至少为$1/(k+1)$,那么她就是孤独的。孤独的跑步者猜想指出,每个跑步者都会感到孤独。该猜想已被证明了六轮($k\le 5$).这个问题的一个公式与距离图的正则色数有关。我们使用一个新的工具,在这种情况下,解决了第一个开放的情况下的猜想与七个亚军。

英文摘要:

Suppose $k+1$ runners having nonzero constant speeds run laps on a unit-length circular track starting at the same time and place. A runner is said to be lonely if she is at distance at least $1/(k+1)$ along the track to every other runner. The lonely runner conjecture states that every runner gets lonely. The conjecture has been proved up to six runners ($k\le 5$). A formulation of the problem is related to the regular chromatic number of distance graphs. We use a new tool developed in this context to solve the first open case of the conjecture with seven runners.

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

↑