2000 character limit reached
Maximum Betti numbers of Čech complexes
Published 23 Oct 2023 in math.CO | (2310.14801v1)
Abstract: 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 Rd$ 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 R3$ 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 $n2$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.