空单星
Stars of Empty Simplices
摘要:
设$X=\{x_1,\ldots,x_n\} \subset \mathbb R^d$是一般位置上的$n$元点集。对于一个$k$ -元素子集$\{x_{i_1},\ldots,x_{i_k}\} \subset X$,令度${\rm deg}_k(x_{i_1},\ldots,x_{i_k})$是不包含$X$中其他点的空单形$\{x_{i_1},\ldots,x_{i_{d+1}}\} \subset X$的个数。集合$X$的$k$ -度,记为${\rm deg}_k(X)$,定义为$X$的所有$k$ -元素子集上的最大度。我们表明,如果$X$是一个随机点集组成的$n$独立和均匀地选择点从一个紧凑的集合$K$,然后${\rm deg}_d(X)=Θ(n)$,改善以前得到的结果Bárány,Marckert和Reitzner [许多空三角形有一个共同的边缘,离散计算。Geom.,2013]和Temesvari [随机点集的空单形的最大数目的矩,离散计算。Geom.,[2018]并给出了正确的数量级与一个显着简单的证明。此外,我们还研究了${\rm deg}_k(X)$。在$k=1$的情况下,我们证明了${\rm deg}_1(X)=Θ(n^{d-1})$。
英文摘要:
Let $X=\{x_1,\ldots,x_n\} \subset \mathbb R^d$ be an $n$-element point set in general position. For a $k$-element subset $\{x_{i_1},\ldots,x_{i_k}\} \subset X$ let the degree ${\rm deg}_k(x_{i_1},\ldots,x_{i_k})$ be the number of empty simplices $\{x_{i_1},\ldots,x_{i_{d+1}}\} \subset X$ containing no other point of $X$. The $k$-degree of the set $X$, denoted ${\rm deg}_k(X)$, is defined as the maximum degree over all $k$-element subset of $X$. We show that if $X$ is a random point set consisting of $n$ independently and uniformly chosen points from a compact set $K$ then ${\rm deg}_d(X)=Θ(n)$, improving results previously obtained by Bárány, Marckert and Reitzner [Many empty triangles have a common edge, Discrete Comput. Geom., 2013] and Temesvari [Moments of the maximal number of empty simplices of a random point set, Discrete Comput. Geom., 2018] and giving the correct order of magnitude with a significantly simpler proof. Furthermore, we investigate ${\rm deg}_k(X)$. In the case $k=1$ we prove that ${\rm deg}_1(X)=Θ(n^{d-1})$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。