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

扩张边界点的分布及其在孤独跑者猜想中的应用

Distribution of boundary points of expansion and application to the lonely runner conjecture

African Institute for Mathematical science(非洲数学科学研究所)

Theophilus Agama

AI总结:

本文研究了扩张边界点的分布,并证明了在特定条件下,孤独跑者问题中跑者之间的距离下界。

摘要:

在本文中,我们研究了扩张边界的分布。作为应用,我们讨论了孤独跑者问题。我们证明,给定k个跑者S_i在单位圆轨道上跑步,且在某个时间点有||S_i - S_{i+1}|| = ||S_{i+1} - S_{i+2}||对于所有i=1,2,…,k-2,那么在该时间点有||S_{i+1} - S_i|| > D(n)π/(k-1)对于所有i=1,…,k-1,并且其中1>D(n)>0是一个依赖于某个次数为n的多项式次数的常数。特别是,我们证明,给定最多八个跑者S_i(i=1,2,…,8)在单位圆轨道上以不同的恒定速度跑步,并且在某个时间s>1时满足||S_i - S_{i+1}|| = ||S_{i+1} - S_{i+2}||对于所有1≤i≤6,那么在该时间点它们的相互距离必须满足下界||S_i - S_{i+1}|| > Cπ/7,其中某个常数1>C>0。

英文摘要:

In this paper, we study the distribution of the boundary points of expansion. As an application, we say something about the lonely runner problem. We show that given $k$ runners $\mathcal{S}_i$ round a unit circular track with the condition that at some time $||\mathcal{S}_i-\mathcal{S}_{i+1}||=||\mathcal{S}_{i+1}-\mathcal{S}_{i+2}||$ for all $i=1,2\ldots,k-2$, then at that time we have $$ ||\mathcal{S}_{i+1}-\mathcal{S}_i||>\frac{\mathcal{D}(n)π}{k-1} $$ for all $i=1,\ldots,k-1$ and where $1>\mathcal{D}(n)>0$ is a constant depending on the degree of a certain polynomial of degree $n$. In particular, we show that given at most eight $\mathcal{S}_i$~($i=1,2,\ldots, 8$) runners running around a unit circular track with distinct constant speed and the additional condition $||\mathcal{S}_i-\mathcal{S}_{i+1}||=||\mathcal{S}_{i+1}-\mathcal{S}_{i+2}||$ for all $1\leq i\leq 6$ at some time $s>1$, then at that time their mutual distance must satisfy the lower bound $$ ||\mathcal{S}_{i}-\mathcal{S}_{i+1}||>\frac{Cπ}{7} $$ for some constant $1>C>0$ for all $1\leq i\leq 7$.

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

↑