Comparing Gröbner bases and word reversing

Simple item page
dc.creatorAutord, Marc
dc.date2007-12-04
dc.date.accessioned2026-07-07T08:47:14Z
dc.date.available2026-07-07T08:47:14Z
dc.descriptionGrö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.
dc.identifierhttps://arxiv.org/abs/0712.0525
dc.identifierhttp://arxiv.org/abs/0712.0525
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143526
dc.subjectGroup Theory
dc.subject20M05, 68Q42
dc.titleComparing Gröbner bases and word reversing
dc.typetext

Files

Collections

arXiv