Polygraphic resolutions and homology of monoids (Q1008743)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5534965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polygraphic resolutions and homology of monoids |
scientific article; zbMATH DE number 5534965 |
Statements
Polygraphic resolutions and homology of monoids (English)
0 references
30 March 2009
0 references
The second author [\textit{F. Métayer}, ``Resolutions by polygraphs'', Theory Appl. Categ. 11, 148--184 (2003; Zbl 1020.18001)] defined homology using resolutions of \(\omega \)-categories via computads (polygraphs). The classical homology of a monoid \(M\) is defined in terms of resolutions of \(\mathbb{Z}\) by free \(\mathbb ZM\)-modules. The first author showed that the homologies coincide in the case where \(M\) is a group while the present paper proves the coincidence for a general monoid. An unfolding construction and path \(\omega \)-category are involved.
0 references
\(n\)-category
0 references
computad
0 references
resolution
0 references
acyclic
0 references
monoid
0 references
rewriting system
0 references
0 references
0.765673816204071
0 references
0.7592993974685669
0 references
0.7549434900283813
0 references
0.7240538597106934
0 references
