Dichromatic polynomial for graph of a (2,n)-torus knot

In this study, we introduce the relationship between the Tutte polynomials and dichromatic polynomials of (2,n)-torus knots. For this aim, firstly we obtain the signed graph of a (2,n)-torus knot, marked with {+} signs, via the regular diagram of its. Whereupon, we compute the Tutte polynomial for this graph and find a generalization through these calculations. Finally we obtain dichromatic polynomial lying under the unmarked states of the signed graph of the (2,n)-torus knots by the generalization.

ARROW RIBBON GRAPHS

We introduce an additional arrow structure on ribbon graphs. We extend the dichromatic polynomial to ribbon graphs with this structure. This extended polynomial satisfies the contraction–deletion relations and behaves naturally with respect to the partial duality of ribbon graphs. From a virtual link, we construct an arrow ribbon graph whose extended dichromatic polynomial specializes to the arrow polynomial of the virtual link recently introduced by H. Dye and L. Kauffman. This result generalizes the classical Thistlethwaite theorem to the arrow polynomial of virtual links.

ORIENTED STATE MODEL OF THE JONES POLYNOMIAL AND ITS CONNECTION TO THE DICHROMATIC POLYNOMIAL

It is well known that Kauffman constructed a state model of the Jones polynomial based on unoriented link diagrams. In his approach, in order to obtain Jones polynomial one needs to calculate both the writhe and the Kauffman bracket. Stimulated by a paper of Altintas (An oriented state model for the Jones polynomial and its applications to alternating links, Appl. Math. Comput.194 (2007) 168–178), in this paper we present a state sum model based on oriented link diagrams. In our approach, we succeed in adding the writhe to the state sum model and need not to compute the writher any more. We further show that, via our state sum model, Jones polynomial of any link (alternating or not) is a special parametrization of the dichromatic polynomial of a weighted graph with two different edge weights.

CATEGORIFICATION OF THE DICHROMATIC POLYNOMIAL FOR GRAPHS

For each graph and each positive integer n, we define a chain complex whose graded Euler characteristic is equal to an appropriate n-specialization of the dichromatic polynomial. This also gives a categorification of n-specializations of the Tutte polynomial of graphs. Also, for each graph and integer n ≤ 2, we define the different one-variable n-specializations of the dichromatic polynomial, and for each polynomial, we define graded chain complex whose graded Euler characteristic is equal to that polynomial. Furthermore, we explicitly categorify the specialization of the Tutte polynomial for graphs which corresponds to the Jones polynomial of the appropriate alternating link.

A generalization of the dichromatic polynomial of a graph

The Subgraph polynomial fo a graph pair(G,H), whereH⫅G, is defined. By assigning particular weights to the variables, it is shown that this polynomial reduces to the dichromatic polynomial ofG. This idea of a graph pair leads to a dual generalization of the dichromatic polynomial.