AI 中文总结
该研究针对直径不超过1的二维有限点集，证实Steinerberger关于对跖点与邻近点数量比率的猜想，还得出双参数情形下的最优比率，证明借助辅助图与邻接矩阵特征值完成，成果来自ChatGPT 5.4人机交互。
AI 中文摘要
设$X=\{x_1,\dots,x_n\}\subset \mathbb{R}^2$是直径不超过1的有限点集。人们自然会期望：若多对$(x_i,x_j)$之间的距离接近1，则必然出现某种聚类现象，意味着其中相当数量的对也会非常接近。对于$0<\varepsilon<1$，我们称一对$(x_i,x_j)$为$\varepsilon$-对跖点当且仅当$\\|x_i-x_j\\|\ge 1-\varepsilon$，为$\varepsilon$-邻近点当且仅当$\\|x_i-x_j\\|\le \varepsilon$。我们证明存在一个通用常数$c>0$，使得对所有$0<\varepsilon<1$，当$n$足够大时，有：$\big|\{(i,j):\\|x_i-x_j\\|\le \varepsilon\}\big| \geq c\cdot \varepsilon^{1/2}\cdot \big|\{(i,j):\\|x_i-x_j\\|\geq 1-\varepsilon\}\big|$。这证实了Steinerberger近期提出的猜想，该猜想询问$\varepsilon^{1/2}$的比率是否为最优。我们还通过考虑距离不超过$\varepsilon_1$且至少为$1-\varepsilon_2$的对的数量，研究了Steinerberger问题的双参数版本，证明此情况下最优比率为$\varepsilon_1^2\cdot\varepsilon_2^{-3/2}$。证明过程通过引入与集合$X$关联的辅助图，并将问题转化为对其邻接矩阵的最大特征值进行界定，我们的主要成果是使用ChatGPT 5.4进行人机交互的结果。
英文摘要
Let $X=\{x_1,\dots,x_n\}\subset \mathbb{R}^2$ be a finite set of points of diameter at most $1$. It is natural to expect that if many pairs $(x_i,x_j)$ lie at distance close to $1$ from each other, then some clustering phenomenon must occur, implying that a significant number of these pairs are also very close to each other. %For $0<\varepsilon<1$, we call a pair $(x_i,x_j)$ $\varepsilon$-antipodal if $\|x_i-x_j\|\ge 1-\varepsilon$ and $\varepsilon$-neighboring if $\|x_i-x_j\|\le \varepsilon$. We prove that there exists a universal constant $c>0$ such that for all $0<\varepsilon<1$, whenever $n$ is large enough, we have: \[ \big|\{(i,j):\|x_i-x_j\|\le \varepsilon\}\big| \geq c\cdot \varepsilon^{1/2}\cdot \big|\{(i,j):\|x_i-x_j\|\geq 1-\varepsilon\}\big|. \] This confirms a recent conjecture of Steinerberger, who asked whether the $\varepsilon^{1/2}$ ratio is the best possible. We also study a two-parameter version of Steinerberger's question by considering the number of pairs at distance at most $\varepsilon_1$ and at distance at least $1-\varepsilon_2$. We show that in this case the optimal ratio is $\varepsilon_1^2\cdot\varepsilon_2^{-3/2}$. The proof proceeds by introducing an auxiliary graph associated with the set $X$ and reducing the problem to bounding the largest eigenvalue of its adjacency matrix. Our main result is the outcome of human--AI interactions using ChatGPT 5.4.
Comments19 pages, 7 figures
