2019/01/06 by Chen, Yuzhu, Hu, Xun, Kitov, N. V. +2
#20M07 #FOS: Mathematics #Group Theory (math.GR)
paper · doi:10.48550/arxiv.1901.01564
We give a transparent combinatorial characterization of the identities satisfied by the Kauffman monoid K3. Our characterization leads to a polynomial time algorithm to check whether a given identity holds in K3.