Efficient computation of the Kauffman bracket

DOI10.1142/S0218216514500266MaRDI QIDQ2878662zbMATH OpenOpenAlexFDO

Authors Lauren Ellenberg, Gabriella Newman, Stephen Sawin, Jonathan Shi

Publication date 4 September 2014

Published in Journal of Knot Theory and its Ramifications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1303.7179

zbMATH Keywords

computational complexitygirthJones polynomialKauffman bracketknot theorylink invariantstangles

Mathematics Subject Classification ID

Abstract: This paper bounds the computational cost of computing the Kauffman bracket of a link in terms of the crossing number of that link. Specifically, it is shown that the image of a tangle with $g$ boundary points and $n$ crossings in the Kauffman bracket skein module is a linear combination of $O(2^g)$ basis elements, with each coefficient a polynomial with at most $n$ nonzero terms, each with integer coefficients, and that the link can be built one crossing at a time as a sequence of tangles with maximum number of boundary points bounded by $Csqrtn$ for some $C.$ From this it follows that the computation of the Kauffman bracket of the link takes time and memory a polynomial in $n$ times $2^{Csqrtn}.$

Recommendations

• Kauffman bracket on rational tangles and rational knots
• On the calculation of the Kauffman bracket polynomial
• On computing Kauffman bracket polynomial of Montesinos links
• Computation of the Kauffman bracket skeleton
• Jones polynomial of knots formed by repeated tangle replacement operations

Cites work

• Crossing Numbers and Cutwidths
• FAST KHOVANOV HOMOLOGY COMPUTATIONS
• scientific article; zbMATH DE number 5497553 (Why is no real title available?)
• Jones polynomials and classical conjectures in knot theory
• Man and machine thinking about the smooth 4-dimensional Poincaré conjecture
• On Khovanov's categorification of the Jones polynomial

Cited in

(4)

• Efficient formula of the colored Kauffman brackets
• Expedited Broda-Damas bracket abstraction
• Kauffman bracket on rational tangles and rational knots
• Computation of the Kauffman bracket skeleton

This page was built for publication: Efficient computation of the Kauffman bracket

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2878662)