2020
DOI: 10.1007/978-3-030-48006-6_12
|View full text |Cite
|
Sign up to set email alerts
|

Identities of the Kauffman Monoid $$\mathcal {K}_4$$ and of the Jones Monoid $$\mathcal {J}_4$$

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 47 publications
0
4
0
Order By: Relevance
“…Obviously, the next natural step in studying identities of Kauffman monoids is to characterize the identities of K n for n > 3. Recently, two of the present authors (see [Kitov and Volkov, 2019]) have found a description of the identities of K 4 . It turns out that K 4 satisfies precisely the same identities K 3 , which is a sort of surprise.…”
Section: Discussionmentioning
confidence: 87%
“…Obviously, the next natural step in studying identities of Kauffman monoids is to characterize the identities of K n for n > 3. Recently, two of the present authors (see [Kitov and Volkov, 2019]) have found a description of the identities of K 4 . It turns out that K 4 satisfies precisely the same identities K 3 , which is a sort of surprise.…”
Section: Discussionmentioning
confidence: 87%
“…In [9], the authors characterize the identities of J 4 . They show that for words w and v of X * , the monoid J 4 satisfies the identity w = v if c(w) = c(v) and for every non empty subset Y of c(w), Conditions (1), ( 2) and (3) of Theorem 4.6 hold.…”
Section: 2mentioning
confidence: 99%
“…Chen et al in [5], provide an algorithm for checking identities in K 3 . Kitov and Volkov in [9], extend this algorithm to the Kauffman monoid K 4 and also find a polynomial time algorithm for checking identities in the Jones monoid J 4 . They prove that the Kauffman monoids K 3 and K 4 satisfy exactly the same identities.…”
Section: Introductionmentioning
confidence: 99%
“…For a finite semigroup S, the identity checking problem Check-Id(S) is always decidable but this is not necessarily true for an infinite semigroup [46]. Studying the computational complexity of identity checking in semigroups was proposed by Sapir [31,Problem 2.4], and up to now, there are many results in this study [6,10,16,29,33].…”
Section: Introductionmentioning
confidence: 98%