A Gröbner-Shirshov basis over a special type of braid monoids (Q2129809)

The word, conjugacy and isomorphism problems (shortly decision problems) have played an important role in group theory since the work of M. Dehn in early 1900's. Among them, especially the word problem has been studied widely in groups (see [\textit{S. I. Adyan} and \textit{V. G. Durnev}, Russ. Math. Surv. 55, No. 2, 3--94 (2000; Zbl 0958.20029); translation from Usp. Mat. Nauk 55, No. 2, 3--94 (2000)]). It is well known that the word problem for finitely presented groups is not solvable in general; that is, given any two words obtained by generators of the group, there may not be an algorithm to decide whether these words represent the same element in this group. The method Gröbner-Shirshov basis theory gives a new algorithm to obtain normal forms of elements of groups, monoids and semigroups, and hence a new algorithm to solve the word problem in these algebraic structures (see also [\textit{F. L. Pritchard}, J. Symb. Comput. 22, No. 1, 27--48 (1996; Zbl 0954.16019)], for relationship with word problem for semigroups and ideal membership problem for non-commutative polynomail rings). By considering this fact, in this paper the authors find a Gröbner-Shirshov basis of the symmetric inverse monoid in terms of the dex-leg ordering on the related words of symmetric inverse monoids. Symmetric inverse monoids are partial bijections and they are very well known in combinatorics. The aim of this paper is to present a Gröbner-Shirshov basis for a special type of braid monoids, namely the symmetric inverse monoid In, in terms of the dex-leg ordering on the related elements of monoid. By taking into account the Gröbner-Shirshov basis, the ideal form (or, equivalently, the normal form structure) of this important monoid will be obtained. This ideal form will give us the solution of the word problem. At the final part of this paper, they give an application of the main result which find out a Gröbner-Shirshov basis for the symmetric inverse monoid \(I_4\) such that the accuracy and efficiency of this example can be seen by GBNP package in GAP (Group, Algorithms and Programming) which computes Gröbner bases of non-commutative polynomials [\textit{A. M. Cohen} and \textit{J. W. Knopper}, Computing Gröbner bases of noncommutative polynomials. GBNP (version 1.0.3) (2016), \url{https://www.gap-system.org/Packages/gbnp.htm}].