On Interval Decomposability of 2D Persistence Modules

  title={On Interval Decomposability of 2D Persistence Modules},
  author={Hideto Asashiba and Micka{\"e}l Buchet and Emerson G. Escolar and Ken Nakashima and Michio Yoshiwaki},
  journal={Computational Geometry},

Figures from this paper

On Approximation of $2$D Persistence Modules by Interval-decomposables
A new invariant for $2$D persistence modules called the compressed multiplicity is proposed and it is shown that it generalizes the notions of the dimension vector and the rank invariant.
Every 1D persistence module is a restriction of some indecomposable 2D persistence module
It is given a constructive proof that any 1D persistence module with finite support can be found as a restriction of some indecomposable 2D persistence Module with finiteSupport as line restrictions.
Hyperplane Restrictions of Indecomposable $n$-Dimensional Persistence Modules
Understanding the structure of indecomposable $n$-dimensional persistence modules is a difficult problem, yet is foundational for studying multipersistence. To this end, Buchet and Escolar showed
On the complexity of zero-dimensional multiparameter persistence
Multiparameter persistence is a natural extension of the well-known persistent homology, which has attracted a lot of interest. However, there are major theoretical obstacles preventing the full
Generalized Persistence Algorithm for Decomposing Multi-parameter Persistence Modules
  • T. Dey, Cheng Xin
  • Computer Science
    Journal of Applied and Computational Topology
  • 2022
A generalization of the persistence algorithm based on a generalized matrix reduction technique that runs in $O(n^{2\omega})$ time where $\omega<2.373$ is the exponent for matrix multiplication.
The Generalized Persistence Diagram Encodes the Bigraded Betti Numbers
The generalized persistence diagram by Kim and Mémoli encodes the bigraded Betti numbers of finite 2-parameter persistence modules and implies that all invariants of 2- parameter persistence module that are computed by the software RIVET are encoded in the generalized persistence diagrams.
Computing Generalized Rank invariant for 2-Parameter Persistence Modules via Zigzag Persistence and its Applications
The generalized rank over a finite interval I of a Z 2 -indexed persistence module M is equal to the generalized rank of the zigzag module that is induced on a certain path in I trac-ing mostly its boundary.
1 5 M ay 2 01 9 Every 1 D Persistence Module is a Restriction of Some Indecomposable 2 D Persistence Module
A recent work by Lesnick and Wright proposed a visualisation of 2D persistence modules by using their restrictions onto lines, giving a family of 1D persistence modules. We give a constructive proof
Decomposition of Certain Representations Into A Direct Sum of Indecomposable Representations
Representations of quivers and posets are produced by persistent homology. It is possible to decompose such representations into direct sums of indecomposable representations. The indecomposable
Generalized persistence diagrams for persistence modules over posets
The barcode of any interval decomposable persistence modules of finite dimensional vector spaces can be extracted from the rank invariant by the principle of inclusion-exclusion, leading to a promotion of Patel's semicontinuity theorem about type $\mathcal{A}$ persistence diagram to Lipschitz continuity theorem for the category of sets.


Stability of higher-dimensional interval decomposable persistence modules
A stability theorem for $n$-dimensional rectangle decomposable persistence modules up to a constant $(2n-1)$ that is a generalization of the algebraic stability theorem, and also has connections to the complexity of calculating the interleaving distance.
Decomposition of Exact pfd Persistence Bimodules
We characterize the class of persistence modules indexed over $$\mathbb {R}^2$$ R 2 that are decomposable into summands whose supports have the shape of a block —i.e. a horizontal band, a vertical
Realizations of Indecomposable Persistence Modules of Arbitrarily Large Dimension
This work proposes a simple algebraic construction to illustrate the existence of infinite families of indecomposable persistence modules over regular grids of sufficient size and provides realizations by topological spaces and Vietoris-Rips filtrations, showing that they can actually appear in real data and are not the product of degeneracies.
Persistence Modules on Commutative Ladders of Finite Type
It is proved that the commutative ladders of length less than 5 are representation-finite and explicitly show their Auslander–Reiten quivers.
Computing Bottleneck Distance for 2-D Interval Decomposable Modules
A polynomial time algorithm is presented to compute the bottleneck distance for modules from indecomposables, which bounds the interleaving distance from above, and another algorithm is given to compute a new distance called {\em dimension distance} that bounds it from below.
Algebraic Stability of Zigzag Persistence Modules
This paper functorially extends each zigzag persistence module to a two-dimensional persistence module, and establishes an algebraic stability theorem for these extensions, which yields a stability result for free two- dimensional persistence modules.
The Theory of Multidimensional Persistence
The rank invariant is proposed, a discrete invariant for the robust estimation of Betti numbers in a multifiltration, and it is shown that no similar complete discrete invariant exists for multidimensional persistence.
Decomposition theory of modules: the case of Kronecker algebra
Let A be a finite-dimensional algebra over an algebraically closed field $$\Bbbk $$k. For any finite-dimensional A-module M we give a general formula that computes the indecomposable decomposition of
Unzerlegbare Darstellungen I
LetK be the structure got by forgetting the composition law of morphisms in a given category. A linear representation ofK is given by a map V associating with any morphism ϕ: a→e ofK a linear vector
Zigzag Persistence
Zigzag persistence generalises the highly successful theory of persistent homology and addresses several situations which are not covered by that theory, and develops theoretical and algorithmic foundations with a view towards applications in topological statistics.