Persistence Partial Matchings Induced by Morphisms between Persistence Modules

07/09/2021 ∙ by R. Gonzalez-Diaz, et al. ∙ 0

The notion of persistence partial matching, as a generalization of partial matchings between persistence modules, is introduced. We study how to obtain a persistence partial matching 𝒢_f, and a partial matching ℳ_f, induced by a morphism f between persistence modules, both being linear with respect to direct sums of morphisms. Some of their properties are also provided, including their stability after a perturbation of the morphism f, and their relationship with other induced partial matchings already defined in TDA.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.