paper

Persistent homology of semi-algebraic sets

arXiv:2202.09591

Abstract

We give an algorithm with singly exponential complexity for computing the barcodes up to dimension (for any fixed ) of the filtration of a given semi-algebraic set by the sub-level sets of a given polynomial. Our algorithm is the first algorithm for this problem with singly exponential complexity, and generalizes the corresponding results for computing the Betti numbers up to dimension of semi-algebraic sets with no filtration present.

arXiv comment33 pages, 3 figures. New references added. arXiv admin note: substantial text overlap with arXiv:2009.13365