相关论文: SO(3) Homology of Graphs and Links

Khovanov homology of a link and chromatic graph homology are known to be isomorphic in a range of homological gradings that depend on the girth of a graph. We discuss patterns shared by these two homology theories. In particular, we improve…

Let $\Delta$ be a trivial knot in the three-sphere. For every finite cyclic group $G$ of odd order, we construct a $G$-equivariant Khovanov homology with coefficients in the filed $\F_{2}$. This homology is an invariant of links up to…

Motivated by Khovanov homology and relations between the Jones polynomial and graph polynomials, we construct a homology theory for embedded graphs from which the chromatic polynomial can be recovered as the Euler characteristic. For plane…

We follow the same technics we used before in \cite{AZ} of extending knot Floer homology to embedded graphs in a 3-manifold, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such…

A discussion given to the question of extending Khovanov homology from links to embedded graphs, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such graph by using some local…

In this thesis we work with Khovanov homology of links and its generalizations, as well as with the homology of graphs. Khovanov homology of links consists of graded chain complexes which are link invariants, up to chain homotopy, with…

We reconsider the su(3) link homology theory defined by Khovanov in math.QA/0304375 and generalized by Mackaay and Vaz in math.GT/0603307. With some slight modifications, we describe the theory as a map from the planar algebra of tangles to…

We define the universal sl3-link homology, which depends on 3 parameters, following Khovanov's approach with foams. We show that this 3-parameter link homology, when taken with complex coefficients, can be divided into 3 isomorphism…

Khovanov homology offers a nontrivial generalization of Jones polynomial of links in R^3 (and of Kauffman bracket skein module of some 3-manifolds). In this chapter (Chapter X) we define Khovanov homology of links in R^3 and generalize the…

We put a new spin on Khovanov--Rozansky homology. That is, we equip $\Lambda^n$-colored $\mathfrak{sl}_{2n}$ Khovanov--Rozansky homology with an involution whose $\pm 1$-eigenspaces are link invariants. When $n=1,2,3$ (and assuming…

We utilize relations between Khovanov and chromatic graph homology to determine extreme Khovanov groups and corresponding coefficients of the Jones polynomial. The extent to which chromatic homology and chromatic polynomial can be used to…

The theory of the Kauffman bracket, which describes the Jones polynomial as a sum over closed circles formed by the planar resolution of vertices in a knot diagram, can be straightforwardly lifted from sl(2) to sl(N) at arbitrary N -- but…

We construct a cobordism group for embedded graphs in two different ways, first by using sequences of two basic operations, called "fusion" and "fission", which in terms of cobordisms correspond to the basic cobordisms obtained by attaching…

We suggest a categorification procedure for the SO(2N) one-variable specialization of the two-variable Kauffman polynomial. The construction has many similarities with the HOMFLYPT categorification: a planar graph formula for the polynomial…

Khovanov homology, an invariant of links in $\mathbb{R}^3$, is a graded homology theory that categorifies the Jones polynomial in the sense that the graded Euler characteristic of the homology is the Jones polynomial. Asaeda, Przytycki and…

For each graph we construct graded cohomology groups whose graded Euler characteristic is the chromatic polynomial of the graph. We show the cohomology groups satisfy a long exact sequence which corresponds to the well-known…

Let L be a null homologous link in $\mathbb{RP}^3$. We define Khovanov-type homologies of L which depend on an extra input $\alpha = (V_0,V_1,f,g)$ consisting of two graded vectors spaces and two maps between them. With some specific choice…

We introduce a new cohomology theory for planar trivalent graphs with perfect matchings. The graded Euler characteristic of the cohomology is a one variable polynomial called the 2-factor polynomial that, if nonzero when evaluated at one,…

In this paper, for each graph $G$, we def\mbox{}ine a chain complex of graded modules over the ring of polynomials, whose graded Euler characteristic is equal to the chromatic polynomial of $G$. Furthermore, we def\mbox{}ine a chain complex…

Mikhail Khovanov in math.QA/9908171 defined, for a diagram of an oriented classical link, a collection of groups numerated by pairs of integers. These groups were constructed as homology groups of certain chain complexes. The Euler…