Identities of the Kauffman Monoid K3
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.