Identities of the Kauffman Monoid K_4 and of the Jones monoid J_4

10/21/2019
by   N. V. Kitov, et al.
0

Kauffman monoids K_n and Jones monoids J_n, n=2,3,..., are two families of monoids relevant in knot theory. We prove a somewhat counterintuitive result that the Kauffman monoids K_3 and K_4 satisfy exactly the same identities. This leads to a polynomial time algorithm to check whether a given identity holds in K_4. As a byproduct, we also find a polynomial time algorithm for checking identities in the Jones monoid J_4.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/31/2022

Identities in twisted Brauer monoids

We show that it is co-NP-hard to check whether a given semigroup identit...
research
07/28/2020

A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs

We give a polynomial-time algorithm for detecting very long cycles in de...
research
06/08/2022

Simplifying Polylogarithms with Machine Learning

Polylogrithmic functions, such as the logarithm or dilogarithm, satisfy ...
research
10/04/2017

Some facts on Permanents in Finite Characteristics

In the present article we essentially extend the result for the permanen...
research
06/14/2022

Synthesizing Mathematical Identities with E-Graphs

Identities compactly describe properties of a mathematical expression an...
research
03/01/2023

Computing the Best Policy That Survives a Vote

An assembly of n voters needs to decide on t independent binary issues. ...
research
11/10/2018

Uniform, Integral and Feasible Proofs for the Determinant Identities

Aiming to provide weak as possible axiomatic assumptions in which one ca...

Please sign up or login with your details

Forgot password? Click here to reset