Matrix method for persistence modules on commutative ladders of finite type
A persistence module \(M\) on a commutative ladder over the field \(K\) can be identified with a commutative diagram of \(K\)-vector spaces and \(K\)-linear maps of the form \[\begin{array}{cccccccc} W_1 & \xleftrightarrow{\phi_1} & W_2 & \xleftrightarrow{\phi_2} & \cdots & W_{n-1} & \xleftrightarrow{\phi_{n-1}} & W_n\\ \hspace{6pt}\uparrow{F_1} & & \hspace{6pt}\uparrow{F_2} & & & \hspace{6pt}\uparrow{F_{n-1}} & & \hspace{6pt}\uparrow{F_n}\\ V_1 & \xleftrightarrow{\psi_1} & V_2 & \xleftrightarrow{\psi_2} & \cdots & V_{n-1} & \xleftrightarrow{\psi_{n-1}} & V_n \end{array}\] where each horizontal arrow has a specified direction, namely either \(\leftarrow\) or \(\rightarrow\). The direction \(\tau_i\) of the arrow \(\phi_i\) is required to be the same as that of \(\psi_i\), and the sequence \(\tau=(\tau_1,\ldots,\tau_{n-1})\) is called the orientation of the ladder. In the language of zigzag persistent homology, each horizontal row in the diagram is a \(\tau\)-module [\textit{G. Carlsson} and \textit{V. de Silva}, Found. Comput. Math. 10, No. 4, 367--405 (2010; Zbl 1204.68242)]. Any such module can be written as the direct sum of interval \(\tau\)-modules of the form \({\mathbb I}[a,b]\), where \({\mathbb I}[a,b]_i=K\) if \(a\leq i\leq b\) and trivial otherwise, and all non-trivial arrows are the identity. Using this basis, the map from the bottom row of the diagram to the top row determines a matrix \(\Phi(M)\). Under the assumption that \(n\leq 4\), the authors provide a Smith normal form style algorithm for reducing \(\Phi(M)\). The persistence diagram of \(M\) can then be extracted from the resulting matrix.
- Computing Decompositions of Modules over Finite-Dimensional Algebras
- Computing Homomorphism Spaces between Modules over Finite Dimensional Algebras
- Computing persistent homology
- Constructing homomorphism spaces and endomorphism rings.
- scientific article; zbMATH DE number 3741602 (Why is no real title available?)
- scientific article; zbMATH DE number 1253966 (Why is no real title available?)
- scientific article; zbMATH DE number 2228448 (Why is no real title available?)
- On Tame Algebras and Bocses
- Persistence modules on commutative ladders of finite type
- The theory of multidimensional persistence
- Topological persistence and simplification
- Unzerlegbare Darstellungen. I. (Indecomposable representations. I)
- Zigzag persistence
- Zigzag persistent homology and real-valued functions
- Every 1D persistence module is a restriction of some indecomposable 2D persistence module
- The persistent homology of a sampled map: from a viewpoint of quiver representations
- Computing persistence modules on commutative ladders of finite type
- Realizations of indecomposable persistence modules of arbitrarily large dimension
- Interval decomposition of infinite zigzag persistence modules
- The space of barcode bases for persistence modules
- Partial matchings induced by morphisms between persistence modules
- Computing Connection Matrices via Persistence-Like Reductions
- Bipath persistence
- Additive partial matchings for persistent homology
- Additive partial matchings induced by persistence maps
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)
