Related papers: Every 1D Persistence Module is a Restriction of So…

Local conditions for the direct summands of a persistence module to belong to a certain class of indecomposables have been proposed in the 2-parameter setting, notably for the class of indecomposables called block modules, which plays a…

Persistence modules that decompose into interval modules are important in topological data analysis because we can interpret such intervals as the lifetime of topological features in the data. We can classify the settings in which…

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 development of this promising theory. In this…

Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…

We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…

In 2009, Chazal et al. introduced $\epsilon$-interleavings of persistence modules. $\epsilon$-interleavings induce a pseudometric $d_I$ on (isomorphism classes of) persistence modules, the interleaving distance. The definitions of…

We study the decomposition of zero-dimensional persistence modules, viewed as functors valued in the category of vector spaces factorizing through sets. Instead of working directly at the level of vector spaces, we take a step back and…

We investigate the existence of sufficient local conditions under which poset representations decompose as direct sums of indecomposables from a given class. In our work, the indexing poset is the product of two totally ordered sets,…

Multiparameter persistence modules can be uniquely decomposed into indecomposable summands. Among these indecomposables, intervals stand out for their simplicity, making them preferable for their ease of interpretation in practical…

Persistence modules are representations of products of totally ordered sets in the category of vector spaces. They appear naturally in the representation theory of algebras, but in recent years they have also found applications in other…

In this paper, we extend bottleneck stability to the setting of one dimensional constructible persistences module valued in any small abelian category.

In the representation theory of real reductive Lie groups, many objects have finiteness properties. For example, the lengths of Verma modules and principal series representations are finite, and more precisely, they are bounded. In this…

While decomposition of one-parameter persistence modules behaves nicely, as demonstrated by the algebraic stability theorem, decomposition of multiparameter modules is known to be unstable in a certain precise sense. Until now, it has not…

The Isometry Theorem of Chazal et al. and Lesnick is a fundamental result in persistence theory, which states that the interleaving distance between two one-parameter persistence modules is equal to the bottleneck distance between their…

We study decomposable N^d-indexed persistence modules via higher dimensional partitions. Their barcodes are defined in terms of the extended interior of the corresponding Young diagrams. For two decomposable N^d-indexed persistence modules,…

We apply poset cocalculus, a functor calculus framework for functors out of a poset, to study the problem of decomposing multipersistence modules into simpler components. We both prove new results in this topic and offer a new perspective…

In recent work, generalized persistence modules have proved useful in distinguishing noise from the legitimate topological features of a data set. Algebraically, generalized persistence modules can be viewed as representations for the poset…

Dey and Xin (J.Appl.Comput.Top., 2022, arXiv:1904.03766) describe an algorithm to decompose finitely presented multiparameter persistence modules using a matrix reduction algorithm. Their algorithm only works for modules whose generators…

We give down-to-earth proofs of the structure theorems for persistence modules.

We define a class of multiparameter persistence modules that arise from a one-parameter family of functions on a topological space and prove that these persistence modules are stable. We show that this construction can produce…