| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4631876 | Applied Mathematics and Computation | 2010 | 7 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Mehmet Itik, Stephen P. Banks,