Abstract
AbstractIt 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$$Sqk-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.
Funder
Innosuisse - Schweizerische Agentur für Innovationsförderung
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Geometry and Topology
Reference42 articles.
1. Adams, J.F.: Stable homotopy and generalised homology. Chicago Lectures in Mathematics. University of Chicago Press, Chicago (1974)
2. Adem, J.: The iteration of the Steenrod squares in algebraic topology. In: Proceedings of the National Academy of Sciences of the United States of America 38 (1952)
3. Adams, H., Moy, M.: Topology applied to machine learning: from global to local. Front Artif Intell 4 (2021)
4. Bauer, U. et al.: PHAT—persistent homology algorithms toolbox. In: Hong, H., Yap, C.: Mathematical Software—ICMS 2014. Springer, Berlin (2014)
5. Bauer, U.: “Ripser: eficient computation of Vietoris-Rips persistence barcodes”. J. Appl. Comput. Topol. 5.3 (2021)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Cellular approximations to the diagonal map;Mathematics of Computation;2024-05-28
2. Persistent cup product structures and related invariants;Journal of Applied and Computational Topology;2023-10-07