Khovanov-Kauffman Homology for embedded Graphs

Khovanov-Kauffman Homology for embedded Graphs

July 15, 2019
Abstract.

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 replacements at each vertex in the graph. This new concept of Khovanov-Kauffman homology of an embedded graph constructed to be the sum of the Khovanov homologies of all the links and knots associated to this graph.

Key words and phrases:
Khovanov homology, embedded graphs, Kauffman replacements, graph homology

1. Introduction

The idea of categorification the Jones polynomial is known by Khovanov Homology for links which is a new link invariant introduced by Khovanov [7], [1]. For each link in he defined a graded chain complex, with grading preserving differentials, whose graded Euler characteristic is equal to the Jones polynomial of the link . The idea of Khovanov Homology for graphs arises from the same idea of Khovanov homology for links by the categorifications the chromatic polynomial of graphs. This was done by L. Helme-Guizon and Y. Rong [4], for each graph G, they defined a graded chain complex whose graded Euler characteristic is equal to the chromatic polynomial of G. In our work we try to recall, the Khovanov homology for links.
We discuss the question of extending Khovanov homology from links to embedded graphs. This is based on a result of Kauffman that constructs a topological invariant of embedded graphs in the 3-sphere by associating to such a graph a family of links and knots obtained using some local replacements at each vertex in the graph. He showed that it is a topological invariant by showing that the resulting knot and link types in the family thus constructed are invariant under a set of Reidemeister moves for embedded graphs that determine the ambient isotopy class of the embedded graphs. We build on this idea and simply define the Khovanov homology of an embedded graph to be the sum of the Khovanov homologies of all the links and knots in the Kauffman invariant associated to this graph. Since this family of links and knots is a topologically invariant, so is the Khovanov-Kauffman homology of embedded graphs defined in this manner. We close this paper by giving an example of computation of Khovanov-Kauffman homology for an embedded graph using this definition.

Acknowledgements: The author would like to express his deeply grateful to Prof.Matilde Marcolli for her advices and numerous fruitful discussions. He is also thankful to Louis H. Kauffman and Mikhail Khovanov for their support words and advices. Some parts of this paper done in Max-Planck Institut für Mathematik (MPIM), Bonn, Germany, the author is kindly would like to thank MPIM for their hosting and subsidy during his study there.

2. Khovanov Homology

In the following we recall a homology theory for knots and links embedded in the 3-sphere. We discuss later how to extend it to the case of embedded graphs.

In recent years, many papers have appeared that discuss properties of Khovanov Homology theory, which was introduced in [7]. For each link , Khovanov constructed a bi-graded chain complex associated with the diagram for this link and applied homology to get a group , whose Euler characteristic is the normalized Jones polynomial.

 ∑i,j(−1)iqjdim(Khi,j(L))=J(L)

He also proved that, given two diagrams and for the same link, the corresponding chain complexes are chain equivalent, hence, their homology groups are isomorphic. Thus, Khovanov homology is a link invariant.

Let be a link with crossings. At any small neighborhood of a crossing we can replace the crossing by a pair of parallel arcs and this operation is called a resolution. There are two types of these resolutions called -resolution (Horizontal resolution) and -resolution (Vertical resolution) as illustrated in figure (1).

We can construct a -dimensional cube by applying the and -resolutions times to each crossing to get pictures called smoothings (which are one dimensional manifolds) . Each of these can be indexed by a word of zeros and ones, i.e. . Let be an edge of the cube between two smoothings and , where and are identical smoothings except for a small neighborhood around the crossing that changes from to -resolution. To each edge we can assign a cobordism (orientable surface whose boundary is the union of the circles in the smoothing at either end)

 Σξ:Sα1⟶Sα2

This is a product cobordism except in the neighborhood of the crossing, where it is the obvious saddle cobordism between the and -resolutions. Khovanov constructed a complex by applying a -dimensional TQFT (Topological Quantum Field Theory) which is a monoidal functor, by replacing each vertex by a graded vector space and each edge (cobordism) by a linear map , and we set the group to be the direct sum of the graded vector spaces for all the vertices and the differential on the summand is a sum of the maps for all edges such that Tail() i.e.

 di(v)=∑ξsign(−1)dξ(v) (2.1)

where and is chosen such that .
An element of is said to have homological grading and -grading where

 i=|α|−n− (2.2)
 j=deg(v)+i+n−+n+ (2.3)

for all , is the number of 1’s in , and , represent the number of negative and positive crossings respectively in the diagram .

2.3. Properties

[12], [8] Here we give some properties of Khovanov homology.

Proposition 2.1.
1. If is a diagram obtained from by the application of a Reidemeister moves then the complexes and are homotopy equivalent.

2. For an oriented link with diagram D, the graded Euler characteristic satisfies

 ∑(−1)iqdim(Khi,∗(L))=J(L) (2.4)

where is the normalized Jones Polynomials for a link and

 ∑(−1)iqdim(Khi,∗(D))=∑(−1)iqdim(CKhi,∗(D))
3. Let and be two links with odd and even number of components then and

4. For two oriented link diagrams and , the chain complex of the disjoint union is given by

 CKh(D⊔D′)=CKh(D)⊗CKh(D′). (2.5)
5. For two oriented links and , the Khovanov homology of the disjoint union satisfies

 Kh(L⊔L′)=Kh(L)⊗Kh(L′).
6. Let be an oriented link diagram of a link with mirror image diagram of the mirror link . Then the chain complex is isomorphic to the dual of and

 Kh(L)≅Kh(Lm)

3. Khovanov-Kauffman Homology for Embedded Graphs (KKh(G))

3.1. Kauffman’s invariant of Graphs

We give now a survey of the Kauffman theory and show how to associate to an embedded graph in a family of knots and links. We then use these results to give our definition of Khovanov homology for embedded graphs. In [6] Kauffman introduced a method for producing topological invariants of graphs embedded in . The idea is to associate a collection of knots and links to a graph so that this family is an invariant under the expanded Reidemeister moves defined by Kauffman and reported here in figure (2).

He defined in his work an ambient isotopy for non-rigid (topological) vertices. (Physically, the rigid vertex concept corresponds to a network of rigid disks each with (four) flexible tubes or strings emanating from it.) Kauffman proved that piecewise linear ambient isotopies of embedded graphs in correspond to a sequence of generalized Reidemeister moves for planar diagrams of the embedded graphs.

Theorem 3.1.

[6] Piecewise linear (PL) ambient isotopy of embedded graphs is generated by the moves of figure (2), that is, if two embedded graphs are ambient isotopic, then any two diagrams of them are related by a finite sequence of the moves of figure (2).

Let be a graph embedded in . The procedure described by Kauffman of how to associate to a family of knots and links prescribes that we should make a local replacement as in figure (3) to each vertex in . Such a replacement at a vertex connects two edges and isolates all other edges at that vertex, leaving them as free ends. Let denote the link formed by the closed curves formed by this process at a vertex . One retains the link , while eliminating all the remaining unknotted arcs. Define then to be the family of the links for all possible replacement choices,

 T(G)=∪v∈V(G)r(G,v).

For example see figure (4).

Theorem 3.2.

[6] Let be any graph embedded in , and presented diagrammatically. Then the family of knots and links , taken up to ambient isotopy, is a topological invariant of .

For example, in the figure (4) the graph is not ambient isotopic to the graph , since contains a non-trivial link.

3.2. Definition of Khovanov-Kauffman Homology for Embedded Graphs

Now we are ready to speak about a new concept of Khovanov-Kauffman homology for embedded graphs by using Khovanov homology for the links (knots) and Kauffman theory of associate a family of links to an embedded graph , as described above.

Definition 3.3.

Let be an embedded graph with the family of links associated to by the Kauffman procedure. Let be the usual Khovanov homology of the link in this family. Then the Khovanov-Kauffman homology for the embedded graph is given by

 KKh(G)=Kh(L1)⊕Kh(L2)⊕....⊕Kh(Ln)

Its graded Euler characteristic is the sum of the graded Euler characteristics of the Khovanov homology of each link, i.e. the sum of the Jones polynomials,

 ∑i,j,k(−1)iqjdim(Khi,j(Lk))=∑kJ(Lk). (3.1)

We show some simple explicit examples.

Example 3.4.

In figure (4) then for

 KKh(G1)=Kh(◯◯)⊕Kh(◯)

Now, from proposition 2.1 no.5

 KKh(G1)=Kh(◯)⊗Kh(◯)⊕Kh(◯)

Another example comes from then

 KKh(G2)=Kh(\includegraphics[width=17.071654pt]hopf.eps)⊕Kh(◯)

Since , and from [12]

Then,

References

• [1] D. Bar-Natan, Khovanov’s homology for tangles and cobordisms, Geometry and Topology, Vol.9 (2005) 1443–1499.
• [2] R.H.Fox and J.W. Milnor singularity of 2-spheres in 4-space and equivalence knots (Abstract), Bull.Amer. Math. Soc.,Vol 63 (1957), pp 406
• [3] R.H. Fox, A quick trip through knot theory. in “Topology of 3-manifolds and related topics” Prentice-Hall, 1962, pp. 120–167.
• [4] Laure Helm-Guizon and Yongwu Rong Graph Cohomologies from Arbitrary Algebras, mathQA/0506023v1, (2005).
• [5] M. Jacobsson An Invariant of Link Cobordisms from Khovanov Homology, Algebraic and Geometry Topology, Vol.4, (2004), 1211-1251
• [6] Louis H.Kauffman Invariants of Graphs in Three-Space, Transactions of the American Mathematical Society, Vol.311, No.2, (1989).
• [7] M. Khovanov, A categorification of the Jones polynomial. Duke Math. J. 101 (2000), no. 3, 359–426.
• [8] E. S.Lee An Endomorphism of the Khovanov Invariant, math.GT/0210213v3, (2004)
• [9] Jacob Rasmussen Khovanov Homology and the Slice Genus, math.GT/0402131v1,(2004)
• [10] K.Taniyama, Cobordism, homotopy and homology of graphs in , Topology, Vol.33 (1994) 509-523.
• [11] C.H. Taubes, J. Bryan, Donaldson-Floer theory, in “Gauge theory and the topology of four-manifolds” (Park City, UT, 1994), 195–221, IAS/Park City Math. Ser., 4, Amer. Math. Soc., Providence, RI, 1998.
• [12] Paul Turner Five Lectures on Khovanov Homology, math.GT/0606464,(2006)
You are adding the first comment!
How to quickly get a good reply:
• Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
• Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
• Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters