Computing homology

DOI10.4310/HHA.2003.v5.n2.a8zbMath1028.55001MaRDI QIDQ1397805

Konstantin Mischaikow, Marian Mrozek, Tomasz Kaczynski

Publication date: 13 January 2004

Published in: Homology, Homotopy and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/50484

zbMATH Keywords

representable setmultivalued mapcubical complexacyclic carrierhomology computation

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to algebraic topology (55-04) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Set-valued maps in general topology (54C60) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (13)

Digital homotopy relations and digital homology theories ⋮ Natural Homology ⋮ Equivalent conditions for digital covering maps ⋮ Čech type approach to computing homology of maps ⋮ Discrete Morse theoretic algorithms for computing homology of complexes and maps ⋮ Combinatorial approach to detection of fixed points, periodic orbits, and symbolic dynamics ⋮ Homology groups of cubical sets ⋮ Directed homology theories and Eilenberg-Steenrod axioms ⋮ Coreduction homology algorithm for regular CW-complexes ⋮ Difference forms ⋮ Digital topological method for computing genus and the Betti numbers ⋮ On the evolution of vector distance functions of closed curves ⋮ Discrete Versions of Stokes’ Theorem Based on Families of Weights on Hypercubes

This page was built for publication: Computing homology