{"title":"Persistent Homology of Semialgebraic Sets","authors":"Saugata Basu, Negin Karisani","doi":"10.1137/22m1494415","DOIUrl":null,"url":null,"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 semialgebraic set by the sublevel 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 semialgebraic sets with no filtration present.","PeriodicalId":48489,"journal":{"name":"SIAM Journal on Applied Algebra and Geometry","volume":null,"pages":null},"PeriodicalIF":1.6000,"publicationDate":"2023-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Applied Algebra and Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/22m1494415","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 4
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 semialgebraic set by the sublevel 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 semialgebraic sets with no filtration present.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
