Maximum Betti numbers of \v{C}ech complexes

arXiv (Cornell University)(2023)

引用 0|浏览10
暂无评分
摘要
The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil \}$. We construct sets in even and odd dimensions that prove this upper bound is asymptotically tight. For example, we describe a set of $N = 2(n+1)$ points in $\mathbb R^3$ and two radii such that the first Betti number of the \v{C}ech complex at one radius is $(n+1)^2 - 1$, and the second Betti number of the \v{C}ech complex at the other radius is $n^2$.
更多
查看译文
关键词
maximum betti numbers,complexes
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要