2000 character limit reached
A new condition on the Jones polynomial of a fibered positive link
Published 8 Apr 2022 in math.GT | (2204.03846v2)
Abstract: We give a new upper bound on the maximum degree of the Jones polynomial of a fibered positive link. In particular, we prove that the maximum degree of the Jones polynomial of a fibered positive knot is at most four times the minimum degree. Using this result, we can complete the classification of all knots of crossing number $\leq 12$ as positive or not positive, by showing that the seven remaining knots for which positivity was unknown are not positive. That classification was also done independently at around the same time by Stoimenow.
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.