A bracket polynomial for 2-tangle shadows
Published in arXiv e-Print archive, 2020
We compute the Kauffman bracket polynomial of the numerator and denominator closures of A + A + … + A ( A is repeated n times), where A is a 2-tangle shadow that has at most 4 crossings.
Recommended citation: Franck Ramaharo (2020), "A bracket polynomial for 2-tangle shadows", arXiv e-Print archive, arXiv:2002.06672 [math.CO].
Download Paper