Walks Along Braids and the Colored Jones Polynomial

2011/01/20 by Armond, Cody
#FOS: Mathematics #Geometric Topology (math.GT)

paper · doi:10.48550/arxiv.1101.3810

Abstract

Using the Huynh and Le quantum determinant description of the colored Jones polynomial, we construct a new combinatorial description of the colored Jones polynomial in terms of walks along a braid. We then use this description to show that for a knot which is the closure of a positive braid, the first N coefficients of the N-th colored Jones polynomial are trivial.

Related

• An Efficient Algorithm to Compute the Colored Jones Polynomial
• A determinant formula of the Jones polynomial for a family of braids
• The Jones polynomial: quantum algorithms and applications in quantum complexity theory
• On the head and the tail of the colored Jones polynomial
• Quantum Knot Invariants