2015
DOI: 10.2140/gt.2015.19.3031
|View full text |Cite
|
Sign up to set email alerts
|

Some differentials on Khovanov–Rozansky homology

Abstract: Abstract. We study the relationship between the HOMFLY and sl(N ) knot homologies introduced by Khovanov and Rozansky. For each N > 0, we show there is a spectral sequence which starts at the HOMFLY homology and converges to the sl(N ) homology. As an application, we determine the KR-homology of knots with 9 crossings or fewer.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

8
205
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 88 publications
(213 citation statements)
references
References 20 publications
8
205
0
Order By: Relevance
“…In this section, we review the definition and properties of graded matrix factorizations over graded C-algebras, most of which can be found in [19,20,21,36,47]. Some of these properties are stated slightly more precisely here for the convenience of later applications.…”
Section: Graded Matrix Factorizationsmentioning
confidence: 99%
See 3 more Smart Citations
“…In this section, we review the definition and properties of graded matrix factorizations over graded C-algebras, most of which can be found in [19,20,21,36,47]. Some of these properties are stated slightly more precisely here for the convenience of later applications.…”
Section: Graded Matrix Factorizationsmentioning
confidence: 99%
“…Since the Koszul matrix factorizations we use in this paper are more complex than those in [19,20,36,47], it is generally harder to compute them. So it is more important to keep good track of the signs.…”
Section: }mentioning
confidence: 99%
See 2 more Smart Citations
“…Comparing the constructions is especially interesting in light of the conjecture [3,13] that there should be a spectral sequence from HOMFLY-PT homology to knot Floer homology. In both constructions, a knot in S 3 is studied by considering the collection of graphs G I for I ∈ {0, 1} n obtained by replacing each crossing in an n-crossing braid diagram with its oriented resolution or with a thick edge, as in Figure 1.…”
Section: Introductionmentioning
confidence: 99%