On the calculation of the Kauffman bracket polynomial
作者：
Highlights：
•
摘要
In this paper, we present a new algorithm to evaluate the Kauffman bracket polynomial. The algorithm uses cyclic permutations to count the number of states obtained by the application of ‘A’ and ‘B’ type smoothings to the each crossing of the knot. We show that our algorithm can be implemented easily by computer programming.
论文关键词：Knot invariant,Knot polynomial,Kauffman bracket polynomial,Computation,Cyclic permutation
论文评审过程：Available online 2 February 2010.
论文官网地址：https://doi.org/10.1016/j.amc.2010.01.102
