Comparing Gr\"obner bases and word reversing
Marc Autord (LMNO)

TL;DR
This paper compares noncommutative Gröbner bases and word reversing methods for solving the word problem in monoids, demonstrating that they can produce fundamentally different results on certain presentations.
Contribution
It provides the first clear distinction between Gröbner bases and word reversing by constructing examples where their completion procedures diverge significantly.
Findings
Gröbner bases and word reversing can yield different completions.
The two methods are not as closely related as previously conjectured.
Explicit examples show their fundamental differences.
Abstract
Gr\"obner 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · semigroups and automata theory · Commutative Algebra and Its Applications
