Rewriting as a Special Case of Noncommutative Groebner Basis Theory

Simple item page
dc.creatorHeyworth, Anne
dc.date1999-01-11
dc.date.accessioned2026-07-07T05:27:31Z
dc.date.available2026-07-07T05:27:31Z
dc.descriptionRewriting 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.
dc.descriptionarticle, 4 pages, LaTeX2e
dc.identifierhttps://arxiv.org/abs/math/9901044
dc.identifierhttp://arxiv.org/abs/math/9901044
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/77947
dc.subjectCombinatorics
dc.subject68Q42 (Primary) 16S15; 68Q40 (Secondary)
dc.titleRewriting as a Special Case of Noncommutative Groebner Basis Theory
dc.typetext

Files

Collections

arXiv