Computing simplicial homology based on efficient Smith normal form algorithms
Geometric properties of topological spaces are conveniently expressed by algebraic invariants of the space. This paper focuses on methods for the computer calculation of the homology of finite simplicial complexes and its applications. The calculation of homology with integer coefficients of a simplicial complex reduces to the calculation of the Smith Normal Form of the boundary matrices which, in general, are sparse. First, the authors provide a review of several algorithms for the calculation of the Smith Normal Form of sparse matrices and compare their running times for actual boundary matrices, then they describe alternative approaches to the calculation of simplicial homology. In the last section they present motivating examples and actual experiments with the GAP package (implemented by the authors). There is an example with calculations of Lie algebra homology. For the entire collection see [Zbl 1008.00013].
- Coreduction homology algorithm
- Lower bounds for three algorithms for transversal hypergraph generation
- Simploidal sets: a data structure for handling simploidal Bézier spaces
- Non total-unimodularity neutralized simplicial complexes
- Frontiers of sphere recognition in practice
- Algorithmic canonical stratifications of simplicial complexes
- Local computation of homology variations over a construction process
- Discrete Morse theory for weighted simplicial complexes
- Efficient algorithms for computing a minimal homology basis
- A topological measurement of protein compressibility
- Reconstructing functions from random samples
- Complexes of discrete Morse functions
- (Co)homology of Lie algebras via algebraic Morse theory
- Topology and data
- Border operator for generalized maps
- Morse theory for filtrations and efficient computation of persistent homology
- Discrete Morse theoretic algorithms for computing homology of complexes and maps
- Monomial resolutions for efficient computation of simplicial homology
- \textsf{simpcomp} -- a GAP toolbox for simplicial complexes
- \(C^{\star}\)-algebras of higher-rank graphs from groups acting on buildings, and explicit computation of their \(K\)-theory
- scientific article; zbMATH DE number 7800538 (Why is no real title available?)
- Coreduction homology algorithm for inclusions and persistent homology
- Coreduction homology algorithm for regular CW-complexes
- Explainable AI for chest CT image recognition using topological data analysis
- On the average-case complexity of Berge algorithm
- A new approach to crushing 3-manifold triangulations
- Reverse search for monomial ideals
- Sheafhom: software for sparse integer matrices
- Homology algorithm based on acyclic subspace
This page was built for publication: Computing simplicial homology based on efficient Smith normal form algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418129)
