Combinatorial presentation of multidimensional persistent homology (Q502621): Difference between revisions

Persistent homology theory is getting important in data science because it can detect the topological characteristics of given data and give some intuition of structures of them. One reason why the theory can be used in this area is that there is an equivalence between the category of persistent modules over a field \(F\) and \(F\)-vector spaces. This property makes it easier to compute the homology groups of given data. However, if the persistent modules are multidimensional, the property generally does not hold. This paper studies the homology groups of multifiltrations in which arrows are assumed to be injective. The authors generalise a result of \textit{G. Carlsson} et al. [J. Comput. Geom. 1, No. 1, 72--100 (2010; Zbl 1374.68649)] and show how to calculate the homology groups of multifiltrations in polynomial time.