اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGroebner-Shirshov Basis for the Chinese Monoid
129
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, a Groebner-Shirshov basis for the Chinese monoid is obtained and an algorithm for the normal form of the Chinese monoid is given.
قيم البحث
اقرأ أيضاً
We found Groebner-Shirshov basis for the braid semigroup $B^+_{n+1}$. It gives a new algorithm for the solution of the word problem for the braid semigroup and so for the braid group.
In this paper, we give a Groebner-Shirshov basis of the braid group $B_{n+1}$ in the Artin--Garside generators. As results, we obtain a new algorithm for getting the Garside normal form, and a new proof that the braid semigroup $B^+{n+1}$ is the subsemigroup in $B_{n+1}$.
In this paper, we generalize the Shirshovs Composition Lemma by replacing the monomial order for others. By using Groebner-Shirshov bases, the normal forms of HNN extension of a group and the alternating group are obtained.
In this paper, we obtain Groebner-Shirshov (non-commutative Grobner) bases for the braid groups in the Birman-Ko-Lee generators enriched by new ``Garside word $delta$. It gives a new algorithm for getting the Birman-Ko-Lee Normal Form in the braid gr
oups, and thus a new algorithm for solving the word problem in these groups.
A new construction of a free inverse semigroup was obtained by Poliakova and Schein in 2005. Based on their result, we find a Groebner-Shirshov basis of a free inverse semigroup relative to the deg-lex order of words. In particular, we give the (uniq
ue and shortest) Groebner-Shirshov normal forms in the classes of equivalent words of a free inverse semigroup together with the Groebner-Shirshov algorithm to transform any word to its normal form.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
