Related papers: Interval Replacements of Persistence Modules

Multidimensional persistence has been proposed to study the persistence of topological features in data indexed by multiple parameters. In this work, we further explore its algebraic complications from the point of view of higher…

A recent work by Lesnick and Wright proposed a visualisation of $2$D persistence modules by using their restrictions onto lines, giving a family of $1$D persistence modules. We give a constructive proof that any $1$D persistence module with…

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…

An ideal invariant for multiparameter persistence would be discriminative, computable and stable. In this work we analyse the discriminative power of a stable, computable invariant of multiparameter persistence modules: the fibered bar…

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…

A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…

The theory of persistence modules on the commutative ladders $CL_n(\tau)$ provides an extension of persistent homology. However, an efficient algorithm to compute the generalized persistence diagrams is still lacking. In this work, we view…

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…

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 Harder-Narasimhan type of a quiver representation is a discrete invariant parameterised by a real-valued function (called a central charge) defined on the vertices of the quiver. In this paper, we investigate the strength and…

The barcode of a persistence module serves as a complete combinatorial invariant of its isomorphism class. Barcodes are typically extracted by performing changes of basis on a persistence module until the constituent matrices have a special…

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…

Structural results impose sufficient conditions on the model parameters of a Markov decision process (MDP) so that the optimal policy is an increasing function of the underlying state. The classical assumptions for MDP structural results…

The Harder-Narasimhan types are a family of discrete isomorphism invariants for representations of finite quivers. Previously (arXiv:2303.16075), we evaluated their discriminating power in the context of persistence modules over a finite…

For every mapping of a perturbed spacetime onto a background and with any vector field $\xi$ we construct a conserved covariant vector density $I(\xi)$, which is the divergence of a covariant antisymmetric tensor density, a…

An important problem in the field of Topological Data Analysis is defining topological summaries which can be combined with traditional data analytic tools. In recent work Bubenik introduced the persistence landscape, a stable…

The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective of the…

Let $\mathscr{P}$ be a poset and $\mathcal{S}$ a sequence of $n$ finite substes of $\mathscr{P}$. The Jordan type of a $\mathscr{P}$-persistence module $M$ at $\mathcal{S}$, denoted by $\mathsf{J}_{\mathcal{S}}(M) \in \mathbb{N}^n$, is…

Interleaving distances provide a fundamental tool for comparing persistence modules and have been widely used in topological data analysis. Their definitions are typically based on translation structures (shift operations) on the indexing…

Persistence diagrams, which summarize the birth and death of homological features extracted from data, are employed as stable signatures for applications in image analysis and other areas. Besides simply considering the multiset of…