2000 character limit reached
A trivial tail homology for non $A$-adequate links
Published 2 Nov 2016 in math.GT | (1611.00686v3)
Abstract: We prove a conjecture of Rozansky's concerning his categorification of the tail of the colored Jones polynomial for an $A$-adequate link. We show that the tail homology groups he constructs are trivial for non $A$-adequate links.
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.