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.
No takes yet. Share an insight, caveat, or question.
Hu et al. (2020) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: