2000 character limit reached
On the maximal degree of the Khovanov homology
Published 17 Jan 2017 in math.GT | (1701.04533v1)
Abstract: It is known that the maximal homological degree of the Khovanov homology of a knot gives a lower bound of the minimal positive crossing number of the knot. In this paper, we show that the maximal homological degree of the Khovanov homology of a cabling of a knot gives a lower bound of the minimal positive crossing number of the knot.
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.
