RedZeD: Computing persistent homology by Reduction to Zero Differentials
arXiv:2606.06310
Abstract
We introduce a new algorithm for computing persistent homology of Vietoris--Rips filtrations, which in many cases offers a considerable improvement both in terms of time and memory over the existing implementations of the persistence pairing algorithm. The key innovation, called active enumeration, is made possible by a new theoretical framework of Reduction to Zero Differentials (hence RedZeD) in which to view persistent homology.
34 pages; comments welcome