Homology computation by reduction of chain complexes
The authors present an algorithm for computation of homology for a finitely generated free chain complex with a coefficient ring \({\mathcal R}\). The algorithm is based on successive reductions of the given chain complex to a homotopically equivalent, but much simpler complex. The method of this reduction relies on simple combinatorics. In case \({\mathcal R}\) a field, the final complex has zero differentials and therefore gives homology immediately. The method makes it also possible to compute the induced map \(f_*\) on homology, where \(f\) is a chain map. The complexity of the algorithm is also discussed. The authors are able to estimate the complexity in several special cases, obtaining linear running time for a planar polyhedron.
- An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
- Chaos in the Lorenz equations: A computer assisted proof. III: Classical parameter values
- Chaos in the Lorenz equations: a computer-assisted proof
- Homology of Noetherian rings and local rings
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 3371258 (Why is no real title available?)
- scientific article; zbMATH DE number 3411897 (Why is no real title available?)
- Minimal resolutions and other minimal models
- Tate resolutions for commutative graded algebras over a local ring
- Theorems for a price: Tomorrow's semi-rigorous mathematical culture
- Topological invariants, multivalued maps and computer assisted proofs in dynamics
- Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
- Coreduction homology algorithm
- Measuring and computing natural generators for homology groups
- Acyclic partial matchings for multidimensional persistence: algorithm and combinatorial interpretation
- Generating cubical complexes from image data and computation of the Euler number
- Homological spanning forest framework for 2D image analysis
- \(\mathbb{Z}_2\)-homology of weak \((p-2)\)-faceless \(p\)-pseudomanifolds may be computed in \(O(n)\) time
- Homology in electromagnetic boundary value problems
- Computation of cubical homology, cohomology, and (co)homological operations via chain contraction
- Computing fundamental groups from point clouds
- Homology of cellular structures allowing multi-incidence
- Allowing cycles in discrete Morse theory
- Polynomial-time homology for simplicial Eilenberg-MacLane spaces
- Parallel homology computation of meshes
- Homology computations via acyclic subspace
- Simplicial Perturbation Techniques and Effective Homology
- Computing Homology: A Global Reduction Approach
- Discrete Morse theoretic algorithms for computing homology of complexes and maps
- Computing cup products in \(\mathbb{Z}_2\)-cohomology of 3D polyhedral complexes
- scientific article; zbMATH DE number 2058536 (Why is no real title available?)
- A novel technique for cohomology computations in engineering practice
- An algorithmic approach to the construction of homomorphisms induced by maps in homology
- scientific article; zbMATH DE number 1441303 (Why is no real title available?)
- Monomial resolutions for efficient computation of simplicial homology
- Efficient Construction of 2-Chains with a Prescribed Boundary
- Chaos in the Lorenz equations: A computer assisted proof. III: Classical parameter values
- On modular homology in the Boolean algebra. III
- Algorithms in algebraic topology and homological algebra: the problem of complexity
- Čech type approach to computing homology of maps
- Computing Connection Matrices via Persistence-Like Reductions
- Coreduction homology algorithm for inclusions and persistent homology
- Coreduction homology algorithm for regular CW-complexes
- Automatic generation of cuts on large-sized meshes for the T- geometric eddy-current formulation
- Cellular approximations to the diagonal map
- Morse theoretic signal compression and reconstruction on chain complexes
- Tagged barcodes for the topological analysis of gradient-like vector fields
- On the support of Betti tables of multiparameter persistent homology modules
- Recursive coboundary formula for cycles in acyclic chain complexes
- Execution spaces for simple higher dimensional automata
- Reducing complexes in multidimensional persistent homology theory
- Homology algorithm based on acyclic subspace
- Simplicial models of trace spaces
This page was built for publication: Homology computation by reduction of chain complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129483)
