pith. sign in

arxiv: 1812.05031 · v3 · pith:QW7RT4SSnew · submitted 2018-12-12 · 🧮 math.AT

Persistence Steenrod modules

classification 🧮 math.AT
keywords cohomologycomputationsteenrodadvancesalgorithmicapplicabilitybarcodebarcodes
0
0 comments X
read the original abstract

It has long been envisioned that the strength of the barcode invariant of filtered cellular complexes could be increased using cohomology operations. Leveraging recent advances in the computation of Steenrod squares, we introduce a new family of computable invariants on mod 2 persistent cohomology termed $Sq^k$-barcodes. We present a complete algorithmic pipeline for their computation and illustrate their real-world applicability using the space of conformations of the cyclo-octane molecule.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.