An algorithm for computing homology groups
DOI10.1006/JABR.1996.7008zbMATH Open0895.20043OpenAlexW2068303346MaRDI QIDQ1368032FDOQ1368032
Publication date: 23 September 1998
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jabr.1996.7008
Recommendations
- An algorithm computing homotopy groups.
- Discrete Geometry for Computer Imagery
- scientific article; zbMATH DE number 3106555
- scientific article; zbMATH DE number 704014
- An algorithm for low dimensional group homology.
- Computing the homology of groups: the geometric way.
- Computing homology
- An algorithm for computing some Heegaard Floer homologies
- scientific article
algorithmsfree resolutionsfinite rewriting systems\(\mathbb{Z} G\)-modulescomputations of differentials
Generators, relations, and presentations of groups (20F05) Homological methods in group theory (20J05) Grammars and rewriting systems (68Q42) Software, source code, etc. for problems pertaining to group theory (20-04) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
Cited In (15)
- Algorithmic Recognition of Actions of 2-Homogeneous Groups on Pairs
- Efficient algorithms for computing a minimal homology basis
- Homology of Gaussian groups.
- Universal covers of finite groups
- Computing Homology: A Global Reduction Approach
- An algorithm for the number of path homomorphisms
- An algorithm for low dimensional group homology.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Three-Dimensional Presentations for the Groups of Order at Most 30
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing group resolutions.
This page was built for publication: An algorithm for computing homology groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1368032)