HOMFLYPT skein sub-modules of the lens spaces
Abstract.
In this paper we work toward the HOMFLYPT skein module of , , via braids. Our starting point is the linear Turaev-basis, , of the HOMFLYPT skein module of the solid torus ST, , which can be decomposed as the tensor product of the “positive” and the “negative” sub-modules, and the Lambropoulou invariant, , for knots and links in ST, that captures . It is a well-known result by now that , where bbm’s (braid band moves) denotes the isotopy moves that correspond to the surgery description of . Namely, a HOMFLYPT-type invariant for knots and links in ST can be extended to an invariant for knots and links in by imposing relations coming from the performance of bbm’s and solving the infinite system of equations obtained that way.
In this paper we work with a new basis of , , and we relate the infinite system of equations obtained by performing bbm’s on elements in to the infinite system of equations obtained by performing bbm’s on elements in via a map . More precisely we prove that the solutions of one system can be derived from the solutions of the other. Our aim is to reduce the complexity of the infinite system one needs to solve in order to compute using the braid technique. Finally, we present a generating set and a potential basis for and thus, we obtain a generating set and a potential basis for . We also discuss further steps needed in order to compute via braids.
Key words and phrases:
HOMFLYPT polynomial, skein modules, solid torus, Iwahori–Hecke algebra of type B, mixed links, mixed braids, lens spaces.2010 Mathematics Subject Classification:
57M27, 57M25, 20F36, 20F38, 20C080. Introduction and overview
Skein modules were independently introduced by Przytycki [P] and Turaev [Tu] as generalizations of knot polynomials in to knot polynomials in arbitrary 3-manifolds. The essence is that skein modules are formal linear sums of (oriented) links in a 3-manifold , modulo some local skein relations.
Definition 1.
Let be an oriented -manifold, , the set of all oriented links in up to ambient isotopy in and let be the submodule of generated by the skein expressions , where , and comprise a Conway triple represented schematically by the illustrations in Figure 1.

For convenience we allow the empty knot, , and add the relation , where denotes the trivial knot. Then the HOMFLYPT skein module of is defined to be:
The HOMFLYPT skein module of a 3-manifold is very hard to compute (see [HP] for a survey on skein modules). For example, is freely generated by the unknot ([FYHLMO, PT]). Let now ST denote the solid torus. In [Tu], [HK] the Homflypt skein module of the solid torus has been computed using diagrammatic methods by means of the following theorem:
Theorem 1 (Turaev, Kidwell–Hoste).
The skein module is a free, infinitely generated -module isomorphic to the symmetric tensor algebra , where denotes the conjugacy classes of non trivial elements of .
A basic element of in the context of [Tu, HK], is illustrated in Figure 2. Note that in the diagrammatic setting of [Tu] and [HK], ST is considered as .

is well-studied and understood by now. It forms a commutative algebra with multiplication induced by embedding two solid tori in one in a standard way. Let now denote the sub-algebra of , freely generated by elements that are clockwise oriented (see Fig. 2) and let denote the sub-algebra of , freely generated by elements with counter-clockwise orientation. Let also denote the sub-module generated by elements in whose winding number is equal to and denote the sub-module generated by elements in whose winding number is equal to . As a linear space, is graded by
and similarly, is graded by
Finally, we have the following module decomposition:
The Turaev-basis of is described in Equation 2 in open braid form (see left illustration of Figure 5). In [DL2] a new basis, , of is presented via braids, that naturally describes isotopy in . This basis was obtained by relating the Turaev-basis to via a lower triangular matrix with invertible elements in the diagonal, and is presented in Equation 3 in open braid form (see right illustration of Figure 5). The sets and are presented in Equation 9 and the sets and are presented in Equations 10 and 11 respectively.
In [DLP] the relation between and is established and it is shown that:
(1) |
where corresponds to the relations coming from the performance of all possible braid band moves (or slide moves) on elements in a basis of . More precisely, Eq. (1) suggests that in order to compute , we need to consider elements in , apply all possible bbm’s and identify all linear dependent elements. A step toward a simplification of the above infinite system of equations can be found in [DL4], where it is shown that in order to compute it suffices to consider elements in an augmented set, (Equation 5,) and perform bbm’s only on their first moving strand (the strand that lies closer to the surgery strand), i.e. . In that way more control over the infinite system is obtained.
In this paper we consider the module obtained by solving the infinite system of equations (1), where we only consider elements in , a set related to and that is presented in Eq. 10, and we perform braid band moves on their first moving strands, namely . Similarly, we consider the module obtained by solving the infinite system of equations by considering elements in (Definition 5, Eq. 11), and we perform braid band moves on their first moving strands. We then relate these modules via two maps and defined in Definition 6, and in particular we show that the solution of the system can be derived from the solution of the system . In this way we simplify the infinite system (1). Furthermore, we provide potential bases for and and we present results suggesting that the full solution of the infinite system (1) would correspond to the basis of presented in [GM], and which was obtained using diagrammatic methods. Finally, the braid technique can also be applied for computing other types of skein modules. The interested reader is referred to [D2] and [D3] for the case of Kauffman bracket skein modules of 3-manifolds.
The paper is organized as follows: In §1 we discuss isotopy & braid equivalence for knots and links in ([DL1, LR1]) and in §2 we recall the setting and the essential techniques and results from [La1, La2, LR1, LR2, DL1, DL2, DL3, DL4, DLP] in order to describe the HOMFLYPT skein module of ST via braids. In particular, we present the generalized Hecke algebra of type B, and through a unique trace defined on this algebra, we present the Lambropoulou invariant for knots and links in ST that captures . In §2.2 we present an ordering relation defined on , which is crucial in order to obtain the new basis of , , and in §2.3 we present results from [DL2] that are used in order to relate the sets and via an infinite triangular matrix with invertible elements in the diagonal. Moreover, in §2.4 we briefly discuss the relation of to presented in [DLP, DL4]. In §3 we relate the modules and via the maps and (see §3.2) and in §4 we present generating sets and the potential bases of these modules. Finally, in §4.2 we present further results toward the solution of the infinite system (that is studied in [DL5]), that lead to the [GM]-basis of .
1. Preliminaries
1.1. Mixed Links in
We consider ST to be the complement of a solid torus in and knots in ST are represented by mixed links in . Mixed links consist of two parts, the unknotted fixed part that represents the complementary solid torus in and the moving part that links with . A mixed link diagram is a diagram of on the plane of , where this plane is equipped with the top-to-bottom direction of (see top left hand side of Figure 3). For more details on mixed links the reader is referred to [LR1, LR2, DL1] and references therein.
The lens spaces can be obtained from by surgery on the unknot with integer surgery coefficient . Surgery along the unknot can be realized by considering first the complementary solid torus and then attaching to it a solid torus according to some homeomorphism on the boundary. Thus, isotopy in can be viewed as isotopy in ST together with the band moves in , which reflect the surgery description of . Moreover, in [DL1] it is shown that in order to describe isotopy for knots and links in a c.c.o. -manifold, it suffices to consider only the type band moves (for an illustration see top of Figure 3) and thus, isotopy between oriented links in is reflected in by means of the following result (cf. Thm. 5.8 [LR1], Thm. 6 [DL1] ):
Two oriented links in are isotopic if and only if two corresponding mixed link diagrams of theirs differ by isotopy in ST together with a finite sequence of the type band moves.
1.2. Mixed braids and braid equivalence for knots and links in
By the Alexander theorem for knots and links in the solid torus (cf. Thm. 1 [La2]), a mixed link diagram of may be turned into a mixed braid with isotopic closure. This is a braid in where, without loss of generality, its first strand represents , the fixed part, and the other strands, , represent the moving part . The subbraid is called the moving part of (see bottom left hand side of Figure 3). Then, in order to translate isotopy for links in into braid equivalence, we first perform the technique of standard parting introduced in [LR2] in order to separate the moving strands from the fixed strand that represents the lens spaces . This can be realized by pulling each pair of corresponding moving strands to the right and over or under the fixed strand that lies on their right. Then, we define a braid band move to be a move between mixed braids, which is a band move between their closures. It starts with a little band oriented downward, which, before sliding along a surgery strand, gets one twist positive or negative (see bottom of Figure 3).

The sets of braids related to ST form groups, which are in fact the Artin braid groups of type B, denoted , with presentation:
where the generators and are illustrated in Figure 4(i).
Let now denote the set of oriented knots and links in ST. Then, isotopy in is then translated on the level of mixed braids by means of the following theorem:
Theorem 2 (Theorem 5, [LR2]).
Let be two oriented links in and let be two corresponding mixed braids in . Then is isotopic to in if and only if is equivalent to in by the following moves:
where is the word with all indices shifted by +1. Note that moves (i), (ii) and (iii) correspond to link isotopy in ST.
Notation 1.
We denote a braid band move by bbm and, specifically, the result of a positive or negative braid band move performed on the -moving strand of a mixed braid by .
Note also that in [LR2] it was shown that the choice of the position of connecting the two components after the performance of a bbm is arbitrary.
2. The HOMFLYPT skein module of ST via braids
In [La2] the most generic analogue of the HOMFLYPT polynomial, , for links in the solid torus has been derived from the generalized Iwahori–Hecke algebras of type , , via a unique Markov trace constructed on them. This algebra was defined as the quotient of over the quadratic relations . Namely:
It is also shown that the following sets form linear bases for ([La2, Proposition 1 & Theorem 1]):
where , are the ‘looping elements’ in (see Figure 4(ii)) and a basic element in the Iwahori–Hecke algebra of type A, , for example in the form of the elements in the set [Jo]:
for . In [La2] the bases are used for constructing a Markov trace on , and using this trace, a universal HOMFLYPT-type invariant for oriented links in ST was constructed.

Theorem 3.
[La2, Theorem 6 & Definition 1] Given with specified elements in , there exists a unique linear Markov trace function on :
determined by the rules:
Then, the function
is an invariant of oriented links in ST, where , , is a word in the ’s and ’s, is the closure of , is the exponent sum of the ’s in , the canonical map of on , such that and .
Remark 1.
Note that the use of the looping elements ’s enable the trace to be defined by just extending by rule (4) the three rules of the Ocneanu trace on the algebras ([Jo]).
In the braid setting of [La2], the elements of correspond bijectively to the elements of the following set :
(2) |
As explained in [La2, DL2], the set forms a basis of in terms of braids (see also [HK, Tu]). Note that is a subset of and, in particular, is a subset of . Note also that in contrast to elements in , the elements in have no gaps in the indices, the exponents are ordered and there are no ‘braiding tails’.
Remark 2.
The Lambropoulou invariant recovers . Indeed, it gives distinct values to distinct elements of , since .
2.1. A different basis for
In [DL2], a different basis for is presented, which is crucial toward the computation of and which is described in Eq. 3 in open braid form (for an illustration see Figure 5). In particular we have the following:
Theorem 4.
[DL2, Theorem 2] The following set is a -basis for :
(3) |
The importance of the new basis of lies in the simplicity of the algebraic expression of a braid band move, which extends the link isotopy in ST to link isotopy in and this fact was our motivation for establishing this new basis . Note that comparing the set with the set , we observe that in there are no gaps in the indices of the ’s and the exponents are in decreasing order. Also, there are no ‘braiding tails’ in the words in .

2.2. An ordering in the bases of
We now define an ordering relation in the sets and , which passes to their respective subsets and and that first appeared in [DL2]. This ordering relation plays a crucial role to what will follow. For that we need the notion of the index of a word in any of these sets, denoted . In or is defined to be the highest index of the ’s, resp. of the ’s in . Similarly, in or , is defined as above by ignoring possible gaps in the indices of the looping generators and by ignoring the braiding parts in the algebras . Moreover, the index of a monomial in is equal to .
Definition 2.
[DL2, Definition 2] Let and in , where for all and . Then, we define the following ordering in :
-
(a)
If , then .
-
(b)
If , then:
(i) if , then ,
(ii) if , then:
() if , then ,
() if for all and , then ,
() if for all and and , then ,
() if and , , then .
The ordering in the set is defined as in , where ’s are replaced by ’s.
Notation 2.
We set and , for , for all .
The subsets of level , and , of and respectively ([DL2, Definition 3]), are defined to be the sets:
(4) |
In [DL2] it was shown that the sets and are totally ordered and well ordered for all ([DL2, Propositions 1 & 2]). Note that in [DLP] the exponents in the monomials of are in decreasing order, while here the exponents are considered in increasing order, which is totally symmetric.
We finally define the set , which augments the basis and its subset of level , and we also introduce the notion of homologous words.
Definition 3.
We define the set:
(5) |
and the subset of level , , of :
(6) |
Definition 4.
We shall say that two words and are homologous, denoted , if is obtained from by turning into for all .
2.3. Relating to
We now present results from [DL2] used in order to relate the sets and via a lower triangular matrix with invertible elements in the diagonal. We start by expressing elements in to to expressions containing the ’s. We have that:
Theorem 5 (Theorem 7, [DL2]).
The following relations hold in for :
where , , such that .
Equivalently, the relation in Theorem 5 can be written as:
(7) |
When applying Theorem 5 on an element in , we obtain the homologous word, the homologous word followed by a braiding “tail”, and a sum of lower order terms followed by braiding “tails”. These elements belong to since they may have gaps in their indices, and we manage the gaps applying Theorem 8 in [DL2], namely:
(8) |
where denotes that conjugation is applied in this process.
We now deal with the elements in that are followed by a braiding “tail” in . More precisely we have:
Theorem 6 (Theorem 9, [DL2]).
For an element in followed by a braiding “tail” in we have that:
such that and , for all .
One very important result in [DL2] is that one can change the order of the exponents by using conjugation and stabilization moves on elements in and express them as sums of monomials in ’s with arbitrary exponents and which are of lower order than the initial elements in . Note that both conjugation and stabilization moves are captures by the trace rules, and that we translate here Theorem 9 in [DL2] using the trace.
Theorem 7.
[DL2, Theorem 9] For an element in followed by a braiding “tail” in we have that:
where and for all .
2.4. Relating to .
In order to simplify this system of equations (1), in [DLP] we first show that performing a bbm on a mixed braid in reduces to performing bbm’s on elements in the canonical basis, , of the algebra and, in fact, on their first moving strand. We then reduce the equations obtained from elements in to equations obtained from elements in . In order now to reduce further the computation to elements in the basis of , in [DLP] we manage the gaps in the indices of the looping generators of elements in , obtaining elements in the augmented -module , denoted by . We need to emphasize on the fact that the “managing the gaps” procedure, allows the performance of bbm’s to take place on any moving strand. Then, these equations are shown to be equivalent to equations obtained from elements in the -module , denoted by , by performing bbm’s on any moving strand. We finally eliminate the braiding “tails” from elements in and reduce the computations to the set , where the bbm’s are performed on any moving strand (see [DLP]). Thus, in order to compute , it suffices to solve the infinite system of equations obtained by performing bbm’s on any moving strand of elements in the set . Moreover, in [DL4] we consider the augmented set and show that the system of equations obtained from elements in by performing bbm’s on any moving strand, is equivalent to the system of equations obtained by performing bbm’s on the first moving strand of elements in . It is worth mentioning that although , the advantage of considering elements in the augmented set is that we restrict the performance of the braid band moves only on the first moving strand and, thus, we obtain less equations and more control on the infinite system (1).
The above are summarized in the following sequence of equations:
Namely, we have:
3. Relating the “positive” and “negative” sub-modules of
In this section we relate the infinite system of equations obtained by performing bbm’s on elements in to the infinite system obtained by performing bbm’s on elements in . We present now the sets and in open braid form:
(9) |
We now augment the sets by allowing arbitrary exponents in monomials in the ’s, and we define the the corresponding subsets of of level as follows:
Definition 5.
We define the “positive” subset of :
(10) |
and the the “negative” subset of :
(11) |
The infinite system of equations obtained by performing -’s on elements in is related to the infinite system of equations obtained by performing -’s on elements in by the following maps:
Definition 6.
-
(i)
We define the automorphism such that:
-
(ii)
We define the map , such that:
We now state the main result of this paper:
Theorem 9.
The equations obtained by imposing on the invariant relations coming from the performance of a - on an element in are equivalent to the image of the equations obtained by performing - on its corresponding element in under . That is:
Equivalently we have:
Corollary 1.
The following diagram commutes:
Definition 7.
We will say that the elements and are “symmetric” with respect to the sign of their exponents (or just “symmetric”), although the loop generator appears in both. Moreover, an element in will be called braiding “tail” and two braiding “tails” will be called “symmetric” with respect to the sign of their exponents, if one is obtained from the other by changing to .
3.1. The infinite system
Let , that is . We present some results on the infinite system of equations (1):
We have the following:
Proposition 1.
The unknowns of the system commute.
Proof.
Consider the set of all permutations of the set and let be a bijection from the set to itself. We consider now the elements and , where of the basis of . We have that: and . We compute the invariant on the closures of and , respectively, and we obtain: and . Now, the -component link is isotopic to in , as illustrated in Figure 6 for the case of two components. So, we have that , equivalently,
(12) |
and so the unknowns of the system commute.
Equation 12 holds for any subset of and for any permutation of , hence the unknowns of the system
must commute.
∎

3.2. The modules and
From now on, we will consider all braid band moves to take place on the first moving strand of elements in and we will denote by the result of the performance of a positive and will correspond to the result of the performance of a negative on .
Let and perform a . We have that
and we obtain the equation:
and since , we obtain
(13) |
Consider now and perform a . We have that
and we obtain the equation:
, that is:
(14) |
In order to prove Corollary 1, we first prove that the image of the coefficient in Equation 14 under the map is equal to the coefficient of Equation 13. Indeed we have the following:
Lemma 1.
Proof.
We have that:
∎
We now relate to using the fact that relations used in order to convert elements in to sums of elements in , where is defined as monomials in ’s with positive exponents, are “symmetric”, as shown for example below:
Moreover, these relations lead to in Definition 6(ii), and the rule comes from the fact that , while . The reader is now referred to [La1, La2, DL2, DL3, DL4, DLP] for other “symmetric” relations, and also for more details on the techniques applied in order to obtain the infinite change of basis matrix relating the sets and .
-
Theorem 5 suggests that an element in can be written as a sum of its homologous word in , the element followed by a braiding “tail” and monomials in which are of lower order than the initial monomial .
Similarly, an element in can be written as a sum of its homologous word in , the element followed by a braiding “tail” and monomials in which are of lower order than the initial monomial .
Moreover, as explained above, corresponding coefficients in these two processes will be “symmetric” and the braiding “tails” in , after Theorem 5 is applied, will be “symmetric” to the braiding “tails” in .
-
By Theorem 7 the order of the exponents in an element in can be altered, leading to elements of lower (or even greater) order. For the braiding “tail” occurring after applying Theorem 7, we apply Theorem 6 again, and this procedure will eventually stop and the result will be a sum of elements in of lower order than the initial element. For more details of how this procedure terminates the reader is referred to [DL2] and [DL3].
We now have the following result:
Proposition 2.
For , where , the following relation holds:
where .
Proof.
Let , and . In order to evaluate we use the inverse of the change of basis matrix and express as a sum of elements in , i.e. , where coefficients in for all , such that and , for all . Following the same steps in order to express as a sum of elements in , we prove that we obtain that , where coefficients in for all , such that and , for all , and also that , for all . We prove that by strong induction on the order of .
The base of induction is , where and and . We observe that by Definition 6, and thus .
Assume now that , for all . Then, for we have that:
and for we obtain:
Observe now that and according to Definition 2 we have that
Thus, from the induction step we obtain that .
We now apply Theorems 7, 8, 9 & 10 in [DL2] (relations used for the change of basis matrix and which are Theorems 5, 6, 7 & Eq.(8) in this paper) on and and we use the induction step to reduce the complexity of the relations obtained each time a lower order term appears in the relations. As explained in [DL2, DL4], we will eventually obtain the homologous word in for (coming from ) and the homologous word in for (coming from ), with “symmetric” coefficients. Hence,
∎
In order to proceed with the proof of Corolarry 1, we will need the following relations (Lemma 2 [La2]):
(15) |
and the following lemmas:
Lemma 2.
For , the following relations hold:
Proof.
We only prove relations (i). Relations (ii) follow similarly. For we have that:
For we have:
∎
Lemma 3.
For , the following relations hold:
Proof.
We prove relations (i) by induction on . Relations (ii) follow similarly.
For we have that , which is true. Assume now that the relation holds for . Then, for we have:
∎
We are now in position to prove the following lemma that serves as the basis of the induction applied in the final result of this section, Proposition 3, which will conclude the proof of Corollary 1.
Lemma 4.
Let and . Then, the following relations hold:
Proof.
We only prove that , by strong induction on the order of . The case follows similarly.
The base of induction is the case , i.e. . We have that:
and
Moreover:
Assume now that , for all . Then, for we have:
We have that
Moreover, the terms are of lower order than for all and thus, from the induction step we have that:
For we have:
and
Observe now now that in the term is of lower order than and also that the terms are “symmetric”. From the induction step we have that . For the same reasons . Finally we have that:
and that
The proof is now concluded. ∎
We are now ready to state and prove the final proposition that concludes the proof of Corollary 1.
Proposition 3.
Let , where , and the result of the performance of a positive braid band move on . Let also and the result of the performance of a negative braid band move on . Then, the following relation holds:
Proof.
We only prove that , by strong induction on the order of . The case follows similarly. Let
The base of induction is Lemma 4. Assume now that , for all . Then, for we have that:
and
Observe now that the terms and are “symmetric” and also that the term in has a “gap” in the indices, and thus, it is of lower order than according to Definition 2(b)(ii)(). Note also that in , the terms are “symmetric” with the corresponding terms in for all , and that for , all terms are of lower order than . Thus, from the induction hypothesis, we have that
For in we obtain the element and for in we obtain . These element’s are “symmetric” and we have the following:
We observe again that the terms and are “symmetric” and of lower order than and thus, from the induction hypothesis we have that . For the terms we only have that the coefficients are “symmetric”. The idea is to change the order of particular exponents that will lead to lower order terms in the resulting sum, when applying Theorem 7. We demonstrate this technique for the case :
Similarly for we obtain:
Monomials in ’s in the sums in these relations are “symmetric” and of lower order than the initial monomial, and, assuming , same is true for . The result follows from the induction step. ∎
4. Toward the HOMFLYPT skein module of
In this section we present some results concerning the full solution of the infinite system of equations (1), a solution of which corresponds to computing . We start by only considering equations obtained by the performance of braid band moves on elements in and we prove that the infinite system of equations splits into self-contained subsystems. More precisely:
Lemma 5.
Let . Then , where , such that for all and .
Proof.
It derives directly from the change of basis matrix and the fourth rule of the trace. ∎
Corollary 2.
For we obtain an infinite self-contained system of equations by performing bbm’s on elements in . That is, the system splits into infinitely many self-contained subsystems of equations.
Remark 4.
Note that if instead of considering elements in and performing ’s, we considered elements in the set , and perform ’s, then the infinitely many sub-systems of equations would again be self-contained, but they would be of infinite dimension, i.e. the number of equations and unknowns in each sub-system would be infinite. This is due to the fact that the exponents in the monomials in ’s in are arbitrary (positive and negative). We call such monomials, monomials of “mixed” exponents and we deal with the equations obtained by performing bbm’s on these elements in a sequel paper. For more details the reader is referred to [D].
4.1. Potential bases for the submodules
We now present some sub-systems with their solutions (without evaluating the coefficients) and we present generating sets (which also form potential bases) for and . In particular, we consider elements in the subset of level of , , and we perform positive and negative bbm’s on their first moving strand. We present some of the equations of the infinite system obtained that way:
-
For we have and applying ’s we obtain:
-
For we have and applying ’s we obtain:
-
For we have and applying ’s we obtain:
and thus:
where .
-
Observe now that for a fixed , the set has elements and by performing a positive and a negative bbm on each element in , we obtain equations. We denote the subsystem obtained from elements in by . From Lemma 5 we have that the unknowns in are of the form , such that for all and . Note also that the unknowns of the subsystem are related to the unknowns of the subsystems , by performing ’s, and thus, the solutions of the subsystems
produce a generating set of . Recall also that the unknown of the infinite system , corresponds to the looping generator for any , since ’s are conjugates.
These lead to the following theorem:
Theorem 10.
The set
(16) |
is a generating set of the module .
Remark 5.
Moreover, results on the infinite system so far suggest that each subsystem admits unique solution and thus, is torsion free, which suggest that the following conjecture is true:
Conjecture 1.
The set
forms a basis for .
By Theorem 9 we have that the solution of the infinite system of equations is derived from the solution of the infinite system of equations . Combined with Theorem 10, this leads to the following:
Theorem 11.
The set
is a generating set of the module .
And similarly to Conjecture 1, we have that:
Conjecture 2.
The set
forms a basis for .
4.2. Further Research
We now consider the subsystems of equations obtained by performing braid band moves on elements in . We use Theorem 9 and the equations obtained from elements in , presented above.
-
For we have and: .
-
For the elements in we have:
-
-
and:
where .
-
Observe now for example that the unknown is equal to and that the unknown can be written as a combination of and . Thus, will not be in the basis of . The above examples of equations combined with the equations presented before for the system obtained from elements in , and results from [D], suggest that the following set forms a basis for :
It is worth mentioning that the same set was obtained and proved to be a basis for in [GM] using diagrammatic methods. In [DL5] we work toward proving this result using braids and techniques described within this paper. We have reasons to believe that the braid technique can be successfully applied in order to compute skein modules of other more complicated c.c.o. 3-manifolds (such as the lens spaces ), where diagrammatic methods fail to do so.
References
- [D] I. Diamantis, The HOMFLYPT skein module of the lens spaces via braids, PhD thesis, National Technical University of Athens, 2015.
- [D2] I. Diamantis, (2019) An Alternative Basis for the Kauffman Bracket Skein Module of the Solid Torus via Braids. In: Adams C. et al. (eds) Knots, Low-Dimensional Topology and Applications. KNOTS16 2016. Springer Proceedings in Mathematics & Statistics, vol 284. Springer, Cham.
- [D3] I. Diamantis, The Kauffman bracket skein module of the handlebody of genus 2 via braids, J. Knot Theory and Ramifications, 28, No. 13, 1940020 (2019).
- [DL1] I. Diamantis, S. Lambropoulou, Braid equivalences in 3-manifolds with rational surgery description, Topology and its Applications, 194 (2015), 269-295.
- [DL2] I. Diamantis, S. Lambropoulou, A new basis for the HOMFLYPT skein module of the solid torus, J. Pure Appl. Algebra 220 Vol. 2 (2016), 577-605.
- [DL3] I. Diamantis, S. Lambropoulou, The braid approach to the HOMFLYPT skein module of the lens spaces , Springer Proceedings in Mathematics and Statistics (PROMS), Algebraic Modeling of Topological and Computational Structures and Application, (2017).
- [DL4] I. Diamantis, S. Lambropoulou, An important step for the computation of the HOMFLYPT skein module of the lens spaces via braids, J. Knot Theory and Ramifications, 28, No. 11, 1940007 (2019).
- [DL5] I. Diamantis, S. Lambropoulou, The HOMFLYPT skein module of the lens spaces via braids, in preparation.
- [DLP] I. Diamantis, S. Lambropoulou, J. H. Przytycki, Topological steps on the HOMFLYPT skein module of the lens spaces via braids, J. Knot Theory and Ramifications, 25, No. 14, (2016).
- [FYHLMO] 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), 239-249.
- [GM] B. Gabrovšek, M. Mroczkowski, The Homlypt skein module of the lens spaces , Topology and its Applications, 175 (2014), 72-80.
- [HK] J. Hoste, M. Kidwell, Dichromatic link invariants, Trans. Amer. Math. Soc. 321 (1990), No. 1, 197-229.
- [HP] J.Hoste, J.H.Przytycki, A survey of skein modules of 3-manifolds. Knots 90 (Osaka, 1990), de Gruyter, Berlin, (1992) 363 ?-379.
- [Jo] V. F. R. Jones, A polynomial invariant for links via Neumann algebras, Bull. Amer. Math. Soc. 129, (1985) 103-112.
- [La1] S. Lambropoulou, Knot theory related to generalized and cyclotomic Hecke algebras of type B, J. Knot Theory and its Ramifications 8, No. 5, (1999) 621-658.
- [La2] S. Lambropoulou, Solid torus links and Hecke algebras of B-type, Quantum Topology; D.N. Yetter Ed.; World Scientific Press, (1994), 225-245.
- [LR1] S. Lambropoulou, C.P. Rourke (2006), Markov’s theorem in -manifolds, Topology and its Applications 78, (1997) 95-122.
- [LR2] S. Lambropoulou, C. P. Rourke, Algebraic Markov equivalence for links in -manifolds, Compositio Math. 142 (2006) 1039-1062.
- [P] J. Przytycki, Skein modules of 3-manifolds, Bull. Pol. Acad. Sci.: Math., 39, 1-2 (1991), 91-100.
- [PT] J. H. Przytycki, P. Traczyk, Invariants of links of Conway type, Kobe J. Math. 4 (1987), 115-139.
- [Tu] V.G. Turaev, The Conway and Kauffman modules of the solid torus, Zap. Nauchn. Sem. Lomi 167 (1988), 79–89. English translation: J. Soviet Math. (1990), 2799-2805.