Related papers: Interval Decomposition of Persistence Modules over…
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,…
The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings. We show…
While persistent homology has taken strides towards becoming a wide-spread tool for data analysis, multidimensional persistence has proven more difficult to apply. One reason is the serious drawback of no longer having a concise and…
The purpose of this paper is to initiate a new attack on Arveson's resistant conjecture, that all graded submodules of the $d$-shift Hilbert module $H^2$ are essentially normal. We introduce the stable division property for modules (and…
The output of persistent homology is an algebraic object called a persistence module. This object admits a decomposition into a direct sum of interval persistence modules described entirely by the barcode invariant. In this paper we…
We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary…
Recently, there is growing interest in the use of relative homology algebra to develop invariants using interval covers and interval resolutions (i.e., right minimal approximations and resolutions relative to interval-decomposable modules)…
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…
As well-known, inner functions play an important role in the study of bounded analytic function theory. In recent years, persistence module theory, as a main tool applied to Topological Data Analysis, has received widespread attention. In…
We consider sequences of absolute and relative homology and cohomology groups that arise naturally for a filtered cell complex. We establish algebraic relationships between their persistence modules, and show that they contain equivalent…
Time-series of persistence diagrams, known as vineyards, have shown to be useful in diverse applications. A natural algebraic version of vineyards is a time series of persistence modules equipped with interleaving maps between the…
A persistence module with $m$ discrete parameters is a diagram of vector spaces indexed by the poset $\mathbb{N}^m$. If we are only interested in the large scale behavior of such a diagram, then we can consider two diagrams equivalent if…
We present an algorithm to compute the primary decomposition of a submodule $\mathcal{N}$ of the free module $\Z[x_1, \ldots, x_n]^m$. For this purpose we use algorithms for primary decomposition of ideals in the polynomial ring over the…
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$…
One-dimensional persistent homology is arguably the most important and heavily used computational tool in topological data analysis. Additional information can be extracted from datasets by studying multi-dimensional persistence modules and…
The algebraic stability theorem for $\mathbb{R}$-persistence modules is a fundamental result in topological data analysis. We present a stability theorem for $n$-dimensional rectangle decomposable persistence modules up to a constant…
In recent years, persistence modules have been viewed as graded modules with gradation over a preordered set serving as the indexing set. We provide sufficient criteria for a projective module over a PID to be free when the indexing set is…
Persistent homology is a popular technique in topological data analysis that tracks the lifespans of homological features in a nested sequence of spaces. This data is typically presented in a multi-set called a persistence diagram or a…
Algebraic persistence studies persistence modules (typically, linear representations of the poset $\mathbf{R}^n$ with $n \geq 1$) and the algebraic relationships between persistence modules that are interleaved. The notion of…
The notion of generalized rank invariant in the context of multiparameter persistence has become an important ingredient for defining interesting homological structures such as generalized persistence diagrams. Naturally, computing these…