Related papers: Persistence modules induced by inner functions
A well-known problem in holomorphic dynamics is to obtain Denjoy--Wolff-type results for compositions of self-maps of the unit disc. Here, we tackle the particular case of inner functions: if $f_n:\mathbb{D}\to\mathbb{D}$ are inner…
This short note establishes explicit and broadly applicable relationships between persistence-based distances computed locally and globally. In particular, we show that the bottleneck distance between two zigzag persistence modules…
The concept of edit distance, which dates back to the 1960s in the context of comparing word strings, has since found numerous applications with various adaptations in computer science, computational biology, and applied topology. By…
We show that computing the interleaving distance between two multi-graded persistence modules is NP-hard. More precisely, we show that deciding whether two modules are $1$-interleaved is NP-complete, already for bigraded, interval…
Forward iteration of holomorphic self-maps generalizes the iteration of a single function in a natural way. This framework arises in complex dynamics, for instance in the study of wandering domains and in seeking suitable extensions of the…
In this paper we provide an explicit connection between level-sets persistence and derived sheaf theory over the real line. In particular we construct a functor from 2-parameter persistence modules to sheaves over $\mathbb{R}$, as well as a…
The pruning distance recently introduced by Bjerkevik compares persistence modules using approximate decompositions called prunings. Bjerkevik conjectures that this distance is Lipschitz equivalent to the classical interleaving distance on…
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…
The stability theorem for persistent homology is a central result in topological data analysis. While the original formulation of the result concerns the persistence barcodes of $\mathbb{R}$-valued functions, the result was later cast in a…
The classical persistence algorithm computes the unique decomposition of a persistence module implicitly given by an input simplicial filtration. Based on matrix reduction, this algorithm is a cornerstone of the emergent area of topological…
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…
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…
Exterior powers play important roles in persistent homology in computational geometry. In the present paper we study the problem of extracting the $K$ longest intervals of the exterior-power layers of a tame persistence module. We prove a…
Inner functions play a central role in function theory and operator theory on the Hardy space over the unit disk. Motivated by recent works of C. B\'en\'eteau et al. and of D. Seco, we discuss inner functions on more general weighted Hardy…
We define a class of invariants, which we call homological invariants, for persistence modules over a finite poset. Informally, a homological invariant is one that respects some homological data and takes values in the free abelian group…
Persistent homology analysis provides means to capture the connectivity structure of data sets in various dimensions. On the mathematical level, by defining a metric between the objects that persistence attaches to data sets, we can…
In this paper we study multidimensional persistence modules [5,13] via what we call tame functors and noise systems. A noise system leads to a pseudo-metric topology on the category of tame functors. We show how this pseudo-metric can be…
We demonstrate that an equivalence of categories using $\varepsilon$-interleavings as a fundamental component exists between the model of persistence modules as graded modules over a polynomial ring and the model of persistence modules as…
A persistence module is a functor $f: \mathbf{I} \to \mathsf{E}$, where $\mathbf{I}$ is the poset category of a totally ordered set. This work introduces saecular decomposition: a categorically natural method to decompose $f$ into simple…
From the work of Bauer and Lesnick, it is known that there is no functor from the category of pointwise finite-dimensional persistence modules to the category of barcodes and overlap matchings. In this work, we introduce sub-barcodes and…