The Colored Jones Function does not determine any colored Links--Gould polynomial
Matthew Harper, Ben-Michael Kohli
Abstract
We prove that there is no uniform description of LG(n) in terms of colored Jones polynomials for all knots, even when allowing infinitely many colors and arbitrary operations. We prove the n=1 case, using an existing cabling formula and the separation of the Conway and Kinoshita--Terasaka knots by LG(2). We develop an odd cabling formula and use a Vandermonde argument to show that for each n≥ 2 some satellite of each of these knots is distinguished by LG(n).
Create a lesson
Related papers
Linearity of Graph Manifold Groups
Daniel T. Wise
Finding the Birman-Series set
Peter Buser, Hugo Parlier
Thurston's Legacy at the Interface of Surface Dynamics, Train Tracks, and Arithmetic
Ahmad Rafiqi, Ayberk Zeytin
Recognizing oriented knots from finite quotients with one marked element
Indranil Biswas, Shrinit Singh
Symmetries of colored Khovanov-Rozansky homology
Alexis Guérin, Felix Roz
Coloring graphs of homologous spheres
Edgar A. Bering, Samantha Ford, Aarav Ghai et al.