SO(3) Homology of Graphs and Links
classification
🧮 math.QA
math.COmath.GT
keywords
graphshomologypolynomialcategorifiedchromaticcomputationsextensionframework
read the original abstract
The SO(3) Kauffman polynomial and the chromatic polynomial of planar graphs are categorified by a unique extension of the Khovanov homology framework. Many structural observations and computations of homologies of knots and spin networks are included.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.