Papers
Topics
Authors
Recent
Search
2000 character limit reached

Khovanov homology and rational unknotting

Published 28 Oct 2021 in math.GT | (2110.15107v1)

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.

Citations (9)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.