Meridian twisting of closed braids and the Homfly polynomial

Transcription

1 Math. Proc. Camb. Phil. Soc. (2009), 46, 649 c 2008 Cambridge Philosophical Society doi:0.07/s Printed in the United Kingdom First published online 22 October Meridian twisting of closed braids and the Homfly polynomial BY TAMÁS KÁLMÁN The University of Tokyo Graduate School of Mathematical Sciences -8- Komaba, Meguro Tokyo, Japan. kalman@ms.u-tokyo.ac.jp (Received 6 March 2008; Revised July 2008) Abstract Let β be a braid on n strands, with exponent sum w. Let be the Garside half-twist braid. We prove that the coefficient of v w n+ in the Homfly polynomial of the closure of β agrees with ( ) n times the coefficient of v w+n2 in the Homfly polynomial of the closure of β 2. This coincidence implies that the lower Morton Franks Williams estimate for the v degree of the Homfly polynomial of β is sharp if and only if the upper MFW estimate is sharp for the v degree of the Homfly polynomial of β 2. In this paper, parts of an old story are told again in a way that yields a surprising new result (Figure 2 shows a representative example). Indeed, the only items that could not have been written twenty years ago are some speculation about Khovanov Rozansky homology and Remark 4, which do not belong to the proof, and the proof of Proposition 2. The latter is a well known fact and in particular it too can be established using skein theory. The new proof is included for completeness and because it is short. The main theorem (Theorem ) is stated in the introduction and proven in section 2. Section contains an alternative argument suggested by the referee that puts our formula in the context of the Hecke algebra. We conclude the paper with several examples and remarks.. Introduction Braids will be drawn horizontally. In particular, the standard generators σ i of the braid group B n [2] appear as a crossing sandwiched between groups of i and n i trivial strands, respectively. n is the trivial braid on n strands. The usual closure of the braid β will be denoted by β. It gets its orientation from directing the strands of β from left to right. The framed Homfly polynomial H D is a two-variable, integer-coefficient Laurent polynomial in the indeterminates v and z. It is associated to any oriented link diagram D, and it is uniquely defined by the skein relations H H = zh ; H = vh ; H = v H and the requirement (normalization) that for the crossingless diagram of the unknot (with either orientation), H (v,z) =. H is invariant under regular isotopy of knot diagrams.

2 650 TAMÁS KÁLMÁN Fig.. The Homfly polynomial of the (, 5) torus knot. The Homfly polynomial itself is P D (v, z) = v w H D (v, z), where w is the writhe of D. Unlike H, it is an oriented link invariant: P(v, z) takes the same value for diagrams that represent isotopic oriented links. We will record Homfly coefficients on the vz plane. (We hope that our blurring of the distinction between the indeterminates and their exponents will not lead to confusion.) We will often speak about columns of the Homfly polynomial. These can be equivalently thought of as polynomials in z that appear as the coefficients of various powers of v. Example. The Homfly polynomial of the torus knot T (, 5) is P T (,5) (v, z) = z 8 v 8 + 8z 6 v 8 z 6 v 0 + 2z 4 v 8 7z 4 v 0 + 2z 2 v 8 4z 2 v 0 + z 2 v 2 + 7v 8 8v 0 + 2v 2 = (z 8 + 8z 6 + 2z 4 + 2z 2 + 7)v 8 (z 6 + 7z 4 + 4z 2 + 8)v 0 + (z 2 + 2)v 2, and we will write it as shown in Figure. Next, recall the famous Morton Franks Williams inequality [6, ] which (put somewhat sloppily) says that braid index number of non-zero columns in P ( ) for any oriented link type. (For knot theoretical definitions such as braid index, we refer the reader to [4].) In its standard proof, this is derived from the following pair of inequalities. Let β be a braid word on n strands, with exponent sum w. Then, w n + lowest v degree of P β ( 2) and highest v degree of P β w + n. ( ) We will refer to ( 2) as the lower MFW estimate and to ( ) as the upper MFW estimate. Similarly, we might call w n + the lower MFW bound (for β) and w + n the upper MFW bound. Graphically, these inequalities mean that the left column of the Homfly polynomial P β is on or to the right of the vertical line v = w n + while the right column is on or to the left of v = w + n. Example 2. If we represent T (, 5) with the braid word β = (σ σ 2 ) 5 =,

3 Twisting braids and the Homfly polynomial 65 Fig. 2. The effect of adding a full twist on the Homfly polynomial. then n =, w = 0, w n + = 8, w + n = 2, and we see that both the lower and the upper MFW estimates are sharp for this braid. Indeed, the Homfly polynomial of Example has columns. We will denote the Garside braid (positive half twist) on n strands by n or simply by. Then 2 represents a positive full twist. (For example, = and 2 =.) Since 2 contains n(n ) positive crossings, the braid β 2 still has n strands but exponent sum w + n(n ). Thus, the upper MFW bound for β 2 is w + n(n ) + n = w + n 2. ( 4) Now we are ready to state our main theorem. THEOREM. For any braid β on n strands, the lower MFW estimate is sharp if and only if the upper MFW estimate is sharp for the braid β 2. If this is the case, then left column of P β = ( ) n right column of P β 2. ( 5) Example 4. If we add a full twist to the braid of Example 2, we observe a change in the Homfly polynomial as shown in Figure 2 (cf. Corollary 9). Somewhat more precisely, we can claim the following. THEOREM 5. For any braid β of n strands and exponent sum w, the coefficient of v w n+ in P β = ( ) n the coefficient of v w+n2 in P β 2. ( 6) From this latter statement, Theorem follows immediately. Indeed, comparing Theorem 5 with ( 2), ( ) and ( 4), we see that ( 6) either says that 0 = 0, or the more meaningful formula ( 5), depending on whether or not the sharpness condition is met. We give yet another formulation of our result which fits best with the methods of both proofs we will present. It is important to stress that whenever the framed Homfly polynomial

4 652 TAMÁS KÁLMÁN of a closed braid is taken, β means the diagram that is the union of a diagram of β and n disjoint, simple curves above it to form its closure. THEOREM 6. For any braid β of n strands and exponent sum w, the coefficient of v n+ in H β = ( ) n the coefficient of v n in H β 2. ( 7) It is easy to see that ( 6) and ( 7) are equivalent. The left-hand side of ( 7) agrees with the coefficient of v w v n+ in v w H β = P β, which is the left-hand side of ( 6). Similarly, the right-hand side of ( 7) equals (plus or minus) the coefficient of v w+n(n ) v n in v w+n(n ) H β 2 = P β 2, i.e. the right-hand sides agree, too. By reading our formulae from right to left, we get versions of our claims for the case of a full negative twist. (Equally trivial proofs can be derived from the fact that the Homfly polynomials of an oriented link and its mirror image are related by the change of variable v v.) In particular, corresponding to Theorem, we have COROLLARY 7. For any braid β on n strands, the upper MFW estimate is sharp if and only if the lower MFW estimate is sharp for the braid β 2. If this is the case, then the right column of P β coincides with ( ) n times the left column of P β 2. Example 8. One recognizes the right column in Figure, z 2 + 2, as the left column in the Homfly polynomial, z 2 v 2 + 2v 2 v 4, of the trefoil knot T (, 2). The two equivalent sharpness conditions of Theorem are both well known to hold for positive braids [6]. (The sharpness of ( 2) for positive braids is easier to see (cf. the footnote to Remark 4.) With that, we can use Theorem to give a new proof of Franks and Williams s claim that for positive braids with a full twist, ( ) is sharp, and therefore they realize the braid index of their closure. This argument however would not be very different from the original one.) Thus we have: COROLLARY 9. For any positive braid β on n strands, the left column of its Homfly polynomial agrees with ( ) n times the right column of the Homfly polynomial of β 2. Note however that the Morton Franks Williams inequalities are sharp for many nonbraid-positive knots, too. Up to 0 crossings, there are only five knots that do not possess braid representations with a sharp (lower) MFW estimate [8]. Thus, ( 6) is informative for many non-positive braids as well (cf. Example 4 2). For all three of the inequalities, ( ), ( 2) and ( ), that we quoted from [6] and [], it makes sense to say that they are sharp for a braid (like we did throughout most of this introduction) and also to discuss (as in the previous paragraph) whether they are sharp for a link. The latter means that a given oriented link type has a braid representative that turns the inequality into an equality. We are unaware of a version of the twist phenomenon for the Kauffman polynomial. Likewise, there do not seem to be noteworthy consequences of Theorem 5 for the various other knot polynomials that are derived from the Homfly polynomial. (Let us mention though Yokota s work [5] concerning the Jones polynomial here.) However we do anticipate there to be a twisting formula for the generalization (categorification) of the Homfly polynomial known as Khovanov Rozansky homology [0] (cf. Example 4 2). For instance, the MFW inequalities extend to the categorification [5, 4].

5 Twisting braids and the Homfly polynomial 65 Fig.. A Legendrian representative of the link Proof of the main theorem We will give a detailed proof of Theorem 6. It has already been explained how our other claims follow from it. The proof is based on skein theory. In Section, we shall sketch a more algebra- and representation theory-oriented version of essentially the same argument. 2. Review of known techniques First, note that for the framed Homfly polynomial the MFW estimates take the form n + any exponent of v in H β(v, z) n. (2 ) We will need the following fact about the link 2 n (formed by n fibres of the Hopf fibration). It is a tiny portion of a known formula. PROPOSITION 2. The highest v-exponent in H 2 n (v, z) is n and the single term in which it occurs is ( ) n z n v n. Proof. This statement can be proven by induction based on the formula 2 n = (σ n σ )(σ σ n ) 2 n, skein relations, inequality ( ), and repeated use of arguments similar to Lemma 2 2. It can also be inferred from [8, section 9]. We will present a third proof, based on a different set of notions. All relevant definitions can be found in []. Figure shows the front diagram of a Legendrian representative of the link. The number of its left cusps is c = n and it has Thurston Bennequin number n 2. As all crossings are negative, the only oriented ruling of this diagram is the one without switches. Rutherford associates to it the number j = number of switches c + = n +. 2 n Now [, Theorem 4 ] says that the so-called oriented ruling polynomial, in this case z j = z n+, agrees with the coefficient of a c = v c = v n in the framed Homfly polynomial of the diagram obtained by smoothing the cusps. Furthermore, the Homfly estimate on the Thurston Bennequin number (which is a consequence of ( 2) and Bennequin s results [] on transverse knots via the transverse push-off trick) implies that this ( n) is the lowest exponent of v that occurs in H 2(v, z). Finally, to obtain information on 2, we substitute v for v. We find that the highest exponent of v in H 2(v, z) is indeed n and that it occurs with the coefficient ( ) n z n+. Note that since the Homfly polynomial of the n-component unlink is ((v v)/z) n, which has left column (coefficient of v n ) z n, Proposition 2 already confirms Theorem 6 for the special case β = n. Next, recall that for any braid, a computation tree can be built using the four types of moves discussed below [6]. Each vertex of the tree carries a label, which either means a braid (word) or some polynomial associated to the (closure of) the braid. At first, labels will be interpreted as braids. The moves are as follows:

6 654 TAMÁS KÁLMÁN Fig. 4. Conway splits. Fig. 5. Positive Markov destabilization changes H by a factor of v. (i) isotopy (braid group relations); (ii) conjugation: β β 2 β 2 β ; (iii) positive Markov destabilization: ασ i B i+ becomes α B i ; (iv) Two types of Conway splits, as shown in Figure 4. The tree is rooted and oriented away from the root. The terminal nodes of the tree are labelled with unlinks on various numbers of strands. To be precise, we should note that isotopy and conjugation take place within the vertices of the tree; that is to say, by labels we really mean certain equivalence classes of braids. This does not lead to ambiguity because these two operations on braids correspond to regular isotopies of the closures. A Markov destabilization also has a very controlled effect, but for us it will be convenient to treat it already as an edge of the tree (the tail of such an edge is a 2-valent vertex). Clearly, Conway splits are mostly responsible for the structure of the graph. A computation tree can be used to evaluate various knot polynomials. In particular, to obtain the framed Homfly polynomial H of the closure of the (label of the) root, we proceed as follows. Label edges resulting from a Conway split as already shown in Figure 4. Any edge representing a Markov destabilization carries the label v (see Figure 5). If a terminal node x is labelled with k, then also label it with the polynomial ((v v)/z) k. Then, this terminal node contributes ( ) v k v h(x), (2 2) z where h(x) is the product of the edge labels that appear along the path that connects x to the root. Finally, the framed Homfly polynomial of the root is the sum of these contributions from all terminal nodes. It is not essential to insist on trivial braids as terminal nodes. The point is that we must know what the framed Homfly polynomials of the labels of the terminal nodes are. Also, note that the subtree generated by any vertex of a computation tree is a computation tree for (the label of) that vertex Proof of Theorem 6 Starting from a computation tree Ɣ for the braid β, we build a computation tree Ɣ for β 2. Of course, we will try to imitate Ɣ as much as possible. In particular, we will attempt to delay altering the full twist in the braid word until after the crossings of β are all removed. (To see to what extent this is possible, we will have to analyse the four basic moves.) Doing so, we will be able to realize Ɣ as a subtree of Ɣ and to read off our result.

7 Twisting braids and the Homfly polynomial 655 Fig. 6. The Conway split (and consequent destabilization) in Ɣ that replaces the Markov destabilization in Ɣ. An important difference between Ɣ and Ɣ is that whenever a Markov destabilization in Ɣ reduces the number of strands, the corresponding vertices of Ɣ will still be labelled with braids on n strands. (This is simply because as long as 2 n is in the braid word, we need n strands.) One may think that the reduced strands live on as trivial ghost strands shown as dotted lines in Figure 5. Two of the four basic steps, namely isotopy and Conway splitting, are completely local and thus they can be carried out unchanged when 2 is attached to the end of β. Conjugation is easy too, since 2 belongs to the centre of B n. Thus, the conjugation move β β 2 β 2 β in Ɣ can be replaced by an isotopy followed by a conjugation β β 2 2 β 2 β 2 β 2 β 2 in Ɣ. (2 ) Markov destabilization however requires more work. If a step ασ i α, as shown in Figure 5, occurs in the computation tree Ɣ, then we will realize it in Ɣ as part of a Conway split; see Figure 6. Of course this gives rise to a new, unnecessary subtree of Ɣ that does not have a counterpart in Ɣ. A precise description is as follows. can be represented by positive braid words that either start or end with arbitrarily chosen braid group generators [2, lemma 2 4 ]. Thus we may write 2 = σ i σ i and hence ασ i 2 = ασi 2 σ i. We perform the Conway split at σi 2. One of the two resulting braids is ασ i σ i = α 2, as desired. Note that contrary to Ɣ, in Ɣ the number of strands did not decrease. The other edge of the Conway split points to the side-product word α σ i. LEMMA 2 2. The closure of the braid α σ i is also the closure of a braid on n strands. Proof. We explain the move pictured at the bottom of Figure 6: the thick part of the left hand side diagram is pulled tight to appear as on the right. The braid σ i is almost a full twist. Its strands can be bundled together into three groups: (i) the i strands whose endpoints are on the top; (ii) the 2 strands right below them; (iii) the remaining n i strands. In other words, we think of σ i as the union of three smaller braids. (In Figure 6, n = 5 and i =, hence we are talking about 2, 2 and strands, respectively.) One by one, these are isotopic to (i) a full twist on i strands; (ii) a single crossing on two strands, represented by σ i in the word; (iii) a full twist on n i strands. These three smaller braids in turn are braided together to form σ i in the fashion of 2.

8 656 TAMÁS KÁLMÁN This time, we consider the pattern 2 as the braid word σ 2σ σ 2 σ σ 2 σ =. Note that its middle strand crosses under only twice, at the third and fourth crossings. Thus the part of the diagram that is thickened in the lower left of Figure 6 contains no undercrossings. Hence it can be lifted and rearranged as shown in the lower right. LEMMA 2. Any extra branch of Ɣ created in our process (starting as shown in the lower part of Figure 6) does not contribute to the coefficient of v n in H β 2. Proof. Lemma 2 2 and Markov s theorem [2] imply that isotopy, conjugation, and a single Markov destabilization reduce α σ i to a braid word η B n.nowby(2 ), any exponent of v in H η (v, z) is n 2 or less. The labels v along the path from η to the root β 2 can only reduce that exponent. We shall now concentrate on the part of Ɣ that is isomorphic to Ɣ. Note that at the terminal nodes, where the trivial braids of Ɣ used to be, now there are copies of 2. LEMMA 2 4. The contribution of a terminal node x of Ɣ to the coefficient of v n in H β 2 agrees (up to sign) with the contribution of the corresponding terminal node x of Ɣ to the coefficient of v n in H β. (In fact, both contributions are a single power of z.) Proof. Let us assume that x is labelled with k. To arrive (in Ɣ) from β to k, there had to be exactly n k Markov destabilizations. Therefore, h(x) =±z m v k n, where m is a natural number. Thus, the coefficient of v n in (2 2) becomes ±z m k+. Now in Ɣ, all n k of those v labels have been changed to z (compare Figures 5 and 6), while other labels along the path remained the same. Hence h( x) =±z m+n k.by Proposition 2, we see that the coefficient of v n in the contribution of x is ±z m+n k ( ) n z n =±( ) n z m k+, as desired. Put together, Lemmas 2 and 2 4 conclude the proof of Theorem 6.. The Hecke algebra The proof presented in the previous section was largely made possible by the simple geometric observation that 2 n commutes with any other element of B n (cf. (2 )), the reduction in strand number observed in Figure 6, and the MFW inequalities themselves. In this section, we outline a second argument that gives Theorem 6. In it, similar simple principles will be at play, but instead of computation trees, we will rely on the Hecke algebra H n (z). Itisof course the central object in Jones s seminal paper [8]; see also [2] for a concise survey. We thank the referee for suggesting this alternative line of proof. As an algebra, H n (z) is generated by σ,...,σ n. In addition to the standard relations of B n (that is, σ i σ j = σ j σ i for i j 2 and σ i σ i+ σ i = σ i+ σ i σ i+ for all i) we impose σ i σ i = z for all i. ( ) The key ingredient in the Homfly polynomial is Ocneanu s trace functional Tr: H n (z) Z[z, T ].Forβ B n, take its natural representation β H n (z) (a common abuse of notation) and its trace, substitute T = z/( v 2 ) in it, and normalize suitably. The result, ( ) v n v H(β) = Tr(β) z, ( 2) T = z v 2 is the framed Homfly polynomial of β.

9 Twisting braids and the Homfly polynomial 657 As a Z[z] module, H n (z) is free of rank n!. We will need two of its well known bases: the set of positive permutation braids, ={ω π } π Sn, and that of negative permutation braids, N ={ν π } π Sn.Now,β can be expressed in these bases with coefficients in Z[z]: β = π S n a π (z)ω π = π S n b π (z)ν π. ( ) PROPOSITION. If δ is the underlying permutation of (and of ), then a δ = b δ. Proof. This is because (positive and negative) permutation braids have standard (positive and negative) braid words representing them and among those, ω δ = and ν δ =, respectively, have the unique longest words (of exponent sum ( n 2) ). When we convert from the ω π to the ν π, we may do so by substituting σ i = σ i + z for each letter, multiplying out and then further reducing each word using σ 2 i = zσ i (cf. ( )). Clearly, ν δ only appears when we convert ω δ, and with the same coefficient. Of course, ν id = ω id = n. Note that as sets, { ν π }={ω π } and { ω π }={ν π }.In particular, ν δ = ω id and ω δ = ν id. Thus, when we use β written in N to expand the braid β in, the polynomial b δ resurfaces as the coefficient of ω id. Similarly, the same polynomial a δ becomes the coefficient of ν id when β is written in terms of N. It turns out that this is exactly the coincidence noted in Theorem 6. Other than the fact that β and β differ by a full twist, we need one more observation for this. Going back to our general braid β, wehave PROPOSITION 2. The polynomial a id (z) equals ( z) n times the coefficient of v n in H(β), and b id (z) is z n times the coefficient of v n. Proof. Along with being linear, conjugation-invariant, and normalized at Tr( n ) =, the key property of the trace is its behaviour under Markov destabilization: Tr(xσ n ) = T Tr(x) for all x H n (z). Similarly, Tr(xσ n ) = (T z)tr(x). Also, note that other than n, any permutation braid admits a Markov destabilization. Hence, as we substitute the expressions of ( ) in ( 2) and distribute, each term contributed by non-trivial positive (resp. negative) permutation braids contains at least the first power of T = zv /(v v) (resp. T z = zv/(v v)). Comparing these with the normalizing factor ((v v)/z) n makes the result apparent. Remark. In light of the last Proposition, we may say that the MFW estimate ( 2) (resp. ( )) is not sharp for the braid β if and only if β is orthogonal to the unit braid as an element of the basis N (resp. ) of the Hecke algebra. 4. Remarks and examples There are several indications that coefficients in the left and right columns of the Homfly polynomial are more geometrically significant than others. For starters, these numbers persist under certain standard changes of variables and/or normalizing conditions. For example, if we require H = (v v)/z instead of H =, then the left and right columns, up to sign and a downward shift, stay the same. The numbers (up to sign) do not change if we use a = v, l = v, m = z etc. either. The next remark explains why the author examined these columns in the first place. The pattern of Theorem emerged while using Knotscape [7] to browse through many examples.

10 658 TAMÁS KÁLMÁN Remark 4. Rutherford [] showed that if the oriented link type K contains Legendrian representatives with sufficiently high Thurston Bennequin number, then the coefficients in the left column of the Homfly polynomial P K (v, z) represent numbers of so-called oriented rulings (of various genera) of these Legendrian links. Similarly, the right column may speak of oriented rulings of the mirror of K. Theorems and 5 however are not about oriented rulings. In particular, the method of the proof of Proposition 2 does not extend to the general case. For instance, if β is a positive braid (as in Example 4) then the left-hand side of ( 5) always contains counts of rulings [9], whereas the right-hand side almost never does. There is also the intriguing possibility that our results could be used to verify Jones s conjecture [8] that the writhe of a braid representative with minimum strand number is an oriented link invariant. Assume that the braids β and β 2 are both on n strands and they have isotopic closures but their exponent sums disagree, say w <w 2. Suppose that the lower MFW bound w 2 n + from β 2 is sharp. Then by ( 5), (v, z) contains non-zero P β2 2 coefficients at v = w 2 + n 2, whereas by ( 6), vanishes at v = w P β 2 + n 2 and above. This is a contradiction if we also hypothesize that the closures of β 2 and β 2 2 are isotopic. There are too many ifs here, however. The last assumption certainly fails, as demonstrated in the next example. (Such counterexamples do not seem to be too common among small knots.) Example 4 2. The 9-crossing mirrored alternating knots 9 27,9 0 and 9 (Rolfsen s numbering) each have 4-braid representatives that make the MFW inequality ( ) sharp. For example, the braids listed in KnotInfo [] σ 2 σ 2 σ σ 2 2 σ σ 2 σ, σ 2 σ 2 2 σ σ 2 σ σ 2 σ, and σ σ 2 σ σ 2 2 σ σ σ 2 σ, respectively have this property. Adding the full twist 2 4 to these braids, in each case we obtain a braid representative of the same knot 2n 87 (from the Hoste Thistlethwaite table). (In other words, 2n 87 has three 4-braid representatives so that adding a full positive twist to each, the three different knots 9 27,9 0, and 9 are obtained. Let us also mention that these braid representatives of 2n 87 are mutually non-isotopic within the solid torus which is the complement of the braid axis.) 9 27 is a slice knot while 9 0 and 9 are not. But even though they represent different concordance classes, all three have signature 0. Their Homfly polynomials are distinct, but each has a left column (coefficient of v 4 )of z 2. Of course, the right column (coefficient of v 4 ) in the Homfly polynomial of 2n 87 is z 2 +. To further underline that Theorem is more about braids than knots, we end the paper with the following extension of Example 4. Example 4. We examine the effect of changing the braid (σ σ 2 ) 5 by positive and negative Markov stabilizations. Let us denote the resulting four-strand braids by β and β,respectively. Of course, the isotopy type of the closure of both is still the (, 5) torus knot, but the lower MFW inequality ( 2) remains sharp only in the first case. See Figure 7 for the Homfly polynomials after adding a full twist to each braid. Note how ( 5) fails to work for β. This is because in this case, ( 6) states that the columns of zeros indicated in Figure 7 agree. (In fact, the closure of (σ σ 2 ) 5 σ 2 4 is the torus knot T (, 0).) From this and [, Theorem 4 ], the sharpness of ( 2) for positive braids follows.

11 Twisting braids and the Homfly polynomial 659 Fig. 7. Stabilizing a braid in two different ways before adding a full twist. Acknowledgements. This paper was written while I was a Japan Society for the Promotion of Science research fellow at the University of Tokyo. It is a particular pleasure to acknowledge the hospitality of Takashi Tsuboi. I also thank Toshitake Kohno for his encouragement, as well as Lenny Ng for helpful discussions. Last but not least, I am grateful to the referee for most of the ideas in Section. REFERENCES [] D. BENNEQUIN. Entrelacements et équations de Pfaff (French; Links and Pfaffian equations). Astérisque (982), [2] J. S. BIRMAN. Braids, links and mapping class groups. Annals of Mathematics Studies 82 (Princeton University Press, 974). [] J. C. CHA and C. LIVINGSTON. KnotInfo: Table of knot invariants. edu/knotinfo (2008). [4] P. CROMWELL. Knots and Links (Cambridge University Press, 2004).

12 660 TAMÁS KÁLMÁN [5] N. M. DUNFIELD, S. GUKOV, and J. RASMUSSEN. The superpolynomial for knot homologies. Experiment. Math. 5 (2006), [6] J. FRANKS and R. F. WILLIAMS. Braids and the Jones polynomial. Trans. Amer. Math. Soc. 0 (987), [7] J. HOSTE and M. THISTLETHWAITE. Knotscape. Available online at edu/ morwen/knotscape.html/. [8] V. JONES. Hecke algebra representations of braid groups and link polynomials. Ann. Math. 26 (987), [9] T. KÁLMÁN. Braid-positive Legendrian links. Int. Math. Res. Not. (2006), Art. ID [0] M. KHOVANOV and L. ROZANSKY. Matrix factorizations and link homology. Fund. Math. 99 (2008), 9. [] H. R. MORTON. Seifert circles and knot polynomials. Math. Proc. Camb. Phil. Soc. 99 (986), [2] H. R. MORTON. Polynomials from braids. In Braids, ed. J. S. Birman and A. Libgober. Contemp. Math. 78 (988), [] D. RUTHERFORD. The Bennequin number, Kauffman polynomial, and ruling invariants of a Legendrian link: the Fuchs conjecture and beyond. Int. Math. Res. Not. (2006), Art. ID [4] H. WU. Braids, transversal links and the Khovanov Rozansky theory. Trans. Amer. Math. Soc. 60 (2008), [5] Y. YOKOTA. Twisting formulae of the Jones polynomial. Math. Proc. Camb. Phil. Soc. 0 (99),