2000 character limit reached
Generalized Persistence Diagrams
Published 13 Jan 2016 in math.AT | (1601.03107v5)
Abstract: We generalize the persistence diagram of Cohen-Steiner, Edelsbrunner, and Harer to the setting of constructible persistence modules valued in a symmetric monoidal category. We call this the type A persistence diagram of a persistence module. If the category is also abelian, then we define a second type B persistence diagram. In addition, we show that both diagrams are stable to all sufficiently small perturbations of the module.
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.