Additive Partial Matchings Induced by Persistence Morphisms (2006.11100v3)
Abstract: Given a morphism of persistence modules (a.k.a. persistence morphism) $f\colon V \rightarrow U$, we introduce a novel operator that determines a partial matching between the barcodes of $V$ and $U$ induced by $f$. We show that the proposed operator is additive with respect to the direct sum of persistence morphisms and contains more information than the image persistence module $f V$ and the rank invariant. We also illustrate some advantages of using our induced partial matching over the Bauer-Lesnick partial matching $\chi_f$. Lastly, we provide a family of persistence morphisms that contain modules built from Morse filtrations, for which $\chi_f$, $f V$, the rank invariant and our proposed induced partial matching are equivalent.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.