An algorithm for computing homology groups

DOI10.1006/JABR.1996.7008MaRDI QIDQ1368032zbMATH OpenOpenAlexFDO

Authors J. R. J. Groves

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

zbMATH Keywords

\(\mathbb{Z} G\)-modulesalgorithmscomputations of differentialsfinite rewriting systemsfree resolutions

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Generators, relations, and presentations of groups (20F05) Homological methods in group theory (20J05) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42)

Review text

In a previous article [in Proc. Canberra Group Theory Conf. 1989, Lect. Notes Math. 1456, 114-141 (1990; Zbl 0732.20032)]\ the author described a procedure which, for a finite rewriting system of a group \(G\), or even a monoid, yields a free resolution of \(\mathbb{Z}\) by \(\mathbb{Z} G\)-modules. A problem with that and similar constructions is the difficulty of explicitly computing the differential of the resolution. In this paper, the author presents an algorithm for computing the differentials in that resolution.

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; zbMATH DE number 2186251

Cites work

• Complete rewriting systems and homology of monoid algebras
• scientific article; zbMATH DE number 4210420 (Why is no real title available?)
• scientific article; zbMATH DE number 67429 (Why is no real title available?)
• scientific article; zbMATH DE number 3572386 (Why is no real title available?)
• On the Homology of Associative Algebras
• Word problems and a homological finiteness condition for monoids

Cited in

(17)

• An algorithm for the number of path homomorphisms
• Homology of Gaussian groups.
• Universal covers of finite groups
• An algorithm for low dimensional group homology.
• Efficient algorithms for computing a minimal homology basis
• Computing group resolutions.
• scientific article; zbMATH DE number 1618183 (Why is no real title available?)
• scientific article; zbMATH DE number 2186251 (Why is no real title available?)
• scientific article; zbMATH DE number 3864097 (Why is no real title available?)
• Computing Homology: A Global Reduction Approach
• scientific article; zbMATH DE number 3905449 (Why is no real title available?)
• Algorithmic Recognition of Actions of 2-Homogeneous Groups on Pairs
• Three-Dimensional Presentations for the Groups of Order at Most 30
• scientific article; zbMATH DE number 848081 (Why is no real title available?)
• On a simple method of determining the homology and the cohomology of finitely presented groups.
• A Mathematica notebook for computing the homology of iterated products of groups.
• scientific article; zbMATH DE number 3106555 (Why is no real title available?)

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)