Khovanov-Rozansky Graph Homology and Composition Product
Emmanuel Wagner
TL;DR
This paper introduces a recursive formula for Khovanov-Rozansky graph homology, extending previous work on link polynomials, and provides a new computational approach for graph invariants.
Contribution
It develops a recursive formula for Khovanov-Rozansky graph homology inspired by Jaeger's formula for HOMFLY-PT polynomials, advancing the understanding of graph invariants.
Findings
Recursive formula for Khovanov-Rozansky graph homology
Extension of the formula to graph homology
Enhanced computational methods for graph invariants
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Topological and Geometric Data Analysis · Homotopy and Cohomology in Algebraic Topology