Homology computation by reduction of chain complexes

DOI10.1016/S0898-1221(97)00289-7zbMath0904.55004OpenAlexW2132458980WikidataQ127908202 ScholiaQ127908202MaRDI QIDQ1129483

Maciej Ślusarek, Tomasz Kaczynski, Marian Mrozek

Publication date: 19 January 1999

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(97)00289-7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Homology and cohomology theories in algebraic topology (55N99) Chain complexes in algebraic topology (55U15)

Related Items

Allowing cycles in discrete Morse theory, Čech type approach to computing homology of maps, Homological spanning forest framework for 2D image analysis, Efficient Construction of 2-Chains with a Prescribed Boundary, Discrete Morse theoretic algorithms for computing homology of complexes and maps, Computing cup products in \(\mathbb{Z}_2\)-cohomology of 3D polyhedral complexes, Computing Connection Matrices via Persistence-Like Reductions, Coreduction homology algorithm for inclusions and persistent homology, Coreduction homology algorithm for regular CW-complexes, Homology in electromagnetic boundary value problems, A novel technique for cohomology computations in engineering practice, Acyclic partial matchings for multidimensional persistence: algorithm and combinatorial interpretation, Automatic generation of cuts on large-sized meshes for the \(T-\Omega \) geometric eddy-current formulation, Homology algorithm based on acyclic subspace, Chaos in the Lorenz equations: A computer assisted proof. III: Classical parameter values, Computation of cubical homology, cohomology, and (co)homological operations via chain contraction, Execution spaces for simple higher dimensional automata, Simplicial models of trace spaces, An algorithmic approach to the construction of homomorphisms induced by maps in homology, Coreduction homology algorithm, Reducing complexes in multidimensional persistent homology theory, Parallel Homology Computation of Meshes, Computing Homology: A Global Reduction Approach, Measuring and computing natural generators for homology groups, Generating cubical complexes from image data and computation of the Euler number, Computing fundamental groups from point clouds, Homology of cellular structures allowing multi-incidence

Cites Work

• An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
• Homology of Noetherian rings and local rings
• Minimal resolutions and other minimal models
• 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
• Chaos in the Lorenz equations: a computer-assisted proof
• Tate resolutions for commutative graded algebras over a local ring
• Chaos in the Lorenz equations: A computer assisted proof. III: Classical parameter values
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item