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

2025/08/25 by Ramaharo, Franck
#05A19 #57M25 #Combinatorics (math.CO) #FOS: Mathematics #Geometric Topology (math.GT)

paper · doi:10.48550/arxiv.2508.17904

Abstract

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.

Related

• A bracket polynomial for 2-tangle shadows
• A one-variable bracket polynomial for some Turk's head knots
• The bracket polynomial of the Celtic link shadow CK₄²ⁿ
• Efficient Computation of the Kauffman Bracket
• An Obstruction to Embedding 4-Tangles in Links