任意范数下的更多单位距离
More unit distances in arbitrary norms
AI总结:
该研究证明对任意d≥2维范数存在n点集实现至少(d/2-o(1))n log₂n个单位距离,匹配典型范数的已知上界,还证明d≥3的典型范数单位距离图含所有m的K_{d,m}副本。
摘要:
对于d≥2以及ℝᵈ上的任意范数,我们证明存在一个包含n个点的集合,在该范数下,该集合对每个n都能产生至少(d/2 - o(1))n log₂n个单位距离。这一结果与Alon、Bucić和Sauermann近期针对典型范数(即属于贫集的范数)证明的上界相匹配。我们还表明,当d≥3且ℝᵈ上为典型范数时,该范数的单位距离图对所有m都包含一个K_{d,m}的副本。
英文摘要:
For $d\geq 2$ and any norm on $\mathbb R^d$, we prove that there exists a set of $n$ points that spans at least $(\tfrac d2-o(1))n\log_2n$ unit distances under this norm for every $n$. This matches the upper bound recently proved by Alon, Bucić, and Sauermann for typical norms (i.e., norms lying in a comeagre set). We also show that for $d\geq 3$ and a typical norm on $\mathbb R^d$, the unit distance graph of this norm contains a copy of $K_{d,m}$ for all $m$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。