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

距离比为1:√2的Johnson最优性与唯一性

Johnson optimality and uniqueness for distance ratio $1:\sqrt{2}$

Bryan Bu, Chin-Yen Lee, Yu-Hang Sheng, Meng-Tsung Tsai, Hyunjun Yi, Wei-Hsuan Yu

AI总结:

该研究证明了距离比为1:√2的两距离集的最大基数界,结合Larman-Rogers-Seidel定理得到特定维度下的最大点数,明确了Johnson构造的最优性与唯一性。

摘要:

我们证明,对于所有d≥9,ℝᵈ中距离比为1:√2的两距离集最多有d(d+1)/2个点。在全仿射维数下取等时对应Johnson构造;对于d≥10,全维条件自动成立。证明按短距离图的连通性对构型分类:连通情形用根格与相交定理,非连通情形分解为分量方向空间及其中心差张成空间的正交和。我们还证明了欧氏两距离集的一个相对界,且取等时必为球形。结合Larman-Rogers-Seidel定理,这些结果给出9≤d≤21时最大基数为d(d+1)/2,d=22时为275,无需穷举。

英文摘要:

We prove that a two-distance set in $\mathbb R^d$ with distance ratio $1:\sqrt{2}$ has at most $d(d+1)/2$ points for every $d\ge9$. Equality in full affine dimension characterizes the Johnson construction; for $d\ge10$, the full-dimensional condition is automatic. The proof separates configurations according to the connectivity of the short-distance graph. The connected case uses root lattices and intersection theorems, while the disconnected case uses an orthogonal decomposition into component direction spaces and the span of their center differences. We also prove a relative bound for Euclidean two-distance sets and show that equality forces sphericity. Together with the Larman--Rogers--Seidel theorem, these results give maximum cardinality $d(d+1)/2$ for $9\le d\le21$ and $275$ for $d=22$, without exhaustive enumeration.

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

↑