Chromatic polynomial, q-binomial counting and colored Jones function

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We define a q-chromatic function and q-dichromate on graphs and compare it with existing graph functions. Then we study in more detail the class of general chordal graphs. This is partly motivated by the graph isomorphism problem. Finally we relate the q-chromatic function to the colored Jones function of knots. This leads to a curious expression of the colored Jones function of a knot diagram K as a chromatic operator applied to a power series whose coefficients are linear combinations of long chord diagrams. Chromatic operators are directly related to weight systems by the work of Chmutov, Duzhin, Lando and Noble, Welsh. © 2006 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Loebl, M. (2007). Chromatic polynomial, q-binomial counting and colored Jones function. Advances in Mathematics, 211(2), 546–565. https://doi.org/10.1016/j.aim.2006.09.001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free