Persistent Homology of Semialgebraic Sets

From MaRDI portal
Publication:6087751

DOI10.1137/22M1494415arXiv2202.09591OpenAlexW4387134400MaRDI QIDQ6087751FDOQ6087751


Authors: Saugata Basu, Negin Karisani Edit this on Wikidata


Publication date: 16 November 2023

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Abstract: We give an algorithm with singly exponential complexity for computing the barcodes up to dimension ell (for any fixed ellgeq0) 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 ell of semi-algebraic sets with no filtration present.


Full work available at URL: https://arxiv.org/abs/2202.09591







Cites Work


Cited In (5)





This page was built for publication: Persistent Homology of Semialgebraic Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087751)