On the z-degree of the Kauffman polynomial of a tangle decomposition
Preprint
Abstract
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.Keywords
All Related Versions
This publication has 2 references indexed in Scilit:
- The Kauffman polynomial of alternating linksTopology and its Applications, 1995
- Kauffman's polynomial and alternating linksTopology, 1988