An algorithmic approach to resolutions (Q2466869)
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 5227414
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithmic approach to resolutions |
scientific article; zbMATH DE number 5227414 |
Statements
An algorithmic approach to resolutions (English)
0 references
16 January 2008
0 references
Let \(k\) be a field and \(Q\) be a finite quiver (i.e. a finite directed graph). The path algebra, \(kQ\), has a \(k\)--basis consisting of all the finite directed paths in \(Q\), and multiplication induced by concatenation of paths. An algorithmic method for constructing projective resolutions of modules over quotients of path algebras is given. The algorithm is modified to construct minimal projective resolutions of linear modules over Koszul algebras.
0 references
projective resolutions
0 references
quotients of path algebras
0 references
Koszul algebras
0 references
0.8754473328590393
0 references
0.8735372424125671
0 references
0.8457714915275574
0 references
0.8280574679374695
0 references
0.8271817564964294
0 references
