Comparing Gröbner-Shirshov bases and word reversing.

zbMATH Open1202.20061arXiv0712.0525MaRDI QIDQ600397FDOQ600397

Authors: Marc Autord 

Publication date: 5 November 2010

Published in: Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0712.0525

Recommendations

• scientific article; zbMATH DE number 2030189
• A Gröbner-Shirshov basis over a special type of braid monoids
• A note on the Gröbner-Shirshov bases over ad-hoc extensions of groups
• Gröbner-Shirshov bases. Normal forms, combinatorial and decision problems in algebra
• Gröbner-Shirshov bases of some monoids.

zbMATH Keywords

relationsword problemsemigroup presentationsword reversingGröbner-Shirshov bases

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Grammars and rewriting systems (68Q42) Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05)

Cited In (3)

• On completeness of word reversing
• GRÖBNER–SHIRSHOV BASIS FOR THE CHINESE MONOID
• The subword reversing method.

This page was built for publication: Comparing Gröbner-Shirshov bases and word reversing.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q600397)