On the Breadth of the Jones Polynomial for Certain Classes of Knots and Links
The problem of finding the crossing number of an arbitrary knot or link is a hard problem in general. Only for very special classes of knots and links can we solve this problem. Often we can only hope to find a lower bound on the crossing number Cr(K) of a knot or a link K by computing the Jones pol...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
TopSCHOLAR®
2009
|
| Subjects: | |
| Online Access: | http://digitalcommons.wku.edu/theses/86 http://digitalcommons.wku.edu/cgi/viewcontent.cgi?article=1081&context=theses |