Collapsibility and homological properties of \(\mathfrak{I}\)-contractible transformations
DOI10.1007/s40590-022-00434-7zbMath1489.05163arXiv1808.07461OpenAlexW4280605457MaRDI QIDQ2141754
Jesús F. Espinoza, Héctor A. Hernández-Hernández, Martín Eduardo Frías-Armenta
Publication date: 25 May 2022
Published in: Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.07461
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85) Chain complexes in algebraic topology (55U15) Abstract complexes in algebraic topology (55U05) Combinatorial aspects of simplicial complexes (05E45)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ripser: efficient computation of Vietoris-Rips persistence barcodes
- Morse theory for filtrations and efficient computation of persistent homology
- Simplicial simple-homotopy of flag complexes in terms of graphs
- Convergence of iterated clique graphs
- Contractible transformations do not change the homology groups of graphs
- Some properties of contractible transformations on graphs
- Morse theory for cell complexes
- Computing persistent homology
- Vertex-to-vertex pursuit in a graph
- The worst way to collapse a simplex
- A counterexample on contractible transformations on graphs
- Practical graph isomorphism. II.
- Simplification of complexes for persistent homology computations
- Über iterierte Clique-Graphen
- On the dunce hat
- Topology and data
- Strong Collapse for Persistence
- Computing Persistent Homology of Flag Complexes via Strong Collapses
- $P$-persistent homology of finite topological spaces
- Barcodes: The persistent topology of data
- Combinatorial algebraic topology
- Graph homotopy and Graham homotopy
This page was built for publication: Collapsibility and homological properties of \(\mathfrak{I}\)-contractible transformations
