Papers
Topics
Authors
Recent
Search
2000 character limit reached

Classification of links with Khovanov homology of minimal rank

Published 22 Sep 2019 in math.GT | (1909.10032v3)

Abstract: If L is an oriented link with $n$ components, then the rank of its Khovanov homology is at least $2n$. We classify all the links whose Khovanov homology with Z/2-coefficients achieves this lower bound, and show that such links can be obtained by iterated connected sums and disjoint unions of Hopf links and unknots. This gives a positive answer to a question asked by Batson and Seed.

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.

Authors (2)

Collections

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