2000 character limit reached
On the AJ conjecture for cable knots
Published 8 Dec 2014 in math.GT and math.QA | (1412.2731v2)
Abstract: We study the AJ conjecture for $(r,2)$-cables of a knot, where $r$ is an odd integer. Using skein theory, we show that the AJ conjecture holds true for most $(r,2)$-cables of some classes of two-bridge knots and pretzel knots.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.