Abstract
We introduce a two-parameters bt-algebra which, by specialization, becomes the one-parameter bt-algebra, introduced by the authors, as well as another one-parameter presentation of it; the invariant for links and tied links, associated to this two-parameter algebra via Jones recipe, contains as specializations the invariants obtained from these two presentations of the bt-algebra and then is more powerful than each of them. Also, a new non Homflypt polynomial invariant is obtained for links, which is related to the linking matrix.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
The bt-algebra is a one-parameter finite dimensional algebra defined by generators and relations, see Aicardi and Juyumaya (2000) and Ryom-Hansen (2011). In Marin (2018) it is shown how to associate to each Coxeter group a certain algebra, and in the case of the Weyl group of type A this algebra coincides with the bt-algebra; this may open new perspectives for the study of the bt-algebra in knot theory, cf. Flores (2020). The representation theory of the bt-algebra has been studied in Ryom-Hansen (2011), Espinoza and Ryom-Hansen (2018), Jacon and Poulain d’Andecy (2017).
For every positive integer n, we denote by \(\mathcal {E}_n(\mathsf {u})\) the bt-algebra over \(\mathbb {C}(\mathsf {u})\), with parameter \(\mathsf {u}\). The original definition of \(\mathcal {E}_n(\mathsf {u})\) is by braid generators \(T_1, \ldots , T_{n-1}\) and tie generators \(E_1,\ldots ,E_{n-1}\), satisfying the defining generators of the tied braid monoid defined in Aicardi and Juyumaya (2016a, Definition 3.1) together with the polynomial relation
It is known that the bt-algebra is a knot algebra: indeed, in Aicardi and Juyumaya (2016b) we have defined a three-variable polynomial invariant for classical links which is denoted by \({\bar{\Delta }}\); this invariant was constructed originally by using the method—also called Jones recipe—that Jones introduced to construct the Homflypt polynomial (Jones 1987).
In Chlouveraki et al. (2020) another presentation for the bt-algebra is considered. More precisely, denote by \(\sqrt{\mathsf {u}}\) a variable such that \((\sqrt{\mathsf {u}})^2 =\mathsf {u}\): the new presentation of the bt-algebra is now over \(\mathbb {C}(\sqrt{\mathsf {u}})\) and is presented by the same tie generators \(E_i\)’s but the generators \(T_i\)’s are replaced by braid generators \(V_i\)’s, still satisfying all original defining relation of the \(T_i\)’s with exception of the polynomial relation above which is replaced by
We denote by \(\mathcal {E}(\sqrt{\mathsf {u}})\) the bt-algebra with this new presentation. Now, again, by using the Jones recipe on the bt-algebra but with the presentation \(\mathcal {E}(\sqrt{\mathsf {u}})\), a three-variable polynomial invariant for classical links is constructed in Chlouveraki et al. (2020); this invariant is denoted by \(\Theta \).
It was noted by the first author that \({\bar{\Delta }}\) and \(\Theta \) are not topologically equivalent, see Aicardi (2016), cf. Chlouveraki et al. (2020); this is an amazing fact that shows the subtlety of the Jones recipe. In fact, the main motivation of this note is to understand the relation between the invariants \({\bar{\Delta }}\) and \(\Theta \). To do that we introduce a bt-algebra with two commuting parameters \(\mathsf {u}\) and \(\mathsf {v}\), denoted by \(\mathcal {E}_n(\mathsf {u}, \mathsf {v})\), presented by the tie generators \(E_i\)’s and braid generators \(R_i\)’s, subject to the same monomial relations as the bt-algebra and the polynomial relations
Similarly to what happens for the two-parameters Hecke algebra (Kassel and Turaev 2008, Subsection 4.2), the bt-algebra with two parameters is isomorphic to the bt-algebra with one parameter, see Proposition 1; this fact allows to define a Markov trace on \(\mathcal {E}_n(\mathsf {u}, \mathsf {v})\) (Proposition 2). Consequently, we apply the Jones recipe to the bt-algebra with two parameters, obtaining a four-variable invariant polynomial, denoted by \(\Upsilon \), for classical links as well its extension \({\widetilde{\Upsilon }}\) to tied links (Aicardi and Juyumaya 2016a). As it will be observed in Remark 2, specializations of the parameters in \(\mathcal {E}_n(\mathsf {u},\mathsf {v})\) yields \(\mathcal {E}_n(\mathsf {u})\) and \(\mathcal {E}_n(\sqrt{\mathsf {u}})\); therefore, the respective specializations of \(\Upsilon \) yields the invariants \({\bar{\Delta }}\) and \(\Theta \); this gives an answer to the initial question that motivated this work.
In Sect. 5 we define \({\widetilde{\Upsilon }}\) by skein relations. We also give a close look to the specialization of \({\widetilde{\Upsilon }}\) at \(\mathsf {v}=1\), which is denoted by \({\widetilde{\Omega }}\). In Theorem 4 we show some properties of \({\widetilde{\Omega }}\) by introducing a generalization of the linking number to tied links. Finally, in Sect. 6 we give a table comparing the invariant \(\Upsilon \) and its specializations considered here. Section 7 is a digression on the bt-algebra, at one and two parameters, in comparison with two different presentations of the Hecke algebra.
2 Preliminaries
Here, \(\mathbb {K}\)-algebra means an associative algebra, with unity 1, over the field \(\mathbb {K}\).
2.1 The Monoid of Tied Braids
As usual we denote by \(B_n\) the braid group on n-strands. The Artin presentation of \(B_n\) is by the braids generators \(\sigma _1,\ldots ,\sigma _{n-1}\) and the relations: \(\sigma _i\sigma _j=\sigma _j\sigma _i\), for \(\vert i-j\vert >1\) and \(\sigma _i\sigma _j\sigma _i = \sigma _j\sigma _i\sigma _j\), for \(\vert i-j\vert =1\). An extension of the braid group \(B_n\) is the monoid of tied braids\(TB_n\), which is a master piece in the study of tied links.
Definition 1
(Aicardi and Juyumaya 2016a, Definition 3.1) \(T\!B_n\) is the monoid presented by the usual braids generators \(\sigma _1, \ldots , \sigma _{n-1}\) together with the tied generators \(\eta _1, \ldots ,\eta _{n-1}\) and the relations:
2.2 The One Parameter bt-Algebra
Set \(\mathsf {u}\) a variable: the bt-algebra \(\mathcal {E}_n(\mathsf {u})\) (Aicardi and Juyumaya 2000; Ryom-Hansen 2011; Aicardi and Juyumaya 2016b) can be conceived as the quotient algebra of the monoid algebra of \(TB_n\) over \(\mathbb {C}(\mathsf {u})\), by the two-sided ideal generated by
See Aicardi and Juyumaya (2016a, Remark 4.3). In other words, \(\mathcal {E}_n(\mathsf {u})\) is the \(\mathbb {C}(\mathsf {u})\)-algebra generated by \(T_1,\ldots ,T_{n-1}\), \(E_1,\ldots ,E_{n-1}\) satisfying the relations (1)–(8), where \(\sigma _i\) is replaced by \(T_i\) and \(\eta _i\) by \(E_i\), together with the relations
We consider now another presentation of the bt-algebra, used in Chlouveraki et al. (2020), Marin (2018). Let \(\sqrt{\mathsf {u}}\) be a variable s.t. \(\sqrt{\mathsf {u}}^2=\mathsf {u}\). We denote by \(\mathcal {E}_n(\sqrt{\mathsf {u}})\) the bt-algebra presented by the generators \(V_1,\ldots , V_{n-1}\) and \(E_1, \ldots , E_{n-1}\), where
The \(V_i\)’s still satisfy the defining relations (1)–(8), substituting \(\sigma _i\) with \(V_i\), \(\eta _i\) with \(E_i\), but equation (10) becomes
2.3 Tied Links
Tied links were introduced in Aicardi and Juyumaya (2016a) and roughly correspond to links which may have ties connecting pairs of points of two components or of the same component. The ties in the diagrams of the tied links are drawn as springs, to outline the fact that they can be contracted and extended, letting their extremes to slide along the components. The ties define a partition of the set of components in this way: two components connected by a tie belong to the same part of the partition. Every classical link can be considered as a tied link without ties; in this case each component form a distinct part of the partition. Alternatively, a classical link can be considered as a tied link in which all components form a sole part.
We denote by \( \mathfrak {L}\) the set of classical links in \(\mathbb {R}^3\) and by \(\widetilde{ \mathfrak {L}}\) the set of tied links. As we have just recalled, \( \mathfrak {L}\subset \widetilde{ \mathfrak {L}}\), but the set \(\mathfrak {L}\) can be identified also with the subset \(\widetilde{ \mathfrak {L}}^*\) of \(\widetilde{ \mathfrak {L}}\), formed by the tied links whose components are all tied. In terms of braids, the situation is as follows. Recall that the tied links are in bijection with the equivalence classes of \(TB_{\infty }\) under the t-Markov moves (Aicardi and Juyumaya 2016a, Theorem 3.7). Now, observe that \(B_n\) can be naturally considered as a submonoid of \(TB_n\) and the t-Markov moves at level of \(B_n\) are the classical Markov moves: this implies the inclusion \( \mathfrak {L}\subset \widetilde{ \mathfrak {L}}\). On the other hand, the group \(B_n\) is isomorphic, as group, to the submonoid \(EB_n\) of \(TB_n\),
where the group isomorphism from \(EB_n\) to \(B_n\), denoted by \(\mathtt {f}\), is given by \(\mathtt {f}(\eta ^n\sigma )=\sigma \). Moreover, two tied braids of \(EB_n\) are t-Markov equivalent if and only if their images by \(\mathtt {f}\) are Markov equivalent. This explains, in terms of braids, the identification between \( \mathfrak {L}\) and \(\widetilde{ \mathfrak {L}}^*\) mentioned above. For more details see Aicardi and Juyumaya (2018, Subsection 2.3).
2.4 Invariants
Invariants for classical and tied links were constructed by using the bt-algebra in the Jones recipe (Jones 1987). We recall some facts and introduce some notations for these invariants:
- (1)
\(\Delta \) and \({\widetilde{\Delta }}\) denote respectively the three-variable invariant for classical links and tied links, defined through the original bt-algebra. The invariant \(\Delta \), called \({\bar{\Delta }}\) in Aicardi and Juyumaya (2016b), is the restriction of \({\widetilde{\Delta }}\) to \( \mathfrak {L}\); the invariant \( {\widetilde{\Delta }}\) was defined in Aicardi and Juyumaya (2016a), where was denoted \(\mathcal {F}\).
- (2)
\(\Theta \) and \({\widetilde{\Theta }}\) denote respectively the three-variable invariant for classical links and tied links, defined in Chlouveraki et al. (2020); the original notation for \({\widetilde{\Theta }}\) was \({\overline{\Theta }}\). Notice that the invariant \(\Theta \) is the restriction of \({\widetilde{\Theta }}\) to \( \mathfrak {L}\).
- (3)
The invariants \({\widetilde{\Delta }}\) and \({\widetilde{\Theta }}\), restricted to \(\widetilde{ \mathfrak {L}}^*\), coincide with the Homplypt polynomial, which is denoted by \(\mathrm {P}=\mathrm {P}(t,x)\); we keep the defining skein relation of \(\mathrm {P}\) as in Jones (1987, Proposition 6.2).
- (4)
The invariants \(\Delta \) and \(\Theta \) coincide with the Homplypt polynomial, whenever they are evaluated on knots; however they distinguish pairs of links that are not distinguished by \(\mathrm {P}\). See Chlouveraki et al. (2020, Theorem 8.3) and Aicardi (2016, Proposition 2).
- (5)
It is intriguing to note that despite the only difference in the construction \(\Delta \) and \(\Theta \) is the presentation used for the bt-algebra, these invariants are not topologically equivalent, see Aicardi (2016), Chlouveraki et al. (2020).
3 The Two-Parameters bt-Algebra
3.1 Generators and Relations
Let \(\mathsf {v}\) be a variable commuting with \(\mathsf {u}\), and set \({\mathbb {K}}= {\mathbb {C}}(\mathsf {u},\mathsf {v})\).
Definition 2
(Cf. Aicardi and Juyumaya 2000; Ryom-Hansen 2011; Aicardi and Juyumaya 2016b) The two-parameter bt-algebra, denoted by \(\mathcal {E}_n(\mathsf {u},\mathsf {v})\), is defined by \(\mathcal {E}_1(\mathsf {u},\mathsf {v}):=\mathbb {K}\) and, for \(n>1\), as the unital associative \(\mathbb {K}\)-algebra, with unity 1, presented by the braid generators \(R_1,\ldots , R_{n-1}\) and the tie generators \(E_1,\ldots , E_{n-1}\), subject to the following relations:
Notice that every \(R_i\) is invertible, and
Remark 1
The algebra \(\mathcal {E}_n(\mathsf {u},\mathsf {v})\) can be conceived as the quotient of the monoid algebra of \(TB_n\), over \(\mathbb {K}\), by the two-sided ideal generated by all expressions of the form \(\sigma _i^2 - 1 - (\mathsf {u}-1)\eta _i - (\mathsf {v}-1)\eta _i \sigma _i\), for all i.
Remark 2
Observe that the original bt-algebra \(\mathcal {E}_n(\mathsf {u})\) is obtained as \(\mathcal {E}_n(\mathsf {u},\mathsf {u})\), while the presentation \(\mathcal {E}_n(\sqrt{\mathsf {u}})\) corresponds to \(\mathcal {E}_n(1,\mathsf {v})\), with \(\mathsf {v}=\sqrt{\mathsf {u}} - \sqrt{\mathsf {u}}\,^ {-1}+1\).
3.2 Isomorphism of bt-Algebras with One and Two Parameters
We show here that the new two-parameters algebra is isomorphic to the original bt-algebra.
Let \(\delta \) be a root of the quadratic polynomial
Define the elements \(T_i\)’s by
Proposition 1
The \(\mathbb {L}\)-algebras \(\mathcal {E}_n(\mathsf {u},\mathsf {v})\otimes _{\mathbb {K}} \mathbb {L}\) and \(\mathcal {E}_n( \mathsf {u}( \delta +1)^2 )\), are isomorphic through the mappings \(R_i\mapsto T_i\), \(E_i\mapsto E_i\), where \(\mathbb {L}\) is the smaller field containing \(\mathbb {K}\) and \(\delta \).
Proof
The \(T_i\)’s satisfy the relations (12)–(19) and we have, using relation (20),
Now, since
we have \(E_iR_i= (\delta + 1)^{-1} E_iT_i\), and substituting we get
Therefore, the coefficients of \(E_i\) and \(E_iT_i\) are equal since \(\delta \) is a root of the polynomial (22). \(\square \)
Remark 3
Notice that the roots of (22) are: \(\mathsf {z}_{\pm }=(\mathsf {v}-1-2\mathsf {u}\pm \sqrt{(\mathsf {v}-1)^2+ 4 \mathsf {u}})/2\mathsf {u}\), so
Thus, for \(\mathsf {v}=\mathsf {u}\), we have: \( \mathsf {z}_+=0\) and \(\mathsf {z}_-= - \mathsf {u}^{-1}(\mathsf {u}+1) \) with the corresponding quadratic relations:
The first solution gives trivially \(\mathcal {E}_n(\mathsf {u})\), while the second one gives another presentation of \(\mathcal {E}_n(\mathsf {u})\), obtained by keeping as parameter \(\mathsf {u}^{-1}\); note that \(\mathcal {E}_n(\mathsf {u}) =\mathcal {E}_n(\mathsf {u}^{-1})\).
On the other hand, for \(\mathsf {u}=1\), we get \( \mathsf {z}_{\pm }= ( \mathsf {v}-3 \pm \sqrt{\mathsf {v}^2-2 \mathsf {v}+ 5 })/2 \) giving
These two solutions determine isomorphisms between \(\mathcal {E}_n(\sqrt{\mathsf {u}})\) and \(\mathcal {E}_n(\mathsf {u})\).
At this point we have to note that there is another interesting specialization of \(\mathcal {E}_n(\mathsf {u},\mathsf {v})\), namely when \(\mathsf {v}=1\). In fact, \(\mathcal {E}_n(\mathsf {u},1)\) deserves a deeper investigation. Here we gives some relations holding only in this specialization. More precisely, we have:
Then we deduce
since \(E_iR_i^{-1}=\mathsf {u}^{-1}E_iR_i\). So,
3.3 Markov Trace on \(\mathcal {E}_n(\mathsf {u},\mathsf {v})\)
Proposition 2
Let \(\mathsf {a}\) and \(\mathsf {b}\) two mutually commuting variables. There exists a unique Markov trace \(\rho =\{\rho _n\}_{n\in \mathbb {N}}\) on \(\mathcal {E}_n(\mathsf {u},\mathsf {v})\), where the \(\rho _n\)’s are linear maps from \(\mathcal {E}_n(\mathsf {u},\mathsf {v})\) to \(\mathbb {L}(\mathsf {a}, \mathsf {b})\), satisfying \(\rho _n(1)=1\), and defined inductively by the rules:
- (1)
\(\rho _n (XY)=\rho _n(YX)\),
- (2)
\(\rho _{n+1}(XR_n)= \rho _{n+1}(XR_nE_n)=\mathsf {a}\rho _n(X) \),
- (3)
\(\rho _{n+1}(XE_n)= \mathsf {b}\rho _n(X)\),
where \(X,Y\in \mathcal {E}_n(\mathsf {u}, \mathsf {v})\).
Proof
The proof follows from Proposition 1, since is obtained by carrying the Markov trace on the bt-algebra (Aicardi and Juyumaya 2016b, Theorem 3) to \(\mathcal {E}_n(\mathsf {u},\mathsf {v})\). More precisely, if we denote by \(\rho '\) the Markov trace on the bt-algebra, then \(\rho \) is defined by \(\rho '\circ \phi \), where \(\phi \) denote the isomorphism of Proposition 1; moreover denoting by \(\mathsf {a}'\) and \(\mathsf {b}'\) the parameters trace of \(\rho '\), we have \(\mathsf {a}= (\delta + 1)^{-1}\mathsf {a}'\) and \(\mathsf {b}=\mathsf {b}'\). \(\square \)
4 Invariants
In this section we define, via Jones recipe, the invariants of classical and tied links associated to the algebra \(\mathcal {E}_n(\mathsf {u},\mathsf {v})\).
4.1 An Invariant for Classical Links
Define the homomorphism \(\pi _{\mathsf {c}}\) from \(B_n\) to \(\mathcal {E}_n(\mathsf {u},\mathsf {v})\) by taking
where the scaling factor \(\mathsf {c}\) is obtained by imposing, due to the second Markov move, that \((\rho \circ \pi _{\mathsf {c}})(\sigma _i)= (\rho \circ \pi _{\mathsf {c}})(\sigma _i^{-1})\); thus
Theorem 1
The function \(\Upsilon :\mathfrak {L} \longrightarrow \mathbb {C}(\mathsf {u},\mathsf {v},\mathsf {a},\sqrt{\mathsf {c}})\), defines an invariant for classical links,
where \(L = {\widehat{\sigma }}\), \(\sigma \in B_n\).
Proof
The proof follows step by step the proof done for the invariant \({\bar{\Delta }}\) in Aicardi and Juyumaya (2016b), replacing the elements \(T_i\) by \(R_i\). Observe that the only differences consist in the expressions of \(\textsf {L}\) (see (46), Aicardi and Juyumaya 2016b), that must be replaced by \(\mathsf {c}\), and of the inverse element, that contains now two parameters. However, it is a routine to check that the proof is not affected by the presence of two parameters instead of one. \(\square \)
Remark 4
From Remark 2 it follows that, respectively, the invariants \(\Delta \) and \(\Theta \) correspond to the specializations \(\mathsf {u}=\mathsf {v}\) and \(\mathsf {u}=1\) with \(\mathsf {v}= \sqrt{\mathsf {u}} -\sqrt{\mathsf {u}}^{\,-1} \) of \(\Upsilon \).
4.2 An Invariant for Tied Links
The invariant \(\Upsilon \) can be extended to an invariant of tied links, denoted by \({\widetilde{\Upsilon }}\), simply extending \( \pi _{\mathsf {c}}\) to \(TB_n\) by mapping \(\eta _i\) to \(E_i\). We denote this extension by \({\widetilde{\pi }}_{\mathsf {c}}\).
Theorem 2
The function \( {\widetilde{\Upsilon }} :\widetilde{\mathfrak {L}} \longrightarrow \mathbb {C}(\mathsf {u},\mathsf {v},\mathsf {a},\sqrt{\mathsf {c}})\), defines an invariant for tied links, where
L being the closure of the n-tied braid \(\eta \).
This theorem will be proved together with Theorem 3 of the next section.
5 The Invariant \({\widetilde{\Upsilon }}\) via Skein Relation
This section is two parts: the first one describes \({\widetilde{\Upsilon }}\) by skein relation and the second is devoted to analyze a specialization \({{\widetilde{\Omega }}}\) of \({\widetilde{\Upsilon }}\).
In the sequel, if there is no risk of confusion, we indicate by L both the oriented tied link and its diagram and we denote by \(L_+, L_-, L_\sim , L_{+,\sim }\) and \(L_{-,\sim }\) the diagrams of tied links, that are identical outside a small disc into which enter two strands, whereas inside the disc the two strands look as shown in Fig. 1.
The following theorem is the counterpart of Aicardi and Juyumaya (2016a, Theorem 2.1).
Theorem 3
The function \({\widetilde{\Upsilon }}\) is defined uniquely by the following three rules:
- I
The value of \({\widetilde{\Upsilon }}\) is equal to 1 on the unknot.
- II
Let L be a tied link. By \( L \sqcup \bigcirc \) we denote the tied link consisting of L and the unknot, unlinked to L. Then
$$\begin{aligned} {\widetilde{\Upsilon }}(L \sqcup \bigcirc \, )= \frac{1}{\mathsf {a}\sqrt{\mathsf {c}} } {\widetilde{\Upsilon }}(L). \end{aligned}$$ - III
Skein rule:
$$\begin{aligned} \frac{1}{ \sqrt{\mathsf {c}}}{\widetilde{\Upsilon }}( L_ +)-\sqrt{\mathsf {c}} {\widetilde{\Upsilon }} (L_-) = \frac{\mathsf {v}-1}{\mathsf {u}} {\widetilde{\Upsilon }} (L_\sim ) + \frac{1}{\sqrt{\mathsf {c}}} (1-\mathsf {u}^{-1} ) {\widetilde{\Upsilon }}(L_{+,\sim }). \end{aligned}$$
Proof
(of Theorems 2 and 3) See the proof done for the invariant \(\mathcal {F}\) in Aicardi and Juyumaya (2016a, Theorem 2.1) replacing the variables z and w respectively by \(\mathsf {a}\) and \(\mathsf {c}\). The definition of t must be replaced by that of \(\mathsf {b}\) given by
according to (31). All steps of the proofs are still holding for the new skein rules involving the new parameter \(\mathsf {v}\).
At this point we have an invariant for tied links \(\widetilde{\Upsilon }\), uniquely defined by the rules I–III. It remains to prove that it coincides with that obtained via Jones recipe: the proof now proceeds exactly as that of Aicardi and Juyumaya (2016a, Theorem 4.5). In this way we have proven also Theorem 2. \(\square \)
Remark 5
Rules I and II imply that the value of the invariant on a collection of n unlinked circles is \( (\mathsf {a}\sqrt{\mathsf {c}})^{1-n}\).
Remark 6
The following skein rule IV is obtained from rule III, adding a tie between the two strands inside the disc. Rules Va and Vb are equivalent to the skein rule III, by using rule IV.
- IV$$\begin{aligned} \frac{1}{\mathsf {u}\sqrt{\mathsf {c}}}{\widetilde{\Upsilon }}( L_ {+,\sim })- \sqrt{\mathsf {c}} {\widetilde{\Upsilon }} (L_{-,\sim }) = \frac{\mathsf {v}-1}{\mathsf {u}} {\widetilde{\Upsilon }} (L_\sim ). \end{aligned}$$
- Va$$\begin{aligned} \frac{1}{ \sqrt{\mathsf {c}} }{\widetilde{\Upsilon }}( L_ {+})= \sqrt{\mathsf {c}} \left[ {\widetilde{\Upsilon }}(L_-) +\left( \mathsf {u}-1 \right) {\widetilde{\Upsilon }}(L_{-,\sim })\right] + \left( \mathsf {v}-1\right) {\widetilde{\Upsilon }} (L_\sim ). \end{aligned}$$
- Vb$$\begin{aligned} \sqrt{\mathsf {c}} {\widetilde{\Upsilon }}( L_ {-})= \frac{1}{ \sqrt{\mathsf {c}}} \left[ {\widetilde{\Upsilon }}(L_+) +\frac{1-\mathsf {u}}{\mathsf {u}} {\widetilde{\Upsilon }}(L_{+,\sim })\right] + \frac{1-\mathsf {v}}{\mathsf {u}} {\widetilde{\Upsilon }} (L_\sim ). \end{aligned}$$
Remark 7
The value of the invariant \({{\widetilde{\Upsilon }}}(\mathsf {u},\mathsf {v})\) on a tied link made by n unlinked circles all tied, is obtained by rule IV (cf. Aicardi and Juyumaya 2016a, Remark 2.3), and it is
The last equality comes from (32).
Remark 8
For tied links in \(\widetilde{ \mathfrak {L}}^*\), the invariant \({{\widetilde{\Upsilon }}}\) is uniquely defined by rules I and IV. Observe that, by multiplying skein rule IV by \(\sqrt{\mathsf {u}}\), we get that \({{\widetilde{\Upsilon }}}\) coincides with the Homflypt polynomial in the variables \( t= \sqrt{\mathsf {u}\mathsf {c}}\) and \( x= (\mathsf {v}-1)/\sqrt{\mathsf {c}}\); that is, if L is the tied link in \(\widetilde{ \mathfrak {L}}^*\), associated to the classical links L, then \( {{\widetilde{\Upsilon }}}(L) =\mathrm {P}( L). \)
Remark 9
The invariants of tied links \({{\widetilde{\Delta }}}\) and \(\widetilde{\Theta }\) are, respectively, the specializations \(\widetilde{\Upsilon }(\mathsf {u},\mathsf {u})\) and \({{\widetilde{\Upsilon }}}(1,\mathsf {v})\).
5.1 The Invariant \(\widetilde{\Omega }\)
We shall denote by \({{\widetilde{\Omega }}}\) the specialization \({{\widetilde{\Upsilon }}}_{\mathsf {u}, \mathsf {v}}\) at \(\mathsf {v}=1\).
We observe firstly that if \(\mathsf {v}=1\) then \(\mathsf {c}=\mathsf {u}^{-1}\), so the invariant \({{\widetilde{\Omega }}} \) takes in fact values in \(\mathbb {C}(\sqrt{\mathsf {u}},\mathsf {a},\mathsf {b})\). The next lemma describes \({{\widetilde{\Omega }}}\) by skein relations and is the key to show its main properties.
Lemma 1
The invariant \({{\widetilde{\Omega }}}\) is uniquely defined by the following rules:
- I
\( {{\widetilde{\Omega }}}(\bigcirc )=1.\)
- II
\({{\widetilde{\Omega }}}(L \sqcup \bigcirc \,)= \mathsf {a}^{-1}\sqrt{\mathsf {u}} \, {{\widetilde{\Omega }}}(L).\)
- III
By \( L \ {\widetilde{\sqcup }} \ \bigcirc \ \) we denote the tied link consisting of the tied link L and the unknot, unlinked to L, but tied to one component of L. Then
$$\begin{aligned} {{\widetilde{\Omega }}}(L \,{\widetilde{\sqcup }} \ \bigcirc \,)= \frac{ \mathsf {b}\sqrt{\mathsf {u}}}{\mathsf {a}} \,{{\widetilde{\Omega }}}(L). \end{aligned}$$ - IV
Skein rule:
$$\begin{aligned} \sqrt{\mathsf {u}}\,{{\widetilde{\Omega }}}( L_ +)-\frac{1}{\sqrt{\mathsf {u}}}\,{{\widetilde{\Omega }}}(L_-) + \sqrt{\mathsf {u}} ( \mathsf {u}^{-1}-1 )\, {{\widetilde{\Omega }}}(L_{+,\sim })=0. \end{aligned}$$
Proof
By comparing the rules of the lemma with those of Theorem 3, we observe that: rule I coincides with rule I for \({{\widetilde{\Upsilon }}}\), rules II and IV are obtained by setting \(\mathsf {v}=1\) in the corresponding rules II and III. Notice that, when the two components of the considered crossing are tied, rule IV becomes
Observe now that the necessity of rule III for defining \({{\widetilde{\Omega }}}\), depends on the fact that the skein rule IV does not involve the diagram \(L_{\sim }\), so that the value of \({{\widetilde{\Omega }}}\) on two unlinked circles tied together cannot be deduced, using skein rules; note this value is chosen by imposing that it coincide with the value obtained through the Jones recipe, and indeed matches with (33). Rule III is in fact the unique point that makes the case \(\mathsf {v}=1\) to be considered separately from Theorem 3. \(\square \)
To present the next result we need to highlight some facts and to introduce some notations.
We start by recalling that the ties of a tied link define a partition of the set of components: if there is a tie between two components, then these components belong to the same class, see Aicardi and Juyumaya (2018, Section 2.1).
Definition 3
We call linking graph of a link, the m-graph whose vertices represent the m components and where two vertices are connected by an edge if the corresponding components have a nonzero linking number. Each edge is labeled by the corresponding linking number.
We generalize the linking number to tied links.
Definition 4
We call class linking number or c-linking number, between two classes of components, the sum of linking numbers of the components of one class with the components of the other class.
Definition 5
We call c-linking graph of a tied link \(L\), the k-graph whose vertices represent the k classes of the \(L\) components and where two vertices are connected by an edge if the corresponding classes have a nonzero c-linking number. Each edge is labeled by the corresponding c-linking number.
Example 1
The links in Fig. 2 have three components: 1, 2 and 3, and two classes, \(A= \{1,3\}\) and \(B=\{2\}\). All crossings have positive sign. The c-linking number between the classes A and B is in both cases equal to 2. The corresponding c-linking graph is shown at right.
Remark 10
For tied links in \(\mathfrak {L}\), the c-linking graph coincides with the linking graph.
Theorem 4
The invariant \({{\widetilde{\Omega }}}\) has the following properties:
- (1)
The value of \({{\widetilde{\Omega }}}\) is equal to 1 on knots.
- (2)
\({{\widetilde{\Omega }}}\) takes the same value on links with the same number of components all tied together. The value depends only on the number of components m, namely it is equal to \((\mathsf {b}\sqrt{\mathsf {u}}/\mathsf {a})^{m-1}\).
- (3)
\({{\widetilde{\Omega }}}\) takes the same value on tied links having the same number of components and the same c-linking graph.
Proof
Rule (34) implies that, given any knot diagram, \({{\widetilde{\Omega }}}\) takes the same value on any other diagram obtained by changing any crossing from positive to negative or viceversa. Thus, it takes the same value also on the diagram corresponding to the unknot: by rule I this value is equal to 1. This proves claim (1).
Claim (2) is a consequence of rule (34) together with rule III of Lemma 1.
Suppose the tied link \({\widetilde{L}}\) has m components, partitioned into k classes. We order arbitrarily the classes, and inside each class, using rule (34), we change the signs of some crossings in order to unlink the components and transform each component into the unknot. Then we start from the first class \(c_1\) and consider in their order all the other classes \(c_i\) linked with it: we mark all the undercrossing of \(c_1\) with \(c_i\) as deciding crossings. Then we pass to the class \(c_2\), we select all classes \(c_j\) linked with it and having indices greater than 2, and mark the undercrossings of \(c_2\) with \(c_j\), so increasing the list of deciding crossings. We proceed this way till the last class. At the end we have obtained an ordered sequence of q pairs of classes characterized by the corresponding c-linking numbers. So, we construct a graph with k vertices, and q ordered edges, labeled with the c-linking numbers.
Consider now the first pair of classes (i, j) in the sequence. We apply the skein rule IV of Lemma 1, to each one of the ndeciding crossings between the components of this pair. These points have signs \(s_1,\ldots ,s_n\). By using rule (34), rule IV becomes, respectively for positive and negative crossings,
So, consider the first deciding point with signs \(s_1\). We have
The two diagrams at the right member are identical, but in the second one there is a tie between the classes i and j. We denote this diagram by \(L^{i\sim j}\); observe that in this diagram the classes i and j merge in a sole class.
To calculate the first term \(\mathsf {u}^{-s_1}{{\widetilde{\Omega }}}( L_{-s_1})\), we pass to the second deciding point, so obtaining a first term \(\mathsf {u}^{-(s_1+s_2)}{{\widetilde{\Omega }}}( L_{-s_2}) \), and a second term \(\mathsf {u}^{-s_1}(1-\mathsf {u}^{-s_2} ) {\widetilde{\Omega }}(L^{i\sim j})\). At the n-th deciding point, we obtain
where \(s_0=0\). Now, \(L_{-s_n}\) is the link obtained by \(L\) by unlinking the classes i and j, that we shall denote by \(L^{i\parallel j}\). By expanding the sum we obtain
The sum \(s_1 + \dots + s_n\) is the sum of the signs of all undercrossings, and therefore equals the c-linking number of the two classes, that we denote by \(\ell (i,j)\). Therefore we get
Observe now that Eq. (35) is a generalized skein relation, that is used to unlink two classes of components (or two components, when the classes contain a sole component), see Fig. 3. The independence of the calculation by skein of \({{\widetilde{\Upsilon }}}\) from the order of the deciding points, implies here the independence of the calculation of \({\widetilde{\Omega }}\) by the generalized skein equation (35) from the order of the pairs of classes.
However, Eq. (35) becomes \( {\widetilde{\Omega }}(L)= {\widetilde{\Omega }}(L^{i\parallel j})\) when the c-linking number is zero. Therefore, the invariant \({\widetilde{\Omega }}\) does not distinguish two linked classes with c-linking number zero from the same classes unlinked. So, we obtain the c-linking graph by deleting the edges labeled by zero in the graph before constructed. Observe that, if there remain p edges with non zero label, the generalized skein relation (35) defines a tree terminating in \(2^p\) diagrams \(L_j\), all having the classes unlinked. These diagrams differ only for a certain number of ties, and each one of them can be represented by a graph obtained from the c-linking graph where each edge is either deleted or substituted by a tie. The value of \({\widetilde{\Omega }}(L)\) is then the sum
Notice that each vertex of the tree is labeled by a pair (x, y) of classes, that is, the classes that are unlinked by the skein rule at that vertex. To calculate the coefficient \(\alpha _j\), consider all the p vertices of the path in the skein tree, going from \(L_j\) to \(L\). For each one of these vertices, say with label (x, y), choose the factor \(\mathsf {u}^{-\ell (x,y)}\) if it is reached from left, otherwise the factor \((1-\mathsf {u}^{-\ell (x,y)})\). The coefficient \(\alpha _j\) is the product of these p factors.
The value \({\widetilde{\Omega }}(L_j)\) depends only on the number m of components, and on the number of classes h, \(h\le k\), of \(L_j\); indeed, by rules II and III of Lemma 1 we have:
To calculate h for the diagram \(L_j\), we start from the c-linking graph of \(L\), and use again the p vertices of the considered path in the skein tree: if the path reaches a vertex labeled (x, y) from left, then the edge (x, y) is eliminated from the graph, otherwise the edge is substituted by a tie. The number of connected components of the graph so obtained, having ties as edges, is the resulting number h of classes, e.g. see Fig. 5.
To conclude the proof, it is now sufficient to observe that the calculation of \({\widetilde{\Omega }}(L)\) depends only on the c-linking graph and on the total number of components of \(L\). \(\square \)
Corollary 1
Let \(L\) be a tied link with m components and k classes. Let r be the exponent of \(\mathsf {a}\) and s the minimal exponent of \(\mathsf {b}\) in \({\widetilde{\Omega }}(L)\). Then \(m=1-r\) and \(k=1-r-s\).
Proof
It follows from Eqs. (36) and (37), noting that the coefficients \(\alpha _i\) depend only on the variable \(\mathsf {u}\). \(\square \)
We shall denote by \(\Omega \) the specialization of \(\Upsilon \) at \(\mathsf {v}=1\), that is, \(\Omega \) is the restriction of \({\widetilde{\Omega }}\) to \( \mathfrak {L}\). We have the following results for classical links.
Corollary 2
The invariant \(\Omega \) has the following properties: \(\Omega \) takes the same value on links having the same linking graph. If L has m components, the exponent of \(\mathsf {a}\) in \(\Omega \) is \(1-m\) and there is a term in \(\Omega \) non containing \(\mathsf {b}\).
Proof
It follows from Theorem 4 and Corollary 1. \(\square \)
Example 2
Consider the link L in Fig. 4. Here \(m=3\), \(c=3\) and \(p=3\). All linking numbers \(\ell (i,j)\) are equal to 1.
The value \(\Omega (L)\) is obtained by adding the value of \(\Omega \) on the \(2^3\) graphs shown in Fig. 5, where they are subdivided in four groups, according to the value of \(\Omega \), i.e., to the number of classes, indicated at bottom. The coefficients, here written for the four groups, are:
whereas the corresponding values of \(\Omega \) are
Then, \(\Omega (L)= \mathsf {u}\mathsf {a}^{-2}( \mathsf {u}^{-3} + 3 \mathsf {b}(\mathsf {u}^{-2}(1-\mathsf {u}^{-1}) )+ 3\mathsf {b}^2 (\mathsf {u}^{-1}(1-\mathsf {u}^{-1})^2 )+ \mathsf {b}^2(1-\mathsf {u}^{-1})^3 )\), so
Finally, observe that \(r=-2\) and \(s=0\); indeed, L has 3 components and 3 classes.
6 Results of Calculations
Here the notations of the links with ten or eleven crossings are taken from Cha and Livingston (2018).
The following table shows eight pairs of non isotopic links with three components, distinguished by \(\Upsilon (\mathsf {u},\mathsf {v})\), but non distinguished by the Homflypt polynomial. A star indicates when they are distinguished also by a specialization of \(\Upsilon (\mathsf {u},\mathsf {v})\).
Observe that, among the eight pairs distinguished by \( \Upsilon (\mathsf {u},\mathsf {v})\), six are distinguished by \( \Upsilon (\mathsf {u},\mathsf {u})\), six by \( \Upsilon (1,\mathsf {v})\); the pair distinguished by both \(\Upsilon (\mathsf {u},\mathsf {u})\) and \( \Upsilon (1,\mathsf {v})\) are four, three of which are distinguished also by \(\Upsilon (\mathsf {u},1)\). We don’t know whether it is necessary, for being distinguished by \(\Upsilon (\mathsf {u},1)\), to be distinguished by all other specializations.
7 Final Remarks
7.1 Other Similar Recent Results
Recently, Jacon and Poulain d’Andecy have constructed an explicit isomorphism between the Yokonuma–Hecke algebra and a direct sum of matrix algebras over tensor products of Iwahori–Hecke algebras, also they have classified the Markov traces on the Yokonuma–Hecke algebra, see Jacon and Poulain d’Andecy (2016, Theorems 3.1, 5.3). In the same paper they defined an invariant of three parameters and have shown that the invariants \(\Theta \) and \(\Delta \) can be obtained from it, see Jacon and Poulain d’Andecy (2016, Subsection 6.5). In Chlouveraki et al. (2020, Appendix) Lickorish found a formula for \(\Theta \) which allows to compute \(\Theta (L)\) through the linking numbers and the Homflypt polynomials of the sublinks of the oriented link L, cf. Poulain d’Andecy and Wagner (2018). On the other hand, in Espinoza and Ryom-Hansen (2018, Theorem 14) Espinoza and Ryom–Hansen proved that the bt-algebra can be considered as a subalgebra of the Yokonuma–Hecke algebra; cf. Jacon and Poulain d’Andecy (2017). This result together with the results of Jacon and Poulain d’Andecy and the formula for \(\Theta \) induce to think that some of the results of this paper, at level of classical links, could be recovered by a combination of the results mentioned before. However, this combination do not imply the results proved here for tied links.
An open problem yet is to know how strong is the four variable invariant \(\Upsilon \) (respectively, \({{\widetilde{\Upsilon }}}\)) with respect to \(\Theta \) and \(\Delta \) (respectively, \({\widetilde{\Theta }}\) and \({\widetilde{\Delta }}\)).
7.2 Different Hecke Algebra Presentations
Denote by \(\mathrm {H}_n(\mathsf {u})\) the Hecke algebra, that is, the \(\mathbb {C}(\mathsf {u})\)-algebra generated by \(h_1, \ldots , h_{n-1}\) subject to the braid relations of type A, together with the quadratic relation
Now, there exits another presentation used to describe the Hecke algebra, which is obtained by rescaling \(h_i\) by \(\sqrt{\mathsf {u}}^{\,-1}\); more precisely, taking \(f_i:= \sqrt{\mathsf {u}}^{\,-1}h_i\). In this case the \(f_i\)’s satisfy the braid relations and the quadratic relation
Denote by \(\mathrm {H}_n(\sqrt{\mathsf {u}})\) the presentation of the Hecke algebra through the \(f_i\)’s. The construction of the Homflypt polynomial can be made indistinctly from any of the above presentations for the Hecke algebra.
The bt-algebra can be regarded as a generalization of the Hecke algebra, in the sense that, by taking \(E_i=1\) in the presentation of the bt-algebra, we get the Hecke algebra; indeed, under \(E_i=1\) the presentations, respectively, of \(\mathcal {E}_n(\mathsf {u})\) and \(\mathcal {E}_n(\sqrt{\mathsf {u}})\) becomes \(\mathrm {H}_n(\mathsf {u})\) and \(\mathrm {H}_n(\sqrt{\mathsf {u}})\). Now we recall that, as we noted in observation 5 of Subsection 2.4, these two presentations of the bt-algebra yield different invariants. The authors don’t know other situations where different presentations of the same algebra produce different invariants.
7.3 Relation with Two Parameters Hecke Algebra
Also the Hecke algebra with two parameters can be considered; that is, by taking two commuting parameters \(\mathsf {u}_1\) and \(\mathsf {u}_2\), and imposing that the generators \(h_i\)’s satisfy \(h_i^2 = \mathsf {u}_1+ \mathsf {u}_2 h_i\), for all i; however, the Hecke algebras with one and two parameters are isomorphic, see Kassel and Turaev (2008, Subsection 4.2); hence, from the algebraic point of view these algebras are the same. Now, regarding the behavior of the Hecke algebra with two parameters \(\mathrm {H}_n(\mathsf {u}_1, \mathsf {u}_2)\), in the construction of polynomial invariants, we have that, after suitable rescaling, \(\mathrm {H}_n(\mathsf {u}_1, \mathsf {u}_1)\) becomes of the type \(\mathrm {H}_n(\sqrt{\mathsf {u}})\) and \(\mathrm {H}_n(\mathsf {u}_1, 0)\) becomes the group algebra of the symmetric group. For \(\mathrm {H}_n(0, \mathsf {u}_2)\), we obtain the so-called 0-Hecke algebra.
We examine now the bt-algebra with one more parameter. Taking \(\mathsf {u}_0,\mathsf {u}_1,\mathsf {u}_2\) and \(\mathsf {u}_3\) commuting variables, it is natural to keep generators \(R_i\)’s instead the \(T_i\)’s, satisfying \(R_i^2= \mathsf {u}_0 + \mathsf {u}_1E_i + \mathsf {u}_2E_iR_i +\mathsf {u}_3 R_i\), for all i; notice that a simple rescaling shows that we can take \(\mathsf {u}_0=1\). Now, we need that these \(R_i\)’s, together with the \(E_i\)’s, satisfy all defining relations of the bt-algebra with the only exception of relation (20); it is straightforward to see that these defining relations hold if and only if we take \(\mathsf {u}_3=0\). This is the motivation for defining the bt-algebra \(\mathcal {E}_n(\mathsf {u},\mathsf {v})\) with two parameters in this paper. Observe that we have a homomorphism from \(\mathcal {E}_n(\mathsf {u},\mathsf {v})\) onto \(\mathrm {H}_n(\mathsf {u}, \mathsf {v}-1)\), defined by sending \(E_i\) to 1 and \(R_i\) to \(h_i\); so, the 0-Hecke algebra is the homomorphic image of \(\mathcal {E}_n(0,\mathsf {v})\).
References
Aicardi, F.: New invariants of links from a skein invariant of colored links (2016). arXiv:1512.00686
Aicardi, F., Juyumaya, J.: An algebra involving braids and ties, ICTP Preprint IC/2000/179 (2000). arxiv:1709.03740.pdf
Aicardi, F., Juyumaya, J.: Tied links. J. Knot Theory Ramifications 25(9), 1641001 (2016a). 28 pp
Aicardi, F., Juyumaya, J.: Markov trace on the algebra of braid and ties. Moscow Math. J. 16(3), 397–431 (2016b)
Aicardi, F., Juyumaya, J.: Kauffman type invariants for tied links. Math. Z. 289, 567–591 (2018)
Cha, J.C., Livingston, C.: LinkInfo: table of knot invariants. http://www.indiana.edu/linkinfo (2018)
Chlouveraki, M., et al.: Identifying the invariants for classical knots and links from the Yokonuma–Hecke algebras. Int. Math. Res. Not. IMRN 1, 214–286 (2020). https://doi.org/10.1093/imrn/rny013
Espinoza, J., Ryom-Hansen, S.: Cell structures for the Yokonuma–Hecke algebra and the algebra of braids and ties. J. Pure Appl. Algebra 222(11), 3675–3720 (2018)
Flores, M.: A bt-algebra of type \(B\). J. Pure Appl. Algebra 224(1), 1–32 (2020)
Jacon, N., Poulain d’Andecy, L.: An isomorphism theorem for Yokonuma–Hecke algebras and applications to link invariants. Math. Z. 283, 301–338 (2016)
Jacon, N., Poulain d’Andecy, L.: Clifford theory for Yokonuma–Hecke algebras and deformation of complex reflection groups. J. Lond. Math. Soc. (2) 96, 501–523 (2017)
Jones, V.F.R.: Hecke algebra representations of braid groups and link polynomials. Ann. Math. 126, 335–388 (1987)
Kassel, C., Turaev, V.: Braid Groups, GTM 247. Springer, Berlin (2008)
Marin, I.: Artin groups and Yokonuma–Hecke algebras. Int. Math. Res. Not. IMRN 13, 4022–4062 (2018)
Poulain d’Andecy, L., Wagner, E.: The HOMFLY–PT polynomials of sublinks and the Yokonuma–Hecke algebras. Proc. R. Soc. Edinb. Sect. A 148(6), 1269–1278 (2018)
Ryom-Hansen, S.: On the representation theory of an algebra of braids and ties. J. Algebr. Combin. 33, 57–79 (2011)
Acknowledgements
The authors thank the referee for important remarks.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
J. Juyumaya was in part supported by the Fondecyt Project 1180036.
Rights and permissions
About this article
Cite this article
Aicardi, F., Juyumaya, J. Two Parameters bt-Algebra and Invariants for Links and Tied Links. Arnold Math J. 6, 131–148 (2020). https://doi.org/10.1007/s40598-020-00138-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40598-020-00138-8