Namespaces
Variants
Actions

Jones-Conway polynomial

From Encyclopedia of Mathematics
(Redirected from Jones–Conway polynomial)
Jump to: navigation, search

Homfly polynomial, Homflypt polynomial, skein polynomial

An invariant of oriented links.

It is a Laurent polynomial of two variables associated to ambient isotopy classes of oriented links in (or ), constructed in 1984 by several groups of researchers (thus the acronyms Homfly and Homflypt) [a4], [a3], [a14], [a21], and denoted by . It generalizes the Alexander–Conway polynomial and the Jones polynomial.

There are several constructions of the polynomial, using diagrams of links (and Reidemeister moves, cf. also Reidemeister theorem), the braid group (and the Alexander and Markov theorems, cf. also Braid theory; Alexander theorem on braids; Markov braid theorem), or statistical mechanics (interpreting the polynomial as a state sum, cf. also Statistical mechanics, mathematical problems in).

The first approach uses the recursive (skein) relation

where , and form a Conway skein triple. The Jones–Conway polynomial is usually normalized to be for the trivial knot. Then for the trivial link of components, , one gets

Setting and yields the Jones polynomial, , and substituting and yields the Alexander–Conway polynomial.

In the second approach one considers the Hecke algebra associated to the Artin braid group and constructs on it the Jones–Ocneanu trace, which essentially is invariant under Markov moves. This approach is strongly related to the first approach, as the Hecke algebra quadratic relation is analogous to the skein relation of the first method.

The third approach uses the fact that the statistical mechanical systems considered satisfy the Yang–Baxter equation. This approach is immediately related to the first two by the fact that a Yang–Baxter operator satisfies the minimal polynomial (leading to a skein relation) and, on the other hand, yields a linear representation of the braid group. This state sum approach was first developed by V.F.R. Jones and has a very nice reflection in the Jaeger composition product [a7].

Properties of the Jones–Conway polynomial.

1) is an element of the Laurent polynomial ring . Furthermore, , where denotes the number of components of . In particular,

For example, for the right-handed Hopf link, , one has

2) If denotes the mirror image of a link , then

This property often allows one to detect lack of amphicheirality of a link. For example, for the right-handed trefoil knot, , one has , so the trefoil knot is not amphicheiral. For the figure eight knot, , which is amphicheiral, one gets . The first non-amphicheiral knot not detected by the Jones–Conway polynomial is the knot. The Kauffman polynomial also does not detect non-amphicheirality of . However, one can use the Jones–Conway polynomial of the -cable of to see that it is non-amphicheiral.

3) Next,

where denotes the connected sum and the split sum of links. Because the connected sum of links may depend on the choice of connected components, one can use the connected sum formula to find different links with the same Jones–Conway polynomial, for example the connected sum of three Hopf links can give two different results, both with the polynomial equal to .

4) If denotes the link obtained by reversing the orientation of , then the Jones–Conway polynomials of and coincide. Thus, each non-reversible knot ( is the smallest example) gives rise to an example of different knots with the same Jones–Conway polynomial. Furthermore, if and are two non-reversible knots, then and are different knots which cannot be distinguished by the Jones–Conway polynomials (nor by the Kauffman polynomials) of their satellites. It is an open problem (as of 2001) whether they can be distinguished by any Vassiliev–Gusarov invariants.

If (with , ), then and , where is any diagram of , denotes the number of crossings of and is the number of Seifert circles of . The equality holds, e.g., for homogeneous diagrams (including positive and alternating diagrams). In particular for a non-trivial knot , where is the crossing number of , i.e. the minimum over all diagrams of of the crossing number.

5) If , then

where denotes the planar star (Murasugi) product of the diagrams and [a15]. D.L. Vertigan proved that for a fixed , can be computed in polynomial time on the number of crossings [a20].

6) If (with , ), then

where (respectively, ) is the number of positive (respectively, negative) crossings of the diagram . In particular, , where is the minimal number of Seifert circles of all diagrams representing ; it is equal to the braid index of , see [a24]. The knot is the first knot for which the inequality is sharp. The smallest (known) alternating knot for which the inequality is sharp has crossings [a16].

7) If , then

if and only if is a positive diagram (i.e. ). For example, for a positive diagram of the right-handed trefoil knot with crossings one has and .

8) For a knot , is a multiple of .

For example, . Setting

then

where is the linking number of . In particular, (the second coefficient of the Alexander–Conway polynomial and the first non-trivial Vassiliev–Gusarov invariant). More generally, consider as an element of the ring that is the subring of generated by , and . Then is a multiple of . Furthermore,

in , where is the linking number of . In particular,

The number of components of a link and its linking number can be recovered from the Jones–Conway polynomial.

9) If for a knot and some constant , then is a Vassiliev–Gusarov invariant of order . Equivalently, is a Vassiliev–Gusarov invariant of order . One can obtain a coloured Jones–Conway polynomial by choosing an element of the Jones–Conway skein module of the solid torus (a linear combination of links in a solid torus) and computing for this the Jones–Conway polynomial. Such an invariant is stratified by Vassiliev–Gusarov invariants.

Computing the whole Jones–Conway polynomial is -hard [a6] (so up to the conjecture that , the polynomial cannot be computed in polynomial time). Furthermore, computing most of the substitutions to the Jones–Conway polynomial is -hard (even -hard). The exceptions have well understood interpretations [a5]:

i) . Now reduces to the Alexander–Conway polynomial.

ii) . Compare 8) above.

iii) , where the 's are independent. For example, if the Arf-invariant is defined and otherwise.

iv) . E.g., , where denotes the -fold cyclic covering of branched over .

v) . E.g., , where can be derived from the modulo linking form in .

There are several constructions of different links with the same Jones–Conway polynomial: mutation, rotation, cabling, spectral parameter tangle, etc. [a22]. T. Kanenobu [a12] has constructed an infinite family of different links with the same Jones–Conway polynomial. It is an open problem (as of 2001) whether there exists a non-trivial link with Jones–Conway polynomial equal to that of a trivial link (cf. Jones unknotting conjecture).

References

[a1] P.R. Cromwell, "Homogeneous links" J. London Math. Soc. , 39 : 2 (1989) pp. 535–552
[a2] J. Franks, R.F. Williams, "Braids and the Jones polynomial" Trans. Amer. Math. Soc. , 303 (1987) pp. 97–108
[a3] J. Hoste, "A polynomial invariant of knots and links" Pacific J. Math. , 124 (1986) pp. 295–320
[a4] P. Freyd, D. Yetter, J. Hoste, W.B.R. Lickorish, K. Millett, A. Ocneanu, "A new polynomial invariant of knots and links" Bull. Amer. Math. Soc. , 12 (1985) pp. 239–249
[a5] F. Jaeger, D.L. Vertigan, D.J.A. Welsh, "On the computational complexity of the Jones and Tutte polynomials" Math. Proc. Cambridge Philos. Soc. , 108 (1990) pp. 35–53
[a6] F. Jaeger, "On Tutte polynomials and link polynomials" Proc. Amer. Math. Soc. , 103 : 2 (1988) pp. 647–654
[a7] F. Jaeger, "Composition products and models for the Homfly polynomial" L'Enseign. Math. , 35 (1989) pp. 323–361
[a8] V.F.R. Jones, "Hecke algebra representations of braid groups and link polynomials" Ann. of Math. , 126 : 2 (1987) pp. 335–388
[a9] V.F.R. Jones, "On knot invariants related to some statistical mechanical models" Pacific J. Math. , 137 : 2 (1989) pp. 311–334
[a10] K. Kobayashi, K. Kodama, "On the for plumbing diagrams and oriented arborescent links" Kobe J. Math. , 5 (1988) pp. 221–232
[a11] J. Kania–Bartoszyńska, J.H. Przytycki, "Knots and links, revisited" Delta, Warsaw , June (1985) pp. 10–12 (In Polish)
[a12] T. Kanenobu, "Infinitely many knots with the same polynomial invariant" Proc. Amer. Math. Soc. , 97 : 1 (1986) pp. 158–162
[a13] W.B.R. Lickorish, "An introduction to knot theory" , Springer (1997)
[a14] W.B.R. Lickorish, K. Millett, "A polynomial invariant of oriented links" Topology , 26 (1987) pp. 107–141
[a15] K. Murasugi, J.H. Przytycki, "The Skein polynomial of a planar star product of two links" Math. Proc. Cambridge Philos. Soc. , 106 (1989) pp. 273–276
[a16] K. Murasugi, J.H. Przytycki, "An index of a graph with applications to knot theory" , Memoirs , 106 , Amer. Math. Soc. (1993)
[a17] H.R. Morton, H.B. Short, "The -variable polynomial of cable knots" Math. Proc. Cambridge Philos. Soc. , 101 (1987) pp. 267–278
[a18] H.R. Morton, "Seifert circles and knot polynomials" Math. Proc. Cambridge Philos. Soc. , 99 (1986) pp. 107–109
[a19] H. Murakami, "On derivatives of the Jones polynomial" Kobe J. Math. , 3 (1986) pp. 61–64
[a20] T.M. Przytycka, J.H. Przytycki, "Subexponentially computable truncations of Jones-type polynomials" , Graph Structure Theory , Contemp. Math. , 147 (1993) pp. 63–108
[a21] J.H. Przytycki, P. Traczyk, "Invariants of links of Conway type" Kobe J. Math. , 4 (1987) pp. 115–139
[a22] J.H. Przytycki, "Search for different links with the same Jones' type polynomials" , Ideas from Graph Theory and Statistical Mechanics, Panoramas of Mathematics , 34 , Banach Center Publ. (1995) pp. 121–148
[a23] V.G. Turaev, "The Yang–Baxter equation and invariants of links" Invent. Math. , 92 (1988) pp. 527–553
[a24] S. Yamada, "The minimal number of Seifert circles equals to braid index of a link" Invent. Math. , 89 (1987) pp. 347–356
How to Cite This Entry:
Jones–Conway polynomial. Encyclopedia of Mathematics. URL: http://www.encyclopediaofmath.org/index.php?title=Jones%E2%80%93Conway_polynomial&oldid=22611