Maximum Betti numbers of Cech complexes
Abstract
The Upper Bound Theorem for convex polytopes implies that the p-th Betti number of the Cech complex of any set of N points in Rd and any radius satisfies βp = O(Nm), with m = \ p+1, d/2 \. 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 R3 and two radii such that the first Betti number of the Cech complex at one radius is (n+1)2 - 1, and the second Betti number of the Cech complex at the other radius is n2.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.