Interleavings and Matchings as Representations

In order to better understand and to compare interleavings between persistence modules, we elaborate on the algebraic structure of interleavings in general settings. In particular, we provide a representation-theoretic framework for interleavings, showing that the category of interleavings under a fixed translation is isomorphic to the representation category of what we call a shoelace. Using our framework, we show that any two interleavings of the same pair of persistence modules are themselves interleaved. Furthermore, in the special case of persistence modules over $\mathbb{Z}$, we show that matchings between barcodes correspond to the interval-decomposable interleavings.

No reviews yet.

No comments yet.