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

格网层数的显式边界

Explicit bounds for the layer number of the grid

Travis Dillon, Narmada Varadarajan

摘要:

通过迭代去除点集的凸包的顶点来耗尽点集所需的步骤的数目被称为点集的层数。本文给出了一个简短的证明,证明了网格$\{1,2,\dots,n\}^d$的层数至多为$\frac{1}{4}dn^2+1$,显著地改善了在最著名的上界中对$d$的依赖性.我们还证明了$\frac{1}{2}d(n-1)+1$的一个下界,这表明网格的层数在$d$中是线性的。

英文摘要:

The number of steps required to exhaust a point set by iteratively removing the vertices of its convex hull is called the layer number of the point set. This article presents a short proof that the layer number of the grid $\{1,2,\dots,n\}^d$ is at most $\frac{1}{4}dn^2+1$, significantly improving the dependence on $d$ in the best-known upper bound. We also prove a lower bound of $\frac{1}{2}d(n-1)+1$, which shows that the layer number of the grid is linear in $d$.

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

↑