1 min read

Signed Barcodes for Multi-parameter Persistence via Rank Decompositions and Rank-Exact Resolutions

Signed Barcodes for Multi-parameter Persistence via Rank Decompositions and Rank-Exact Resolutions
Decomposing the ranks of the linear maps using geometric regions.

Magnus Bakke Botnan, Steffen Oppermann, Steve Oudot

In this paper, we introduce the signed barcode, a new visual representation of the global structure of the rank invariant of a multi-parameter persistence module or, more generally, of a poset representation. Like its unsigned counterpart in one-parameter persistence, the signed barcode decomposes the rank invariant as a \(\mathbb{Z}\)-linear combination of rank invariants of indicator modules supported on segments in the poset. We develop the theory behind these decompositions, both for the usual rank invariant and for its generalizations, showing under what conditions they exist and are unique. We also show that, like its unsigned counterpart, the signed barcode reflects in part the algebraic structure of the module: specifically, it derives from the terms in the minimal rank-exact resolution of the module, i.e., its minimal projective resolution relative to the class of short exact sequences on which the rank invariant is additive. To complete the picture, we show some experimental results that illustrate the contribution of the signed barcode in the exploration of multi-parameter persistence modules.

The paper is open access:

https://link.springer.com/article/10.1007/s10208-024-09672-9