Related papers: Local Equivalence of Metrics for Multiparameter Pe…

Dey and Xin (J.Appl.Comput.Top., 2022, arXiv:1904.03766) describe an algorithm to decompose finitely presented multiparameter persistence modules using a matrix reduction algorithm. Their algorithm only works for modules whose generators…

In this paper we introduce the persistent magnitude, a new numerical invariant of (sufficiently nice) graded persistence modules. It is a weighted and signed count of the bars of the persistence module, in which a bar of the form $[a,b)$ in…

In this paper, we study pointwise finite-dimensional (p.f.d.) $2$-parameter persistence modules where each module admits a finite convex isotopy subdivision. We show that a p.f.d. $2$-parameter persistence module $M$ (with a finite convex…

We define a class of multiparameter persistence modules that arise from a one-parameter family of functions on a topological space and prove that these persistence modules are stable. We show that this construction can produce…

We study circle valued maps and consider the persistence of the homology of their fibers. The outcome is a finite collection of computable invariants which answer the basic questions on persistence and in addition encode the topology of the…

This short note establishes explicit and broadly applicable relationships between persistence-based distances computed locally and globally. In particular, we show that the bottleneck distance between two zigzag persistence modules…

Around 1960, R. Palais and J. Cerf proved a fundamental result relating spaces of diffeomorphisms and imbeddings of manifolds: If V is a submanifold of M, then the map from Diff(M) to Imb(V,M) that takes f to its restriction to V is locally…

The fibered barcode $\mathcal{F}(M)$ of a bipersistence module $M$ is the map sending each non-negatively sloped affine line $\ell \subset \mathbb{R}^2$ to the barcode of the restriction of $M$ along $\ell$. The simplicity, computability,…

Multiparameter persistence modules come up naturally in topological data analysis and topological robotics. Given a metric graph $(X,\delta)$, the second configuration space of $(X,\delta)$ with proximity parameters (for example, the…

We consider the family $\mathrm{MP}_d$ of affine conjugacy classes of polynomial maps of one complex variable with degree $d \geq 2$, and study the map $\Phi_d:\mathrm{MP}_d\to \widetilde{\Lambda}_d \subset \mathbb{C}^d / \mathfrak{S}_d$…

In this paper, we introduce code distances, a new family of invariants for linear codes. We establish some properties and prove bounds on the code distances, and show that they are not invariants of the matroid (for a linear block code) or…

It is well-known that the cohomology ring has a richer structure than homology groups. However, until recently, the use of cohomology in persistence setting has been limited to speeding up of barcode computations. Some of the recently…

We use persistence modules and their corresponding barcodes to quantitatively distinguish between different fiberwise star-shaped domains in the cotangent bundle of a fixed manifold. The distance between two fiberwise star-shaped domains is…

The exact computation of the matching distance for multi-parameter persistence modules is an active area of research in computational topology. Achieving an easily obtainable exact computation of this distance would permit multi-parameter…

The classical Reed-Muller codes over a finite field $\mathbb{F}_q$ are based on evaluations of $m$-variate polynomials of degree at most $d$ over a product set $U^m$, for some $d$ less than $|U|$. Because of their good distance properties,…

In 2009, Chazal et al. introduced $\epsilon$-interleavings of persistence modules. $\epsilon$-interleavings induce a pseudometric $d_I$ on (isomorphism classes of) persistence modules, the interleaving distance. The definitions of…

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…

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…

In multi-parameter persistence, the matching distance is defined as the supremum of weighted bottleneck distances on the barcodes given by the restriction of persistence modules to lines with a positive slope. In the case of finitely…

This paper introduces a novel approach to multi-parameter persistence using 2-categorical structures. We develop a framework that captures hierarchical interactions between filter parameters, overcoming fundamental limitations of…