Matrix method for persistence modules on commutative ladders of finite type

From MaRDI portal
Publication:1736464




Abstract: The theory of persistence modules on the commutative ladders CLn(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 CLn(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.









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)