Related papers: Cup Product Persistence and Its Efficient Computat…

The theory of persistence, which arises from topological data analysis, has been intensively studied in the one-parameter case both theoretically and in its applications. However, its extension to the multi-parameter case raises numerous…

We use rewriting systems to spell out cup-products in the (twisted) cohomology groups of a product of surface groups. This allows us to detect a non-trivial obstruction bounding from below the effective topological complexity of an…

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…

We present algorithms to compute the vector space of homomorphisms Hom(X,Y) between finitely generated representations of the partially ordered set Z^d. Our results generalise to any partially ordered set. Our main theoretical contribution…

We reformulate the persistent (co)homology of simplicial filtrations, viewed from a more algebraic setting, namely as the (co)homology of a chain complex of graded modules over polynomial ring $K[t]$. We also define persistent (co)homology…

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…

We compute cup product pairings in the integral cohomology ring of the moduli space of rank two stable bundles with odd determinant over a Riemann surface using methods of Zagier. The resulting formula is related to a generating function…

We define and study several new interleaving distances for persistent cohomology which take into account the algebraic structures of the cohomology of a space, for instance the cup product or the action of the Steenrod algebra. In…

Persistent homology provides information about the lifetime of homology classes along a filtration of cell complexes. Persistence barcode is a graphical representation of such information. A filtration might be determined by time in a set…

Suppose $k$ is a finite field, that $C$ is a smooth projective geometrically irreducible curve over $k$, and that $n$ is a positive integer not divisible by the characteristic of $k$. In this paper we compute cup products of elements of the…

The theory of multidimensional persistent homology was initially developed in the discrete setting, and involved the study of simplicial complexes filtered through an ordering of the simplices. Later, stability properties of…

In this article, we give some conditions on the structure of an unstable module, which are satisfied whenever this module is the reduced cohomology of a space or a spectrum. First, we study the structure of the sub-modules of…

Computational topology provides a tool, persistent homology, to extract quantitative descriptors from structured objects (images, graphs, point clouds, etc). These descriptors can then be involved in optimization problems, typically as a…

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…

Let K be the product O(n_1) x O(n_2) x ... x O(n_r) of orthogonal groups. Let V the r-fold tensor product of defining representations of each orthogonal factor. We compute a stable formula for the dimension of the K-invariant algebra of…

In persistent homology analysis, interval modules play a central role in describing the birth and death of topological features across a filtration. In this work, we extend this setting, and propose the use of bipath persistent homology,…

In this work, we study several variants of matrix reduction via Gaussian elimination that try to keep the reduced matrix sparse. The motivation comes from the growing field of topological data analysis where matrix reduction is the major…

0-dimensional persistent homology is known, from a computational point of view, as the easy case. Indeed, given a list of $n$ edges in non-decreasing order of filtration value, one only needs a union-find data structure to keep track of the…

We introduce and study A-infinity persistence of a given homology filtration of topological spaces. This is a family, one for each n > 0, of homological invariants which provide information not readily available by the (persistent) Betti…

Zigzag persistent homology is a powerful generalisation of persistent homology that allows one not only to compute persistence diagrams with less noise and using less memory, but also to use persistence in new fields of application.…