The strong slope conjecture for cablings and connected sums

Abstract

We show that, under some technical conditions, the Strong Slope Conjecture proposed by Kalfagianni and Tran is closed under connect sums and cabling. As an application, we establish the Strong Slope Conjecture for graph knots.

Title change. Updated terminology, discussions, and proofs

References in corpus (4)

• Slopes and colored Jones polynomials of adequate knots
• A cabling formula for the colored Jones polynomial
• The slope conjecture for graph knots
• Slopes for Pretzel Knots

Cited by in corpus (1)

• Crossing numbers of cable knots