Möbius Homology

07/03/2023
by   Amit Patel, et al.
0

This paper introduces Möbius homology, a homology theory for representations of finite posets into abelian categories. While the connection between poset topology and Möbius functions is classical, we establish a direct connection between poset topology and Möbius inversions. More precisely, the Möbius homology categorifies the Möbius inversion because its Euler characteristic is equal to the Möbius inversion of the dimension function of the representation. We also introduce a homological version of Rota's Galois Connection Theorem which relates the Möbius homology over two posets connected by a Galois connection. Our main application is to persistent homology over general posets. We show that under one definition, the persistence diagram is an Euler characteristic over a poset of intervals and hence Möbius homology is a categorification of the persistence diagram. This provides a new invariant for persistent homology over general posets. Finally, we use our homological Rota's Galois Connection Theorem to prove several results about the persistence diagram.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/11/2022

Persistence Diagram Bundles: A Multidimensional Generalization of Vineyards

A persistence diagram (PD) summarizes the persistent homology of a filtr...
research
12/30/2022

Poincaré Duality for Generalized Persistence Diagrams of (co)Filtrations

We dualize previous work on generalized persistence diagrams for filtrat...
research
10/14/2020

Edit Distance and Persistence Diagrams Over Lattices

We build a functorial pipeline for persistent homology. The input to thi...
research
04/19/2022

Approximating Persistent Homology for Large Datasets

Persistent homology is an important methodology from topological data an...
research
11/15/2021

Hybrid transforms of constructible functions

We introduce a general definition of hybrid transforms for constructible...
research
12/07/2021

Output-sensitive Computation of Generalized Persistence Diagrams for 2-filtrations

When persistence diagrams are formalized as the Mobius inversion of the ...
research
03/05/2023

Computing Connection Matrices via Persistence-like Reductions

Connection matrices are a generalization of Morse boundary operators fro...

Please sign up or login with your details

Forgot password? Click here to reset