scholarly journals TUTTE POLYNOMIALS OF TENSOR PRODUCTS OF SIGNED GRAPHS AND THEIR APPLICATIONS IN KNOT THEORY

2009 ◽  
Vol 18 (05) ◽  
pp. 561-589 ◽  
Author(s):  
Y. DIAO ◽  
G. HETYEI ◽  
K. HINSON
Keyword(s):  
Tensor Product ◽  
Knot Theory ◽  
Jones Polynomial ◽  
Tensor Products ◽  
Tutte Polynomial ◽  
Signed Graphs ◽  
Substitution Rule ◽  
Simple Substitution ◽  
Jones Polynomials ◽  
Tutte Polynomials

It is well-known that the Jones polynomial of an alternating knot is closely related to the Tutte polynomial of a special graph obtained from a regular projection of the knot. Relying on the results of Bollobás and Riordan, we introduce a generalization of Kauffman's Tutte polynomial of signed graphs for which describing the effect of taking a signed tensor product of signed graphs is very simple. We show that this Tutte polynomial of a signed tensor product of signed graphs may be expressed in terms of the Tutte polynomials of the original signed graphs by using a simple substitution rule. Our result enables us to compute the Jones polynomials of some large non-alternating knots. The combinatorics used to prove our main result is similar to Tutte's original way of counting "activities" and specializes to a new, perhaps simpler proof of the known formulas for the ordinary Tutte polynomial of the tensor product of unsigned graphs or matroids.

scholarly journals Relative Tutte Polynomials of Tensor Products of Coloured Graphs

2013 ◽  
Vol 22 (6) ◽  
pp. 801-828
Author(s):  
Y. DIAO ◽  
G. HETYEI
Keyword(s):  
Tensor Product ◽  
Jones Polynomial ◽  
Tensor Products ◽  
Tutte Polynomial ◽  
Product Formula ◽  
Virtual Knot ◽  
Tutte Polynomials ◽  
Product Of Graphs

The tensor product (G1,G2) of a graph G1 and a pointed graph G2 (containing one distinguished edge) is obtained by identifying each edge of G1 with the distinguished edge of a separate copy of G2, and then removing the identified edges. A formula to compute the Tutte polynomial of a tensor product of graphs was originally given by Brylawski. This formula was recently generalized to coloured graphs and the generalized Tutte polynomial introduced by Bollobás and Riordan. In this paper we generalize the coloured tensor product formula to relative Tutte polynomials of relative graphs, containing zero edges to which the usual deletion/contraction rules do not apply. As we have shown in a recent paper, relative Tutte polynomials may be used to compute the Jones polynomial of a virtual knot.

Relative Tutte Polynomials for Coloured Graphs and Virtual Knot Theory

2009 ◽  
Vol 19 (3) ◽  
pp. 343-369 ◽  
Author(s):  
Y. DIAO ◽  
G. HETYEI
Keyword(s):  
Knot Theory ◽  
Jones Polynomial ◽  
Tutte Polynomial ◽  
Ribbon Graph ◽  
Virtual Knot ◽  
Tree Expansion ◽  
The Face ◽  
Tutte Polynomials ◽  
Bracket Polynomial ◽  
Virtual Knot Theory

We introduce the concept of a relative Tutte polynomial of coloured graphs. We show that this relative Tutte polynomial can be computed in a way similar to the classical spanning tree expansion used by Tutte in his original paper on this subject. We then apply the relative Tutte polynomial to virtual knot theory. More specifically, we show that the Kauffman bracket polynomial (and hence the Jones polynomial) of a virtual knot can be computed from the relative Tutte polynomial of its face (Tait) graph with some suitable variable substitutions. Our method offers an alternative to the ribbon graph approach, using the face graph obtained from the virtual link diagram directly.

scholarly journals A study about the Tutte polynomials of benzenoid chains

2017 ◽  
Vol 5 (1) ◽  
pp. 28-32
Author(s):  
Abdulgani Sahin
Keyword(s):  
Tutte Polynomial ◽  
Signed Graphs ◽  
Tutte Polynomials

Abstract The Tutte polynomials for signed graphs were introduced by Kauffman. In 2012, Fath-Tabar, Gholam-Rezaeı and Ashrafı presented a formula for computing Tutte polynomial of a benzenoid chain. From this point on, we have also calculated the Tutte polynomials of signed graphs of benzenoid chains in this study.

scholarly journals Graphs, Links, and Duality on Surfaces

2010 ◽  
Vol 20 (2) ◽  
pp. 267-287 ◽  
Author(s):  
VYACHESLAV KRUSHKAL
Keyword(s):  
Planar Graphs ◽  
Jones Polynomial ◽  
Tutte Polynomial ◽  
Natural Duality ◽  
Polynomial Invariant ◽  
Topological Duality ◽  
Ribbon Graphs ◽  
Virtual Links ◽  
Graphs On Surfaces ◽  
Tutte Polynomials

We introduce a polynomial invariant of graphs on surfaces,PG, generalizing the classical Tutte polynomial. Topological duality on surfaces gives rise to a natural duality result forPG, analogous to the duality for the Tutte polynomial of planar graphs. This property is important from the perspective of statistical mechanics, where the Tutte polynomial is known as the partition function of the Potts model. For ribbon graphs,PGspecializes to the well-known Bollobás–Riordan polynomial, and in fact the two polynomials carry equivalent information in this context. Duality is also established for a multivariate version of the polynomialPG. We then consider a 2-variable version of the Jones polynomial for links in thickened surfaces, taking into account homological information on the surface. An analogue of Thistlethwaite's theorem is established for these generalized Jones and Tutte polynomials for virtual links.

On the computational complexity of the Jones and Tutte polynomials

1990 ◽  
Vol 108 (1) ◽  
pp. 35-53 ◽  
Author(s):  
F. Jaeger ◽  
D. L. Vertigan ◽  
D. J. A. Welsh
Keyword(s):  
Computational Complexity ◽  
Jones Polynomial ◽  
Tutte Polynomial ◽  
Wide Range ◽  
Tutte Polynomials ◽  
Special Points ◽  
Alternating Link ◽  
Special Case

AbstractWe show that determining the Jones polynomial of an alternating link is #P-hard. This is a special case of a wide range of results on the general intractability of the evaluation of the Tutte polynomial T(M; x, y) of a matroid M except for a few listed special points and curves of the (x, y)-plane. In particular the problem of evaluating the Tutte polynomial of a graph at a point in the (x, y)-plane is #P-hard except when (x − 1)(y − 1) = 1 or when (x, y) equals (1, 1), (−1, −1), (0, −1), (−1, 0), (i, −i), (−i, i), (j, j2), (j2, j) where j = e2πi/3

Knots, matroids and the Ising model

1993 ◽  
Vol 113 (1) ◽  
pp. 107-139 ◽  
Author(s):  
W. Schwärzler ◽  
D. J. A. Welsh
Keyword(s):  
Ising Model ◽  
Partition Function ◽  
Knot Theory ◽  
Tutte Polynomial ◽  
Signed Graphs ◽  
Kauffman Bracket ◽  
Link Diagrams ◽  
Bracket Polynomial

AbstractA polynomial is defined on signed matroids which contains as specializations the Kauffman bracket polynomial of knot theory, the Tutte polynomial of a matroid, the partition function of the anisotropic Ising model, the Kauffman–Murasugi polynomials of signed graphs. It leads to generalizations of a theorem of Lickorish and Thistlethwaite showing that adequate link diagrams do not represent the unknot. We also investigate semi-adequacy and the span of the bracket polynomial in this wider context.

Jones polynomials and classical conjectures in knot theory. II

1987 ◽  
Vol 102 (2) ◽  
pp. 317-318 ◽  
Author(s):  
Kunio Murasugi
Keyword(s):  
Knot Theory ◽  
Jones Polynomial ◽  
Jones Polynomials ◽  
Alternating Link

Let L be an alternating link and be its reduced (or proper) alternating diagram. Let w() denote the writhe of [3], i.e. the number of positive crossings minus the number of negative crossings. Let VL(t) be the Jones polynomial of L [2]. Let dmaxVL(t) and dminVL(t) denote the maximal and minimal degrees of VL(t), respectively. Furthermore, let σ(L) be the signature of L [5].

scholarly journals Zeros of the Jones Polynomial are Dense in the Complex Plane

10.37236/366 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Xian'an Jin ◽  
Fuji Zhang ◽  
Fengming Dong ◽  
Eng Guan Tay
Keyword(s):  
Complex Plane ◽  
Jones Polynomial ◽  
Tutte Polynomial ◽  
Signed Graph ◽  
Labeled Graph ◽  
Jones Polynomials

In this paper, we present a formula for computing the Tutte polynomial of the signed graph formed from a labeled graph by edge replacements in terms of the chain polynomial of the labeled graph. Then we define a family of 'ring of tangles' links and consider zeros of their Jones polynomials. By applying the formula obtained, Beraha-Kahane-Weiss's theorem and Sokal's lemma, we prove that zeros of Jones polynomials of (pretzel) links are dense in the whole complex plane.

scholarly journals Evaluations of Topological Tutte Polynomials

2014 ◽  
Vol 24 (3) ◽  
pp. 556-583 ◽  
Author(s):  
J. ELLIS-MONAGHAN ◽  
I. MOFFATT
Keyword(s):  
Tensor Product ◽  
General Framework ◽  
Tutte Polynomial ◽  
Ribbon Graph ◽  
Reduction Formula ◽  
Embedded Graphs ◽  
Chromatic Polynomials ◽  
Topological Transition ◽  
Combinatorial Interpretations ◽  
Tutte Polynomials

We find new properties of the topological transition polynomial of embedded graphs, Q(G). We use these properties to explain the striking similarities between certain evaluations of Bollobás and Riordan's ribbon graph polynomial, R(G), and the topological Penrose polynomial, P(G). The general framework provided by Q(G) also leads to several other combinatorial interpretations these polynomials. In particular, we express P(G), R(G), and the Tutte polynomial, T(G), as sums of chromatic polynomials of graphs derived from G, show that these polynomials count k-valuations of medial graphs, show that R(G) counts edge 3-colourings, and reformulate the Four Colour Theorem in terms of R(G). We conclude with a reduction formula for the transition polynomial of the tensor product of two embedded graphs, showing that it leads to additional relations among these polynomials and to further combinatorial interpretations of P(G) and R(G).

scholarly journals Colored Tutte polynomials and composite knots

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Gábor Hetyei ◽  
Yuanan Diao ◽  
Kenneth Hinson
Keyword(s):  
Tensor Product ◽  
Jones Polynomial ◽  
Product Formula ◽  
Ongoing Research ◽  
Colored Graphs ◽  
Virtual Knots ◽  
Nous Montrons ◽  
Produit Tensoriel ◽  
Tutte Polynomials ◽  
International Audience

International audience Surveying the results of three recent papers and some currently ongoing research, we show how a generalization of Brylawski's tensor product formula to colored graphs may be used to compute the Jones polynomial of some fairly complicated knots and, in the future, even virtual knots. En faisant une revue de trois articles récents et de la recherche en cours, nous montrons comment une généralisation aux graphes colorés de la formule de Brylawski sur le produit tensoriel peut être utilisée à calculer le polynôme de Jones de quelques nœuds et, dans la future, même de quelques nœuds virtuels, bien compliqués.

Sign in / Sign up

Export Citation Format

Share Document