An algorithmic approach to resolutions (Q2466869): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Macaulay2 / rank | |||
Normal rank | |||
Revision as of 00:23, 1 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithmic approach to resolutions |
scientific article |
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
