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

11个欧几里得距离就足够了

Eleven Euclidean Distances are Enough

Sujith Vijay

摘要:

著名的三距离定理指出,在任何实数的前n个倍数的集合中,连续元素之间最多有三个不同的间隙。我们推广这一定理,以更高的维度下一个合适的配方。三距离定理可以被认为是关于锦标赛中冠军的陈述。比赛中的参与者是给定实数的倍数对之间的边,当且仅当它们重叠时,两条边相互比赛,并且一条边只输给它所对抗的长度较短的边。被击败的边可以与其他重叠的边竞争(并击败)。根据三个距离定理,最多有三个不同的值的长度不败的边缘。在平面和高维中,我们考虑实数向量的倍数的小数部分,如果它们沿任何轴的投影重叠,则两个边缘发挥作用,并且冠军的定义与以前一样。在平面上,最多有11个不败边的长度值。

英文摘要:

The well-known three distance theorem states that there are at most three distinct gaps between consecutive elements in the set of the first n multiples of any real number. We generalise this theorem to higher dimensions under a suitable formulation. The three distance theorem can be thought of as a statement about champions in a tournament. The players in the tournament are edges between pairs of multiples of the given real number, two edges play each other if and only if they overlap, and an edge loses only against edges of shorter length that it plays against. Defeated edges may play (and defeat) other overlapping edges. According to the three distance theorem, there are at most three distinct values for the lengths of undefeated edges. In the plane and in higher dimensions, we consider fractional parts of multiples of a vector of real numbers, two edges play if their projections along any axis overlap, and champions are defined as before. In the plane, there are at most 11 values for the lengths of undefeated edges.

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

↑