Khovanov-Rozansky Graph Homology and Composition Product

Abstract

In analogy with a recursive formula for the HOMFLY-PT polynomial of links given by Jaeger, we give a recursive formula for the graph polynomial introduced by Kauffman and Vogel. We show how this formula extends to the Khovanov-Rozansky graph homology.

10 pages

Cited by in corpus (2)

• The chromatic polynomial of fatgraphs and its categorification
• The Khovanov-Rozansky Cohomology and Bennequin Inequalities