Rozansky's trivial tail homology conjecture for non--adequate diagrams
Rozansky's trivial tail homology conjecture for non--adequate diagrams
Let be a link diagram, and let denote the tail homology obtained as the direct limit of the directed system of shifted categorifications of the colored Jones polynomial. A diagram is -adequate when its all- state has no state graph edge joining a state circle to itself.
Rozansky's conjecture. If a diagram is not -adequate, then is trivial.
For -adequate links, the tail homology categorifies the tail of the colored Jones polynomial. This conjecture predicts that the corresponding tail homology vanishes for non--adequate diagrams; the supplied source does not state whether the conjecture has been resolved.
Sources & referencesView supporting material
Primary source
Christine Ruey Shan Lee, “A trivial tail homology for non A-adequate links”, arXiv:1611.00686 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.