Categorifications of the colored Jones polynomial

Abstract

The colored Jones polynomial of links has two natural normalizations: one in which the n-colored unknot evaluates to [n+1], the quantum dimension of the -dimensional irreducible representation of quantum sl, and the other in which it evaluates to 1. For each normalization we construct a bigraded cohomology theory of links with the colored Jones polynomial as the Euler characteristic.

Categories

Add categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,628

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

A categorification of the Jones polynomial.Khovanov Mikhail - unknown
Matrix factorizations and link homology.Khovanov Mikhail & Rozansky Lev - unknown
Positive knots, closed braids and the Jones polynomial.Alexander Stoimenow - 2003 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 2 (2):237-285.
The constancy of colored objects in colored illumination.H. Wallach & A. Galloway - 1946 - Journal of Experimental Psychology 36 (2):119.
The Minimum Period of the Ehrhart Quasi-polynomial of a Rational Polytope.B. McAllister Tyrrell & M. Woods Kevin - unknown
The polynomial hierarchy for some structures over the binary words.Herwig Nübling - 2007 - Mathematical Logic Quarterly 53 (1):43-51.
Light affine lambda calculus and polynomial time strong normalization.Kazushige Terui - 2007 - Archive for Mathematical Logic 46 (3-4):253-280.
Le Probleme des Grandes Puissances et Celui des Grandes Racines.Natacha Portier - 2000 - Journal of Symbolic Logic 65 (4):1675-1685.
The quantum G_2 link invariant.Kuperberg Greg - unknown
Le problème Des granDes puissances et celui Des granDes racines.Natacha Portier - 2000 - Journal of Symbolic Logic 65 (4):1675-1685.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
Multifunction algebras and the provability of PH↓.Chris Pollett - 2000 - Annals of Pure and Applied Logic 104 (1-3):279-303.
Polynomial games and determinacy.Tomoyuki Yamakami - 1996 - Annals of Pure and Applied Logic 80 (1):1-16.
Fictional Colors.Dimitria Electra Gatzia - 2007 - Sorites (21).
Machines Over the Reals and Non‐Uniformity.Felipe Cucker - 1997 - Mathematical Logic Quarterly 43 (2):143-157.

Analytics

Added to PP
2017-06-17

Downloads
1 (#1,898,626)

6 months
1 (#1,461,875)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references