# Matrix method for persistence modules on commutative ladders of finite type

@article{Asashiba2018MatrixMF, title={Matrix method for persistence modules on commutative ladders of finite type}, author={Hideto Asashiba and Emerson G. Escolar and Yasuaki Hiraoka and Hiroshi Takeuchi}, journal={Japan Journal of Industrial and Applied Mathematics}, year={2018}, volume={36}, pages={97-130} }

The theory of persistence modules on the commutative ladders $$CL_n(\tau )$$CLn(τ) 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 $$CL_n(\tau )$$CLn(τ) as a morphism between zigzag modules, which can be expressed in a block matrix form. For the representation finite case ($$n\le 4$$n≤4), we provide an algorithm that uses certain permissible row and…

## 8 Citations

Every 1D persistence module is a restriction of some indecomposable 2D persistence module

- MathematicsJ. Appl. Comput. Topol.
- 2020

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.

Realizations of Indecomposable Persistence Modules of Arbitrarily Large Dimension

- MathematicsSoCG
- 2018

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.

The persistent homology of a sampled map: from a viewpoint of quiver representations

- MathematicsJ. Appl. Comput. Topol.
- 2021

This paper redefine induced maps of correspondences within the framework of quiver representations, and provides more concise proofs of the main theorems in the original paper.

Basis-independent partial matchings induced by morphisms between persistence modules

- Mathematics
- 2020

In this paper, we study how basis-independent partial matchings induced by morphisms between persistence modules (also called ladder modules) can be defined. Besides, we extend the notion of…

1 5 M ay 2 01 9 Every 1 D Persistence Module is a Restriction of Some Indecomposable 2 D Persistence Module

- Mathematics
- 2019

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…

The Persistent Homology of a Sampled Map

- Mathematics
- 2018

The theory of homology induced maps of correspondences proposed by Shaun Harker et al. in 2016 is a powerful tool which allows the retrieval of underlying homological information from sampled maps…

The Space of Barcode Bases for Persistence Modules

- Computer Science
- 2021

A new algorithm for computing barcodes which also keeps track of, and outputs, such a change of basis and an explicit characterisation of the group of transformations that sends one barcode basis to another.

## References

SHOWING 1-10 OF 15 REFERENCES

Persistence Modules on Commutative Ladders of Finite Type

- MathematicsDiscret. Comput. Geom.
- 2016

It is proved that the commutative ladders of length less than 5 are representation-finite and explicitly show their Auslander–Reiten quivers.

Zigzag persistent homology and real-valued functions

- MathematicsSCG '09
- 2009

The algorithmic results provide a way to compute zigzag persistence for any sequence of homology groups, but combined with the structural results give a novel algorithm for computing extended persistence that is easily parallelizable and uses (asymptotically) less memory.

Constructing Homomorphism Spaces and Endomorphism Rings

- Mathematics, Computer ScienceJ. Symb. Comput.
- 2001

A new deterministic algorithm for constructing homomorphism spaces and endomorphism rings of finite-dimensional modules of right Grobner bases is presented, implemented in the computer algebra system GAP and included in Hopf, a computational package for noncommutative algebra.

Computing Persistent Homology

- Mathematics
- 2005

Abstract
We show that the persistent homology of a filtered d-dimensional
simplicial complex is simply the standard homology of a
particular graded module over a polynomial ring.
Our analysis…

Elements of the Representation Theory of Associative Algebras: Techniques of Representation Theory

- Mathematics
- 2006

This first part of a two-volume set offers a modern account of the representation theory of finite dimensional associative algebras over an algebraically closed field. The authors present this topic…

The Theory of Multidimensional Persistence

- MathematicsDiscret. Comput. Geom.
- 2009

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.

The theory of multidimensional persistence

- MathematicsSCG '07
- 2007

This paper proposes the rank invariant, a discrete invariant for the robust estimation of Betti numbers in a multifiltration, and proves its completeness in one dimension.

Computing Decompositions of Modules over Finite-Dimensional Algebras

- Mathematics, Computer ScienceExp. Math.
- 2007

An algorithm to compute decompositions of modules of finite-dimensional algebras over finite fields is described and implemented in the C-Meat-Axe.

Polynomial time algorithms for modules over finite dimensional algebras

- MathematicsISSAC
- 1997

We present polynomial time algorithms for some fundamental tasks from representation theory of finite dimensional algebras. These involve testing (and constructing) isomorphisms of modules as well as…

Unzerlegbare Darstellungen I

- Mathematics
- 1972

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…