The slope conjecture for graph knots
From MaRDI portal
Publication:5360438
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.
Recommendations
Cites work
- Dehn Surgery and Satellite Knots
- Incompressibility criteria for spun-normal surfaces
- Knot cabling and the degree of the colored Jones polynomial
- On the boundary curves of incompressible surfaces
- Quadratic integer programming and the slope conjecture
- Slopes and colored Jones polynomials of adequate knots
- Slopes for pretzel knots
- The Gromov invariant of links
- The Jones slopes of a knot
- The colored Jones function is \(q\)-holonomic
- The coloured Jones function and Alexander polynomial for torus knots
- The diameter of the set of boundary slopes of a knot
- Transformation Groups and Natural Bundles
Cited in
(9)- A result on the Slope Conjectures for 3-string Montesinos knots
- The strong slope conjecture for cablings and connected sums
- Quadratic integer programming and the slope conjecture
- Normal and Jones surfaces of knots
- Cancellations in the degree of the colored Jones polynomial
- The slope conjecture for Montesinos knots
- Remarks on Jones Slopes and surfaces of knots
- The strong slope conjecture and torus knots
- The strong slope conjecture for twisted generalized Whitehead doubles
This page was built for publication: The slope conjecture for graph knots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5360438)