Comparing Gröbner bases and word reversingReport as inadecuate

Comparing Gröbner bases and word reversing - Download this document for free, or read online. Document in PDF available to download.

1 LMNO - Laboratoire de Mathématiques Nicolas Oresme

Abstract : Gröbner bases, in their noncommutative version, and word reversing are methods for solving the word problem of a presented monoid, and both rely on iteratively completing the initial list of relations. Simple examples may suggest to conjecture that both completion procedures are closely related. Here we disprove this conjecture by exhibiting families of presentations for which they radically differ.

Keywords : Gröbner bases word reversing monoid completion completeness

Author: Marc Autord -



Related documents