Groebner-Shirshov Basis for the Chinese Monoid
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
Yuqun Chen, Jianjun Qiu
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
继续探索
In this survey article, we report some new results of Groebner-Shirshov bases, including new Composition-Diamond lemmas, applications of some known Composition-Diamond lemmas and content of some expository papers.
In this paper, we generalize the Shirshov's 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.
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 (unique 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.
In this paper, we obtain Groebner-Shirshov (non-commutative Gröbner) bases for the braid groups in the Birman-Ko-Lee generators enriched by new ``Garside word" $δ$. It gives a new algorithm for getting the Birman-Ko-Lee Normal Form in the braid groups, and thus a new algorithm for solving the word problem in these groups.
In this paper, by using the Groebner-Shirshov bases, we give characterizations of the Schreier extensions of groups when the group is presented by generators and relations. An algorithm to find the conditions of a group to be a Schreier extension is obtained. By introducing a special total order, we obtain the structure of the Schreier extension by an HNN group.
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 prove that two-generator one-relator groups with depth less than or equal to 3 can be effectively embedded into a tower of HNN-extensions in which each group has the effective standard normal form. We give an example to show how to deal with some general cases for one-relator groups. By using the Magnus method and Composition-Diamond Lemma, we reprove the G. Higman, B. H. Neumann and H. Neumann's embedding theorem.
This paper shows that every Plactic algebra of finite rank admits a finite Gröbner--Shirshov basis. The result is proved by using the combinatorial properties of Young tableaux to construct a finite complete rewriting system for the corresponding Plactic monoid, which also yields the corollaries that Plactic monoids of finite rank have finite derivation type and satisfy the homological finiteness properties left and right $FP_\infty$. Also, answering a question of Zelmanov, we apply this rewriting system and other techniques to show that Plactic monoids of finite rank are biautomatic.
In this paper we will present the results of Artin--Markov on braid groups by using the Groebner--Shirshov basis. As a consequence we can reobtain the normal form of Artin--Markov--Ivanovsky as an easy corollary.
扫码添加微信好友,提出您的宝贵建议 👇
💡 备注请填写:网站反馈
发表机构由 AI 从论文文本抽取,如发现错误,欢迎反馈修正建议。