2000 character limit reached
The head and tail conjecture for alternating knots
Published 16 Dec 2011 in math.GT | (1112.3995v1)
Abstract: We investigate the coefficients of the highest and lowest terms (also called the head and the tail) of the colored Jones polynomial and show that they stabilize for alternating links and for adequate links. To do this we apply techniques from skein theory.
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.
