2013
DOI: 10.2140/agt.2013.13.2845
|View full text |Cite
|
Sign up to set email alerts
|

The maximal degree of the Khovanov homology of a cable link

Abstract: In this paper, we study the Khovanov homology of cable links. We first estimate the maximal homological degree term of the Khovanov homology of the ($2k+1$, $(2k+1)n$)-torus link and give a lower bound of its homological thickness. Specifically, we show that the homological thickness of the ($2k+1$, $(2k+1)n$)-torus link is greater than or equal to $k^{2}n+2$. Next, we study the maximal homological degree of the Khovanov homology of the ($p$, $pn$)-cabling of any knot with sufficiently large $n$. Furthermore, … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
2
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 21 publications
0
3
0
Order By: Relevance
“…As an application of Proposition 2.2, the author [19,Corollary 5.3] computed the Rasmussen invariant of twisted Whitehead doubles (with sufficiently many twists) of any knot.…”
Section: Remark 23mentioning
confidence: 99%
“…As an application of Proposition 2.2, the author [19,Corollary 5.3] computed the Rasmussen invariant of twisted Whitehead doubles (with sufficiently many twists) of any knot.…”
Section: Remark 23mentioning
confidence: 99%
“…We prove Theorem 1.5 in Section 4.4. For more on the minimal homological degree of Khovanov homology, see [8], [9] and [11]. This paper is organized as follows: In Section 2, we recall the definitions of HQFTs and some algebras introduced in [13], as well as those of unoriented HQFTs and extended crossed group algebras defined in [10].…”
Section: [[(F D)]]mentioning
confidence: 99%
“…We prove Theorem 1.5 in Section 4.4. For more on the minimal homological degree of Khovanov homology, see [8], [9] and [11].…”
Section: Introductionmentioning
confidence: 99%