Identities of the Kauffman Monoid K3\mathcal{K}_3

preprint2020arXivOpen access

Abstract

We give a transparent combinatorial characterization of the identities satisfied by the Kauffman monoid K3\mathcal{K}_3. Our characterization leads to a polynomial time algorithm to check whether a given identity holds in K3\mathcal{K}_3.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.