2000 character limit reached
Maximum Persistent Betti Numbers of Čech Complexes
Published 8 Sep 2024 in math.CO | (2409.05241v1)
Abstract: This note proves that only a linear number of holes in a \v{C}ech complex of $n$ points in $\mathbb{R}d$ can persist over an interval of constant length. The proof uses a packing argument supported by relating the \v{C}ech complexes with corresponding snap complexes over the cells in a partition of space. The bound also applies to Alpha complexes and Vietoris-Rips complexes.
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.