vix.ing · top · new · best · stats · spec

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

1999/03/10 by Mark E. Kidwell, Kidwell, Mark E., Theodore Stanford +2
Mathematics · #57M25 #Advanced Combinatorial Mathematics #FOS: Mathematics #Geometric Topology (math.GT) #Geometric and Algebraic Topology #Homotopy and Cohomology in Algebraic Topology #Quantum Algebra (math.QA) #math.GT #math.QA #msc:57M25

paper · pdf · doi:10.48550/arxiv.math/9903055

9 Pages, 9 eps figures

arxiv created 1999/03/10 · openalex publication_date 1999/03/10 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related