arXiv · 2508.17904
A note on the recursive computation of the bracket polynomial for closed 4-tangles
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Franck Ramaharo. 2025-08-25. A note on the recursive computation of the bracket polynomial for closed 4-tangles. https://arxiv.org/abs/2508.17904
Cite the original work for its findings. Save a collection to share your selection of sources.