Abstract

In this paper we work toward the HOMFLYPT skein module of L(p,1), S(L(p,1)), via braids. Our starting point is the linear Turaev-basis, Λ′, of the HOMFLYPT skein module of the solid torus ST, S(ST), which can be decomposed as the tensor product of the “positive” Λ′+ and the “negative” Λ′− sub-modules, and the Lambropoulou invariant, X, for knots and links in ST, that captures S(ST). It is a well-known result by now that S(L(p,1))=S(ST)<bbm′s>, where bbm's (braid band moves) denotes the isotopy moves that correspond to the surgery description of L(p,1). Namely, a HOMFLYPT-type invariant for knots and links in ST can be extended to an invariant for knots and links in L(p,1) 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 S(ST), Λ, 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 I. 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 S(L(p,1)) using the braid technique. Finally, we present a generating set and a potential basis for Λ+<bbm′s> and thus, we obtain a generating set and a potential basis for Λ−<bbm′s>. We also discuss further steps needed in order to compute S(L(p,1)) via braids.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.