paper

Identities of the Kauffman Monoid

arXiv:1901.01564

Abstract

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 .

16 pages. The referee's suggestions have been taken into account