On the structural theorem of persistent homology

From MaRDI portal
Publication:2334510

DOI10.1007/S00454-018-0042-9zbMATH Open1471.55007arXiv1701.02055OpenAlexW2962824555WikidataQ128984960 ScholiaQ128984960MaRDI QIDQ2334510FDOQ2334510


Authors: Killian Meehan, Andrei Pavlichenko, Jan Segert Edit this on Wikidata


Publication date: 7 November 2019

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: We study the categorical framework for the computation of persistent homology, without reliance on a particular computational algorithm. The computation of persistent homology is commonly summarized as a matrix theorem, which we call the Matrix Structural Theorem. Any of the various algorithms for computing persistent homology constitutes a constructive proof of the Matrix Structural Theorem. We showthat the Matrix Structural Theorem is equivalent to the Krull-Schmidt property of the category of filtered chain complexes. We separately establish the Krull-Schmidt property by abstract categorical methods, yielding a novel nonconstructive proof of the Matrix Structural Theorem. These results provide the foundation for an alternate categorical framework for decomposition in persitent homology, bypassing the usual persistence vector spaces and quiver representations.


Full work available at URL: https://arxiv.org/abs/1701.02055




Recommendations




Cites Work


Cited In (17)





This page was built for publication: On the structural theorem of persistent homology

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334510)