An algorithm for computing homology groups

DOI10.1006/jabr.1996.7008zbMath0895.20043OpenAlexW2068303346MaRDI QIDQ1368032

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

algorithmsfree resolutionsfinite rewriting systems\(\mathbb{Z} G\)-modulescomputations of differentials

Mathematics Subject Classification ID

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) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (3)

Three-Dimensional Presentations for the Groups of Order at Most 30 ⋮ Computing group resolutions. ⋮ Universal covers of finite groups

Cites Work

• Complete rewriting systems and homology of monoid algebras
• Word problems and a homological finiteness condition for monoids
• On the Homology of Associative Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for computing homology groups