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

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
9 Pages, 9 eps figures

Citation

Consulte el texto completo en el siguiente enlace:

Collections