Papers
Topics
Authors
Recent
Search
2000 character limit reached

Saecular persistence

Published 9 Dec 2021 in math.CT and math.AT | (2112.04927v2)

Abstract: A persistence module is a functor $f: \mathbf{I} \to \mathsf{E}$, where $\mathbf{I}$ is the poset category of a totally ordered set. This work introduces saecular decomposition: a categorically natural method to decompose $f$ into simple parts, called interval modules. Saecular decomposition exists under generic conditions, e.g., when $\mathbf{I}$ is well ordered and $\mathsf{E}$ is a category of modules or groups. This represents a substantial generalization of existing factorizations of 1-parameter persistence modules, leading to, among other things, persistence diagrams not only in homology, but in homotopy. Applications of saecular decomposition include inverse and extension problems involving filtered topological spaces, the 1-parameter generalized persistence diagram, and the Leray-Serre spectral sequence. Several examples -- including cycle representatives for generalized barcodes -- hold special significance for scientific applications. The key tools in this approach are modular and distributive order lattices, combined with Puppe exact categories.

Citations (5)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.