2012/10/06 by Antonio Patriarca, Patriarca, Antonio, Martina Scolamiero +3
Computer Science · Mathematics · #13P10 #55N99 #55U99 #Algebraic Topology (math.AT) #Commutative Algebra (math.AC) #Commutative Algebra and Its Applications #Computational Geometry (cs.CG) #FOS: Computer and information sciences #FOS: Mathematics #Homotopy and Cohomology in Algebraic Topology #I.1.2 #I.3.5 #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.1210.1932
openalex publication_date 2012/10/06 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
Multipersistence homology modules were introduced by G.Carlsson and A.Zomorodian which gave, together with G.Singh, an algorithm to compute their Groebner bases. Although their algorithm has polynomial complexity when the chain modules are free, i.e. in the one-critical case, it might be exponential in general. We give a new presentation of multipersistence homology modules, which allows us to design an algorithm to compute their Groebner bases always in polynomial time by avoiding the mapping telescope.