三维空间中最喜欢的距离
Favourite distances in 3-space
摘要:
设$S$是欧氏$3$ -空间中的$n$点的集合.为每个$x\in S$指定距离$r(x)>0$,并让$e_r(x,S)$表示$S$中距离$r(x)$和$x$的点的数量。Avis,Erdés和Pach(1988)引入了极值量$f_3(n)=\max\sum_{x\in S}e_r(x,S)$,其中最大值取于3-空间的所有$n$ -点子集$S$和所有距离赋值$r\colon S\to(0,\infty)$。我们表明,如果对$(S,r)$最大化$f_3(n)$和$n$是足够大的,那么,除了在大多数$2$点,$S$是包含在一个圆$\mathcal{C}$和对称轴$\mathcal{L}$的$\mathcal{C}$,$r(x)$等于从$x$到$C$的距离为每个$x\in S\cap\mathcal{L}$。这与一个新的结构一起,意味着$f_3(n)=n^2/4 + 5n/2 + O(1)$。
英文摘要:
Let $S$ be a set of $n$ points in Euclidean $3$-space. Assign to each $x\in S$ a distance $r(x)>0$, and let $e_r(x,S)$ denote the number of points in $S$ at distance $r(x)$ from $x$. Avis, Erdős and Pach (1988) introduced the extremal quantity $f_3(n)=\max\sum_{x\in S}e_r(x,S)$, where the maximum is taken over all $n$-point subsets $S$ of 3-space and all assignments $r\colon S\to(0,\infty)$ of distances. We show that if the pair $(S,r)$ maximises $f_3(n)$ and $n$ is sufficiently large, then, except for at most $2$ points, $S$ is contained in a circle $\mathcal{C}$ and the axis of symmetry $\mathcal{L}$ of $\mathcal{C}$, and $r(x)$ equals the distance from $x$ to $C$ for each $x\in S\cap\mathcal{L}$. This, together with a new construction, implies that $f_3(n)=n^2/4 + 5n/2 + O(1)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。