𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complete rewriting systems and homology of monoid algebras

✍ Scribed by Yuji Kobayashi

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
858 KB
Volume
65
Category
Article
ISSN
0022-4049

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hecke Algebras and Semisimplicity of Mon
Hecke Algebras and Semisimplicity of Monoid Algebras
✍ Mohan S Putcha 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 140 KB

We begin by constructing Hecke algebras for arbitrary finite regular monoids M. We then show that the semisimplicity of the complex monoid algebra ‫ރ‬ M is equivalent to the semisimplicity of the associated Hecke algebras and a condition on induced group characters. We apply these results to finite

Infinite Convergent String-rewriting Sys
Infinite Convergent String-rewriting Systems and Cross-sections for Finitely Presented Monoids
✍ F. OTTO; M. KATSURA; Y. KOBAYASHI 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 635 KB

A finitely presented monoid has a decidable word problem if and only if it can be presented by some left-recursive convergent string-rewriting system if and only if it has a recursive cross-section. However, regular cross-sections or even context-free cross-sections do not suffice. This is shown by

G-Dimension, Complete Intersection Dimen
G-Dimension, Complete Intersection Dimension, Complexity, and Relative Homological Algebra
✍ Alex Martsinkovsky 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 112 KB

It is shown that the G-dimension and the complete intersection dimension are relative projective dimensions. Relative Auslander-Buchsbaum formulas are discussed. New cohomology theories, called complexity cohomology, are constructed. The new theories play the same role in identifying rings (and modu