arXiv Analytics

Sign in

arXiv:math/9903055 [math.GT]AbstractReferencesReviewsResources

On the z-degree of the Kauffman polynomial of a tangle decomposition

Mark E. Kidwell, Theodore B. Stanford

Published 1999-03-10Version 1

We give an upper bound on the z-degree of the Kauffman polynomial of a link, using bridges of length greater than one which are separated in some tangle decomposition of a link diagram. We construct some examples by wiring together rational tangles.

Comments: 9 Pages, 9 eps figures
Categories: math.GT, math.QA
Subjects: 57M25
Related articles: Most relevant | Search more
arXiv:1111.7000 [math.GT] (Published 2011-11-29, updated 2011-12-01)
A bound for orderings of Reidemeister moves
arXiv:1007.3278 [math.GT] (Published 2010-07-19, updated 2011-01-20)
Upper bounds in the Ohtsuki-Riley-Sakuma partial order on 2-bridge knots
arXiv:1512.08316 [math.GT] (Published 2015-12-28)
Simplicial volume of links from link diagrams

Links

Toolbox