English

Maximum Betti numbers of \v{C}ech complexes

Combinatorics 2023-10-24 v1

Abstract

The Upper Bound Theorem for convex polytopes implies that the pp-th Betti number of the \v{C}ech complex of any set of NN points in Rd\mathbb R^d and any radius satisfies βp=O(Nm)\beta_{p} = O(N^{m}), with m=min{p+1,d/2}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)N = 2(n+1) points in R3\mathbb R^3 and two radii such that the first Betti number of the \v{C}ech complex at one radius is (n+1)21(n+1)^2 - 1, and the second Betti number of the \v{C}ech complex at the other radius is n2n^2.

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

R2 v1 2026-06-28T12:58:46.417Z