2000 character limit reached
Khovanov homology and rational unknotting (2110.15107v1)
Published 28 Oct 2021 in math.GT
Abstract: Building on work by Alishahi-Dowlin, we extract a new knot invariant $\lambda \ge 0$ from universal Khovanov homology. While $\lambda$ is a lower bound for the unknotting number, in fact more is true: $\lambda$ is a lower bound for the proper rational unknotting number (the minimal number of rational tangle replacements preserving connectivity necessary to relate a knot to the unknot). Moreover, we show that for all $n \ge 0$, there exists a knot K with $\lambda(K) = n$. Along the way, following Thompson, we compute the Bar-Natan complexes of rational tangles.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.