Maximum Betti numbers of \v{C}ech complexes
Combinatorics
2023-10-24 v1
Abstract
The Upper Bound Theorem for convex polytopes implies that the -th Betti number of the \v{C}ech complex of any set of points in and any radius satisfies , with . We construct sets in even and odd dimensions that prove this upper bound is asymptotically tight. For example, we describe a set of points in and two radii such that the first Betti number of the \v{C}ech complex at one radius is , and the second Betti number of the \v{C}ech complex at the other radius is .
Keywords
Cite
@article{arxiv.2310.14801,
title = {Maximum Betti numbers of \v{C}ech complexes},
author = {Herbert Edelsbrunner and János Pach},
journal= {arXiv preprint arXiv:2310.14801},
year = {2023}
}
Comments
22 pages, 3 figures