On the degree of the colored Jones polynomial
arXiv:1311.6059
Abstract
The extreme degrees of the colored Jones polynomial of any link are bounded in terms of concrete data from any link diagram. It is known that these bounds are sharp for semi-adequate diagrams. One of the goals of this paper is to show the converse; if the bounds are sharp then the diagram is semi-adequate. As a result, we use colored Jones link polynomials to extract an invariant that detects semi-adequate links and discuss some applications.
To appear in Acta Math. Vietnamica (Proceedings of Hyperbolic Geometry and Quantum Topology in Nha Trang)
References in corpus (7)
- The Jones polynomial and graphs on surfaces
- Rogers-Ramanujan type identities and the head and tail of the colored Jones polynomial
- A stability conjecture for the colored Jones polynomial
- Khovanov homology of a unicolored B-adequate link has a tail
- The Head and Tail of the Colored Jones Polynomial for Adequate Knots
- Jones polynomials, volume, and essential knot surfaces: a survey
- Flag algebras and the stable coefficients of the Jones polynomial