Noncommutative linear rewriting: applications and generalizations
Résumé
These notes were intended for a lecture given at the Kobe summer school in July 2015. We present the notion of polygraphic presentation for algebras and their properties of confluence and termination, as introduced in [GHM17]. These presentations, called linear polygraphs, are rewriting systems that generalize noncommutative Gröbner bases, as studied by Bokut, [Bok76], Bergman, [Ber78], and Mora, [Mor94], in the sense that the orientation of the rewriting rules does not depend of a monomial order. We give a description of an algorithm given by Anick, [Ani86], for computing a free resolution of right modules over an algebra presented by a noncommutative Gröbner basis. Finally, we briefly sketch a method to compute polygraphic resolutions for an algebra presented by a confluent and terminating linear polygraph introduced in [GHM17].
Domaines
Anneaux et algèbres [math.RA]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...