The slope conjecture for graph knots

Abstract

The slope conjecture proposed by Garoufalidis asserts that the Jones slopes given by the sequence of degrees of the colored Jones polynomials are boundary slopes. We verify the slope conjecture for graph knots, i.e. knots whose Gromov volume vanish.

We found a gap in the proof of Lemma 3.1 in the last version (1501.01105v2). This lemma is replaced by Proposition 3.2 in [Kalfagianni and Tran; Knot cabling and the degree of the colored Jones polynomial (1501.01574v1)]. The title of the paper is also changed

References in corpus (6)

• Slopes and colored Jones polynomials of adequate knots
• A cabling formula for the colored Jones polynomial
• Quadratic integer programming and the slope conjecture
• Slopes for Pretzel Knots
• Knot Cabling and the Degree of the Colored Jones Polynomial
• Knot Cabling and the Degree of the Colored Jones Polynomial II

Cited by in corpus (3)

• Jones slopes and coarse volume of near-alternating links
• Knot Cabling and the Degree of the Colored Jones Polynomial
• The strong slope conjecture for cablings and connected sums