Matrix method for persistence modules on commutative ladders of finite type

DOI10.1007/S13160-018-0331-YzbMATH Open1456.55004arXiv1706.10027OpenAlexW2734095886WikidataQ129200222 ScholiaQ129200222MaRDI QIDQ1736464FDOQ1736464

Authors: Hideto Asashiba, Emerson G. Escolar, Yasuaki Hiraoka, Hiroshi Takeuchi 

Publication date: 26 March 2019

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Abstract: The theory of persistence modules on the commutative ladders $C{L}_n(au)$ provides an extension of persistent homology. However, an efficient algorithm to compute the generalized persistence diagrams is still lacking. In this work, we view a persistence module $M$ on $C{L}_n(au)$ as a morphism between zigzag modules, which can be expressed in a block matrix form. For the representation finite case ($nleq4)$, we provide an algorithm that uses certain permissible row and column operations to compute a normal form of the block matrix. In this form an indecomposable decomposition of $M$, and thus its persistence diagram, is obtained.

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

Recommendations

• Computing persistence modules on commutative ladders of finite type
• Persistence modules on commutative ladders of finite type
• The representation theorem of persistence revisited and generalized
• On the structural theorem of persistent homology
• Persistent homology over directed acyclic graphs

zbMATH Keywords

algorithmscomputational topologypersistence modulescommutative ladders

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Representations of quivers and partially ordered sets (16G20) Computational methods for problems pertaining to algebraic topology (55-08)

Cites Work

• The theory of multidimensional persistence
• Computing persistent homology
• Topological persistence and simplification
• Zigzag persistence
• Unzerlegbare Darstellungen. I. (Indecomposable representations. I)
• Title not available (Why is that?)
• On Tame Algebras and Bocses
• Zigzag persistent homology and real-valued functions
• Computing Homomorphism Spaces between Modules over Finite Dimensional Algebras
• Computing Decompositions of Modules over Finite-Dimensional Algebras
• Title not available (Why is that?)
• Constructing homomorphism spaces and endomorphism rings.
• Title not available (Why is that?)
• Persistence modules on commutative ladders of finite type

Cited In (9)

• Computing Connection Matrices via Persistence-Like Reductions
• The persistent homology of a sampled map: from a viewpoint of quiver representations
• Computing persistence modules on commutative ladders of finite type
• Partial matchings induced by morphisms between persistence modules
• The space of barcode bases for persistence modules
• Realizations of indecomposable persistence modules of arbitrarily large dimension
• Bipath persistence
• Every 1D persistence module is a restriction of some indecomposable 2D persistence module
• Interval decomposition of infinite zigzag persistence modules

This page was built for publication: Matrix method for persistence modules on commutative ladders of finite type

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