Persistent Stanley--Reisner Theory
Faisal Suwayyid, Guo-Wei Wei
TL;DR
This work introduces persistent Stanley-Reisner theory (PSRT), extending classical Stanley-Reisner algebra to filtrations and defining persistent invariants such as $\beta_{i,i+j}^{t,t'}$, $h_m^{t,t'}$, and $f_{m-1}^{t,t'}$, along with persistent facet ideals and facet persistence modules. By extending Hochster's formula to the filtration setting, PSRT links algebraic invariants to persistence across scales, yielding facet persistence barcodes that track births and deaths of facet primes. The authors prove stability results ensuring small changes in the filtration induce small changes in the facet persistence diagrams, mirroring robustness in persistent homology. They validate the approach on molecular data, demonstrating discrimination of isomeric structures and high-accuracy classification of metal halide perovskites using purely geometric information, outperforming baseline persistent Betti-number methods.
Abstract
Topological data analysis (TDA) has emerged as an effective approach in data science, with its key technique, persistent homology, rooted in algebraic topology. Although alternative approaches based on differential topology, geometric topology, and combinatorial Laplacians have been proposed, combinatorial commutative algebra has hardly been developed for machine learning and data science. In this work, we introduce persistent Stanley-Reisner theory to bridge commutative algebra, combinatorial algebraic topology, machine learning, and data science. We propose persistent h-vectors, persistent f-vectors, persistent graded Betti numbers, persistent facet ideals, and facet persistence modules. Stability analysis indicates that these algebraic invariants are stable against geometric perturbations. We employ a machine learning prediction on a molecular dataset to demonstrate the utility of the proposed persistent Stanley-Reisner theory for practical applications.
