Related papers: A continuum of K\"unneth theorems for persistence …
The Quillen-McCord theorem (aka Quillen fiber lemma) gives a sufficient condition on a map between classifying spaces of posetal categories to be a homotopy equivalence. Jonathan Ariel Barmak in his paper [arXiv:1005.0538] gives an…
This paper is a survey of persistent homology, primarily as it is used in topological data analysis. It includes the theory of persistence modules, as well as stability theorems for persistence barcodes, generalized persistence,…
A persistence module $M$, with coefficients in a field $\mathbb{F}$, is a finite-dimensional linear representation of an equioriented quiver of type $A_n$ or, equivalently, a graded module over the ring of polynomials $\mathbb{F}[x]$. It is…
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…
We use a map to quantum error-correcting codes and a subspace projection to get lower bounds for minimal homological distances in a tensor product of two chain complexes of vector spaces over a finite field. Homology groups of such a…
In this paper, we study the persistence and remaining regularity of KAM invariant torus under sufficiently small perturbations of a Hamiltonian function together with its derivatives, in sense of finite smoothness with modulus of…
We study the connection between the Baum-Connes conjecture for an ample groupoid $G$ with coefficient $A$ and the K\"unneth formula for the K-theory of tensor products by the crossed product $A\rtimes_r G$. To do so we develop the machinery…
Persistence modules are representations of products of totally ordered sets in the category of vector spaces. They appear naturally in the representation theory of algebras, but in recent years they have also found applications in other…
Persistent homology is a methodology central to topological data analysis that extracts and summarizes the topological features within a dataset as a persistence diagram; it has recently gained much popularity from its myriad successful…
In this work, we present a generalization of extended persistent homology to filtrations of graded sub-groups by defining relative homology in this setting. Our work provides a more comprehensive and flexible approach to get an algebraic…
In the theory of persistent homology, a well known duality relates the barcodes of the absolute homology and relative cohomology of a one-parameter simplicial filtration. Motivated by the problem of computing free presentations of the…
We provide a fairly self-contained account of the localisation and cofinality theorems for the algebraic $\mathrm{K}$-theory of stable $\infty$-categories. It is based on a general formula for the evaluation of an additive functor on a…
Biological and physical systems often exhibit distinct structures at different spatial/temporal scales. Persistent homology is an algebraic tool that provides a mathematical framework for analyzing the multi-scale structures frequently…
We prove a generalization of the fundamental theorem of algebraic K-theory for Verdier-localizing functors by extending the proof for algebraic K-theory of spaces to the realm of stable $\infty$-categories. The formula behaves much better…
We construct a K-theory version of Bhatt-Morrow-Scholze's Breuil-Kisin cohomology theory for $\sO_K$-linear idempotent-complete, small smooth proper stable infinity-categories, where $K$ is a discretely valued extension of $\Q_p$ with…
Persistent homology enables fast and computable comparison of topological objects. However, it is naturally limited to the analysis of topological spaces. We extend the theory of persistence, by guaranteeing robustness and computability to…
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…
This article introduces an algorithm to compute the persistent homology of a filtered complex with various coefficient fields in a single matrix reduction. The algorithm is output-sensitive in the total number of distinct persistent…
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…
A famous theorem of Nakaoka asserts that the cohomology of the symmetric group stabilizes. The first author generalized this theorem to non-trivial coefficient systems, in the form of $\mathrm{FI}$-modules over a field, though one now…