Anne Heyworth
Published 1999-01-11Version 1
Rewriting for semigroups is a special case of Groebner basis theory for noncommutative polynomial algebras. The fact is a kind of folklore but is not fully recognised. The aim of this paper is to elucidate this relationship, showing that the noncommutative Buchberger algorithm corresponds step-by-step to the Knuth-Bendix completion procedure.
Comments: article, 4 pages, LaTeX2e
A special case of sl(n)-fusion coefficients
A Characterization On Potentially $K_{2,5}$-graphic Sequences
A formula for the number of tilings of an octagon by rhombi
![QR code for arXiv:math/9901044 [math.CO]](http://oss.arxitics.com/images/favicon.svg)