A note on the recursive computation of the bracket polynomial for closed 4-tangles

Given a 4-tangle shadow, we concatenate it with itself n times and form a knot by applying a closure operation that connects each top endpoint to the corresponding bottom endpoint on the same side without introducing any crossings. We then compute the Kauffman bracket polynomial for the resulting knot using a states matrix defined with respect to the basis of the Kauffman 4-strand diagram monoid.

Recommended citation: Franck Ramaharo (2025), "A note on the recursive computation of the bracket polynomial for closed 4-tangles", arXiv.org e-Print archive, arXiv:2508.17904 [math.GT].
Download Paper