Identities of the Kauffman monoid

We give a transparent combinatorial characterization of the identities satisfied by the Kauffman monoid Our characterization leads to a polynomial time algorithm to check whether a given identity holds in

Uložené v:
Podrobná bibliografia
Vydané v:Communications in algebra Ročník 48; číslo 5; s. 1956 - 1968
Hlavní autori: Chen, Yuzhu, Hu, Xun, Kitov, Nikita V., Luo, Yanfeng, Volkov, Mikhail V.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Abingdon Taylor & Francis 03.05.2020
Taylor & Francis Ltd
Predmet:
Algorithms
Combinatorial analysis
Kauffman monoid
Monoids
Polynomial algorithm
Polynomials
Semigroup identity
ISSN:0092-7872, 1532-4125
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We give a transparent combinatorial characterization of the identities satisfied by the Kauffman monoid Our characterization leads to a polynomial time algorithm to check whether a given identity holds in
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0092-7872
1532-4125
DOI:10.1080/00927872.2019.1710164