论文信息 - Complete rewriting systems and homology of monoid algebras

Complete rewriting systems and homology of monoid algebras

Abstract Let A be a monoid algebra presented by a complete rewriting system R over an alphabet Σ and let S be a right rewriting system over Σ which is complete over R . We give an effective way to construct a free resolution of the right A -module associated with S . As an application an upper bound of the global dimension of A is given.

Yuji Kobayashi | Yuji Kobayashi

[1] Paliath Narendran,et al. The Knuth-Bendix Completion Procedure and Thue Systems , 1985, SIAM J. Comput..

[2] Friedrich Otto,et al. Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems , 1987, RTA.

[3] Craig C. Squier,et al. Word problems and a homological niteness condition for monoids , 1987 .

[4] Paliath Narendran,et al. A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System , 1985, Theor. Comput. Sci..

[5] D. Anick,et al. On the homology of associative algebras , 1986 .