Discrete Morse Theory for Computing Filtered Cosheaf Homology
Abstract
This paper addresses the computation of persistent homology for filtrations of cellular cosheaves over a fixed cell complex, where the algebraic data vary along the filtration while the underlying topological structure remains unchanged. We extend methods from discrete Morse theory to this setting, establishing conditions under which chain complexes can be reduced while preserving the associated persistence module. Building on these results, we introduce "FilteredScythe", an algorithm that identifies Morse matchings compatible with all stages of the filtration and performs reductions using Schur complements, based on the exist "Scythe" algorithm. We prove the correctness of these reductions and establish bounds on the algorithm's time and space complexity.
Related
- Filtered lattice homology of curve singularities
- RedZeD: Computing persistent homology by Reduction to Zero Differentials
- Quasimonophobic graphs and degree spectral sequences in discrete cubical homology
- High Performance Computing of SDRE models with Discrete Kalman Filtering for Robust H∞-Controls
- Homology Nilpotency in Rational Homotopy Theory: Cell Attachments, Retractive Towers, Divergence, and Stabilization
BibTeX
@misc{baris2026discrete,
title = {{Discrete Morse Theory for Computing Filtered Cosheaf Homology}},
author = {Neria Baris},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.20376},
eprint = {2610.20376},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.20376},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Discrete Morse Theory for Computing Filtered Cosheaf Homology
AU - Neria Baris
PY - 2026
DA - 2026/10/14
PB - arXiv
DO - 10.48550/arxiv.2610.20376
UR - https://arxiv.org/abs/2610.20376
AB - This paper addresses the computation of persistent homology for filtrations of cellular cosheaves over a fixed cell complex, where the algebraic data vary along the filtration while the underlying topological structure remains unchanged. We extend methods from discrete Morse theory to this setting, establishing conditions under which chain complexes can be reduced while preserving the associated persistence module. Building on these results, we introduce "FilteredScythe", an algorithm that identifies Morse matchings compatible with all stages of the filtration and performs reductions using Schur complements, based on the exist "Scythe" algorithm. We prove the correctness of these reductions and establish bounds on the algorithm's time and space complexity.
ER -