摘要
We generalize the concept -- dimension tree and the related results for monomial algebras to a more general case -- relations algebras A by bringing GrSbner basis into play. More precisely, we will describe the minimal projective resolution of a left A-module M as a rooted 'weighted' diagraph to be called the minimal resolution graph for M. Algorithms for computing such diagraphs and applications as well will be presented.
We generalize the concept -- dimension tree and the related results for monomial algebras to a more general case -- relations algebras A by bringing GrSbner basis into play. More precisely, we will describe the minimal projective resolution of a left A-module M as a rooted 'weighted' diagraph to be called the minimal resolution graph for M. Algorithms for computing such diagraphs and applications as well will be presented.