2012
DOI: 10.1142/s1005386712000703
|View full text |Cite
|
Sign up to set email alerts
|

Gröbner-Shirshov Bases of the Generalized Bruck-Reilly ∗-Extension

Abstract: In this paper we first define a presentation for the generalized Bruck-Reilly ∗-extension of a monoid and then we work on its Gröbner-Shirshov bases.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 19 publications
(11 citation statements)
references
References 19 publications
0
11
0
Order By: Relevance
“…In [14], the authors have obtained the following results. [(0; 0; 1 T ; 0; 1)g is a generating set for the monoid GBR (T ; ; ; u).…”
Section: Generalized Bruck-reilly -Extensionmentioning
confidence: 99%
“…In [14], the authors have obtained the following results. [(0; 0; 1 T ; 0; 1)g is a generating set for the monoid GBR (T ; ; ; u).…”
Section: Generalized Bruck-reilly -Extensionmentioning
confidence: 99%
“…Furthermore, in [16] and [17], Gröbner-Shirshov bases for Schreier extensions of groups and for the Chinese monoid were defined separately. The reader is referred to [1,5,6,8,19,21,22] for some other recent papers about Gröbner-Shirshov bases.…”
Section: Introductionmentioning
confidence: 99%
“…There are some important studies on this subject related to the groups (see, for instance, [8,14]). We may finally refer the papers [4,9,10,18,19] for some other recent studies over Gröbner- Shirshov bases. Algorithmic problems such as the word, conjugacy and isomorphism problems have played an important role in group theory since the work of M. Dehn in early 1900's. These problems are called decision problems which ask for a yes or no answer to a specific question.…”
Section: Introductionmentioning
confidence: 99%