相关论文: N^d-indexed persistence modules, higher dimensiona…

We prove that pointwise finite-dimensional S^1 persistence modules over an arbitrary field decompose uniquely, up to isomorphism, into the direct sum of a bar code and finitely-many Jordan cells. These persistence modules have also been…

Multidimensional persistence studies topological features of shapes by analyzing the lower level sets of vector-valued functions. The rank invariant completely determines the multidimensional analogue of persistent homology groups. We prove…

We believe three ingredients are needed for further progress in persistence and its use: invariants not relying on decomposition theorems to go beyond 1-dimension, outcomes suitable for statistical analysis and a setup adopted for…

We show that a persistence module (for a totally ordered indexing set) consisting of finite-dimensional vector spaces is a direct sum of interval modules. The result extends to persistence modules with the descending chain condition on…

It has been shown that $1$-parameter persistence modules have a very simple classification, namely there is a discrete invariant called a barcode that completely characterizes $1$-parameter persistence modules up to isomorphism. In…

Commutative diagrams of vector spaces and linear maps over $\mathbb{Z}^2$ are objects of interest in topological data analysis (TDA) where this type of diagrams are called 2-parameter persistence modules. Given that quiver representation…

We define two notions. The first one is a $rank\ compression\ system$ $\xi$ for a finite poset $\mathbf{P}$ that assigns each interval subposet $I$ to an order-preserving map $\xi_I \colon I^{\xi} \to \mathbf{P}$ satisfying some conditions,…

Rank invariants are a parametrized version of Betti numbers of a space multi-filtered by a continuous vector-valued function. In this note we give a sufficient condition for their finiteness. This condition is sharp for spaces embeddable in…

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…

We define a simple, explicit map sending a morphism $f:M \rightarrow N$ of pointwise finite dimensional persistence modules to a matching between the barcodes of $M$ and $N$. Our main result is that, in a precise sense, the quality of this…

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…

Given a pointwise finite-dimensional persistence module over a totally ordered set $S$, a theorem of Crawley-Boevey guarantees the existence of a barcode. When the set $S$ is finite, the persistence module is an equioriented type-A quiver…

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 that any finitely presented rectangular…

In addition to inherent computational challenges, the absence of a canonical method for quantifying `persistence' in multi-parameter persistent homology remains a hurdle in its application. One of the best known quantifications of…

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…

When filtering a topological space by a single parameter, the theory of quiver representations provides a complete framework for decomposing the resulting persistence module to obtain its barcode. This is achieved by interpreting the…

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,…

Let $\mathbf{k}$ be a field and let $V: \mathscr{C} \to \mathbf{k}\textup{-Mod}$ be a point-wise finite dimensional persistence modules, where $\mathscr{C}$ is a small category. Assume that for all local Artinian $\mathbf{k}$-algebras $R$…

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…

Persistence modules serve as the algebraic foundation for topological data analysis, typically studied as representations of posets over a field. This article extends the structural and decomposition theory of persistence modules to the…