2000 character limit reached
Identities of the Kauffman Monoid $\mathcal{K}_3$
Published 6 Jan 2019 in math.GR | (1901.01564v2)
Abstract: We give a transparent combinatorial characterization of the identities satisfied by the Kauffman monoid $\mathcal{K}_3$. Our characterization leads to a polynomial time algorithm to check whether a given identity holds in $\mathcal{K}_3$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
