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

孤独跑者谱的结构

The structure of Lonely Runner spectra

Princeton University(普林斯顿大学)

Vikram Giri, Noah Kravitz

AI总结:

本文研究了孤独跑者谱S(n)的结构,证明其极限点集与S(n-1)相同。

摘要:

对于每个子流形T of (R/Z)^n,令D(T)表示T到点(1/2,…,1/2)的(下限)L^∞距离。第n个孤独跑者谱S(n)定义为所有由D(T)取得的值的集合,其中T是(R/Z)^n的1维子流形,且不包含坐标超平面。孤独跑者猜想预测S(n)⊆[0,1/2-1/(n+1)]。与其攻击这个猜想,我们研究S(n)的结构。本文的主要目的是证明S(n)的极限点集恰好是S(n-1)。

英文摘要:

For each subtorus $T$ of $(\mathbb{R}/\mathbb{Z})^n$, let $D(T)$ denote the (infimal) $L^\infty$-distance from $T$ to the point $(1/2,\ldots, 1/2)$. The $n$-th Lonely Runner spectrum $\mathcal{S}(n)$ is defined to be the set of all values achieved by $D(T)$ as $T$ ranges over the $1$-dimensional subtori of $(\mathbb{R}/\mathbb{Z})^n$ that are not contained in the coordinate hyperplanes. The Lonely Runner Conjecture predicts that $\mathcal{S}(n) \subseteq [0,1/2-1/(n+1)]$. Rather than attack this conjecture, we study the structure of the sets $\mathcal{S}(n)$. The main purpose of this note is to show that the set of accumulation points of $\mathcal{S}(n)$ is precisely $\mathcal{S}(n-1)$.

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

↑