A colored sl(N)-homology for links in S^3

By Hao Wu. 2009

88 citations recorded by the source corpus.

Fix an integer N>1. 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 in arXiv:math/0401268. The homology of this chain complex decategorifies to the Reshetikhin-Turaev sl(N) polynomial of links colored by exterior powers of the defining representation.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/0574b27f1b0096d165fa8746ebf5b09ade4caf03

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Aaron D. Lauda
  2. Hoel Queffelec
  3. David E. V. Rose
  4. Marko Stosic
  5. Sergei Gukov
  6. Paul Wedrich

In Geometry and Topology

  1. David E. V. Rose
  2. Paul Wedrich
  3. Marko Stosic
  4. Hoel Queffelec
  5. Aaron D. Lauda
  6. Sergei Gukov
  7. Mikhail Khovanov
  8. E. Witten

In Mathematical Physics

  1. Paul Wedrich
  2. David E. V. Rose
  3. Marko Stosic
  4. Hoel Queffelec
  5. Aaron D. Lauda
  6. Sergei Gukov
  7. Mikhail Khovanov
  8. E. Witten

Citations in the corpus