A graph-based algorithm computes minimal projective presentations and a projective implicit representation of persistent homology for arbitrary finite poset towers over Z2.
Combinatorial presentation of multidimensional persistent homology
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AT 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Computing Projective Implicit Representations from Poset Towers
A graph-based algorithm computes minimal projective presentations and a projective implicit representation of persistent homology for arbitrary finite poset towers over Z2.