arXiv · 1210.1932
A presentation of general multipersistence modules computable in polynomial time?
Abstract
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.
Explore related subjects
Keep this discovery
Antonio Patriarca, Martina Scolamiero, Francesco Vaccarino. 2012-10-06. A presentation of general multipersistence modules computable in polynomial time?. https://arxiv.org/abs/1210.1932
Cite the original work for its findings. Save a collection to share your selection of sources.