An algorithm for computing homology groups (Q1368032): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: T. W. Hungerford / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: T. W. Hungerford / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jabr.1996.7008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2068303346 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Homology of Associative Algebras / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4143495 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4012139 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3358944 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complete rewriting systems and homology of monoid algebras / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Word problems and a homological finiteness condition for monoids / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:03, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for computing homology groups |
scientific article |
Statements
An algorithm for computing homology groups (English)
0 references
23 September 1998
0 references
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.
0 references
\(\mathbb{Z} G\)-modules
0 references
finite rewriting systems
0 references
free resolutions
0 references
algorithms
0 references
computations of differentials
0 references
