Fix an integer N ≥ 2. To each diagram of a link colored by 1,...,N we associate a chain complex of graded matrix factorizations. We prove that the homotopy type of this chain complex is invariant under Reidemeister moves. When every component of the link is colored by 1, this chain complex is isomorphic to the chain complex defined by Khovanov and Rozansky. The homology of this chain complex decategorifies to the Reshetikhin-Turaev 𝔰𝔩(N) polynomial of links colored by exterior powers of the defining representation.
@book{bwmeta1.element.bwnjournal-rm-doi-10_4064-dm499-0-1,
author = {Hao Wu},
title = {A colored sl(N) homology for links in S3},
series = {GDML\_Books},
year = {2014},
zbl = {1320.57020},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-rm-doi-10_4064-dm499-0-1}
}
Hao Wu. A colored 𝔰𝔩(N) homology for links in S³. GDML_Books (2014), http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-rm-doi-10_4064-dm499-0-1/