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

Saved in:
Bibliographic Details
Published in:Communications in algebra Vol. 48; no. 5; pp. 1956 - 1968
Main Authors: Chen, Yuzhu, Hu, Xun, Kitov, Nikita V., Luo, Yanfeng, Volkov, Mikhail V.
Format: Journal Article
Language:English
Published: Abingdon Taylor & Francis 03.05.2020
Taylor & Francis Ltd
Subjects:
Algorithms
Combinatorial analysis
Kauffman monoid
Monoids
Polynomial algorithm
Polynomials
Semigroup identity
ISSN:0092-7872, 1532-4125
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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
Bibliography: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