On interval decomposability of 2D persistence modules
From MaRDI portal
On interval decomposability of \(2\)D persistence modules
Abstract: In the persistent homology of filtrations, the indecomposable decompositions provide the persistence diagrams. However, in almost all cases of multidimensional persistence, the classification of all indecomposable modules is known to be a wild problem. One direction is to consider the subclass of interval-decomposable persistence modules, which are direct sums of interval representations. We introduce the definition of pre-interval representations, a more natural algebraic definition, and study the relationships between pre-interval, interval, and indecomposable thin representations. We show that over the ``equioriented commutative D grid, these concepts are equivalent. Moreover, we provide a criterion for determining whether or not an D persistence module is interval/pre-interval/thin-decomposable without having to explicitly compute decompositions. For D persistence modules, we provide an algorithm together with a worst-case complexity analysis that uses the total number of intervals in an equioriented commutative D grid. We also propose several heuristics to speed up the computation.
In this paper, the authors focus on a well known problem in the multidimensional persistent homology of filtrations, namely the classification of all indecomposable modules which is known to be a wild problem. More precisely, they consider the subclass of interval-decomposable persistence modules. By introducing the definition of pre-interval representations, they study the relationships between pre-interval, interval, and thin indecomposable representations. They especially show that over the ``equioriented commutative 2D grid, these concepts are equivalent and provide a criterion for determining whether or not an \(n\)D persistence module is interval/pre-interval/thin-decomposable without having to explicitly compute decompositions. For 2D persistence modules, they provide an algorithm for determining interval-decomposability,
Recommendations
- On rectangle-decomposable 2-parameter persistence modules
- On the stability of interval decomposable persistence modules
- Decomposition of persistence modules
- Decomposition of pointwise finite-dimensional persistence modules.
- Every 1D persistence module is a restriction of some indecomposable 2D persistence module
Cites work
- A generalization of the fast LUP matrix decomposition algorithm and applications
- Algebraic stability of zigzag persistence modules
- Computing bottleneck distance for 2-D interval decomposable modules
- Decomposition of exact pfd persistence bimodules
- scientific article; zbMATH DE number 3695413 (Why is no real title available?)
- scientific article; zbMATH DE number 2228448 (Why is no real title available?)
- Matrix multiplication via arithmetic progressions
- Multiplying matrices faster than coppersmith-winograd
- On Tame Algebras and Bocses
- Persistence modules on commutative ladders of finite type
- Realizations of indecomposable persistence modules of arbitrarily large dimension
- Statistics on parallelogram polyominoes and a \(q,t\)-analogue of the Narayana numbers
- Tensor products on quiver representations.
- The multiplicity problem for indecomposable decompositions of modules over a finite-dimensional algebra. Algorithms and a computer algebra approach
- The theory of multidimensional persistence
- Topological persistence and simplification
- Unzerlegbare Darstellungen. I. (Indecomposable representations. I)
- Zigzag persistence
Cited in
(24)- Generalized persistence algorithm for decomposing multiparameter persistence modules
- On rectangle-decomposable 2-parameter persistence modules
- Hyperplane restrictions of indecomposable \(n\)-dimensional persistence modules
- Every 1D persistence module is a restriction of some indecomposable 2D persistence module
- Decomposition of exact pfd persistence bimodules
- Decomposition of persistence modules
- Realizations of indecomposable persistence modules of arbitrarily large dimensions
- Computing generalized rank invariant for 2-parameter persistence modules via zigzag persistence and its applications
- Local characterizations for decomposability of 2-parameter persistence modules
- Approximation by interval-decomposables and interval resolutions of persistence modules
- Homological approximations in persistence theory
- Basic metric geometry of the bottleneck distance
- The shift-dimension of multipersistence modules
- Bigraded Betti numbers and generalized persistence diagrams
- Harder-Narasimhan filtrations of persistence modules
- On approximation of 2D persistence modules by interval-decomposables
- Decomposition of zero-dimensional persistence modules via rooted subsets
- Refinement of interval approximations for fully commutative quivers
- Multi-parameter module approximation: an efficient and interpretable invariant for multi-parameter persistence modules with guarantees
- Probabilistic analysis of multiparameter persistence decompositions into intervals
- Relative Koszul coresolutions and relative Betti numbers
- Decomposing multiparameter persistence modules
- Super-polynomial growth of the generalized persistence diagram
- Multiparameter persistence modules in the large scale
This page was built for publication: On interval decomposability of \(2\)D persistence modules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144457)
