An algorithmic approach to resolutions (Q2466869): Difference between revisions

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.