Related papers: Computation of $\gamma$-linear projected barcodes …

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…

We investigate the relations between algebraic structures, spectral invariants, and persistence modules, in the context of monotone Lagrangian Floer homology with Hamiltonian term. Firstly, we use the newly introduced method of filtered…

Persistent homology was shown by Carlsson and Zomorodian to be homology of graded chain complexes with coefficients in the graded ring $\kk[t]$. As such, the behavior of persistence modules -- graded modules over $\kk[t]$ is an important…

We develop a general framework for numerically solving differential equations while preserving invariants. As in standard projection methods, we project an arbitrary base integrator onto an invariant-preserving manifold, however, our method…

Persistence diagrams have been widely used to quantify the underlying features of filtered topological spaces in data visualization. In many applications, computing distances between diagrams is essential; however, computing these distances…

Bifurcation characterizes the qualitative changes in parameterized dynamical systems and is one of the major topics in the field. In this work, we study combinatorial bifurcations within the framework of combinatorial dynamical systems -- a…

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…

Persistent homology has been recently studied with the tools of sheaf theory in the derived setting by Kashiwara and Schapira, after J. Curry has made the first link between persistent homology and sheaves. We prove the isometry theorem in…

Let $K$ be a finite simplicial, cubical, delta or CW complex. The persistence map $\mathrm{PH}$ takes a filter $f:K \rightarrow \mathbb{R}$ as input and returns the barcodes $\mathrm{PH}(f)$ of the associated sublevel set persistent…

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

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…

We provide a definition of ephemeral multi-persistent modules and prove that the quotient of persistent modules by the ephemeral ones is equivalent to the category of $\gamma$-sheaves. In the case of one-dimensional persistence, our…

We construct "barcodes" for the chain complexes over Novikov rings that arise in Novikov's Morse theory for closed one-forms and in Floer theory on not-necessarily-monotone symplectic manifolds. In the case of classical Morse theory these…

Graphcodes were recently introduced as a technique to employ two-parameter persistence modules in machine learning tasks (Kerber and Russold, NeurIPS 2024). We show in this work that a compressed version of graphcodes yields a description…

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…

We develop a stability theory for minimal projective resolutions of $\mathbf{P}$-modules, where $\mathbf{P}$ is a finite metric poset. We use the G\"ulen-McCleary distance on $\mathbf{P}$-modules together with a new complex matching…

Constrained coding plays a key role in optimizing performance and mitigating errors in applications such as storage and communication, where specific constraints on codewords are required. While non-parametric constraints have been…

One of the main reasons for topological persistence being useful in data analysis is that it is backed up by a stability (isometry) property: persistence diagrams of $1$-parameter persistence modules are stable in the sense that the…

We expand the toolbox of (co)homological methods in computational topology by applying the concept of persistence to sheaf cohomology. Since sheaves (of modules) combine topological information with algebraic information, they allow for…

Our objective in this article is to show a possibly interesting structure of homotopic nature appearing in persistent (co)homology. Assuming that the filtration of the (say) simplicial set embedded in a finite dimensional vector space…