Twisted virtual braids and twisted links
Komal Negi, Madeti Prabhakar, Seiichi Kamada

TL;DR
This paper extends classical knot theory to twisted virtual braids and links, establishing fundamental theorems and algebraic structures that generalize known results to this new context.
Contribution
It proves Alexander and Markov theorems for twisted virtual links and provides group presentations for the twisted virtual braid group.
Findings
Established Alexander theorem for twisted virtual links
Proved Markov theorem for twisted virtual links
Provided group and reduced group presentations for the twisted virtual braid group
Abstract
Twisted knot theory introduced by M. Bourgoin is a generalization of knot theory. It leads us to the notion of twisted virtual braids. In this paper we show theorems for twisted links corresponding to the Alexander theorem and the Markov theorem in knot theory. We also provide a group presentation and a reduced group presentation of the twisted virtual braid group.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology
Twisted virtual braids and twisted links
Komal NEGI
Department of Mathematics, Indian Institute of Technology Ropar, Punjab, India.
,
Madeti PRABHAKAR
Department of Mathematics, Indian Institute of Technology Ropar, Punjab, India.
and
Seiichi KAMADA
Department of Mathematics, Osaka University, Toyonaka, Osaka 560-0043, Japan
Abstract.
Twisted knot theory introduced by M. Bourgoin is a generalization of knot theory. It leads us to the notion of twisted virtual braids. In this paper we show theorems for twisted links corresponding to the Alexander theorem and the Markov theorem in knot theory. We also provide a group presentation and a reduced group presentation of the twisted virtual braid group.
Key words and phrases:
Twisted knots, twisted virtual braids, Alexander theorem, Markov theorem.
2020 Mathematics Subject Classification:
57K10, 57K12
1. Introduction
M. O. Bourgoin [1] introduced twisted knot theory as a generalization of knot theory. Twisted link diagrams are link diagrams on possibly with some crossings called virtual crossings and bars which are short arcs intersecting the arcs of the diagrams. Twisted links are diagrammatically defined as twisted link diagrams modulo isotopies of and local moves called extended Reidemeister moves which are Reidemeister moves (R1, R2, R3), virtual Reidemeister moves (V1, V2, V3, V4) and twisted moves (T1, T2, T3) depicted in Figure 1. Twisted links correspond to stable equivalence classes of links in oriented three-manifolds which are orientation I-bundles over closed but not necessarily orientable surfaces.
Twisted links are analogous to virtual links introduced by L. H. Kauffman [7]. Virtual link diagrams are link diagrams on possibly with some virtual crossings. Virtual links are defined as virtual link diagrams modulo isotopies of and local moves called generalized Reidemeister moves which are Reidemeister moves (R1, R2, R3) and virtual Reidemeister moves (V1, V2, V3, V4) depicted in Figure 1. Virtual links correspond to stable equivalence classes of links in oriented three-manifolds which are orientation I-bundles over closed oriented surfaces.
The Alexander theorem states that every link is represented as the closure of a braid, and the Markov theorem states that such a braid is unique modulo certain moves so called Markov moves. In virtual knot theory, analogous theorems are established in [8, 9].
In this paper we show theorems for twisted links corresponding to the Alexander theorem and the Markov theorem. We also provide a group presentation and a reduced group presentation of the twisted virtual braid group.
This article is organized as follows. In Section 2, we state the definition of the twisted virtual braid group and provide a group presentation of the group. In Section 3, the Alexander theorem for twisted links is shown by introducing a method of braiding a given twisted link diagram, which we call the braiding process. In Section 4, we give the statement of the Markov theorem for twisted links and prove it. In Section 5, virtual exchange moves are discussed. In Section 6, we give a reduced presentation of the twisted virtual braid group, and concluding remarks.
2. The twisted virtual braid group
Let be a positive integer.
Definition 2.1**.**
A twisted virtual braid diagram on strands (or of degree ) is a union of smooth or polygonal curves, which are called strands, in connecting points with points , where is a permutation of the numbers , such that these curves are monotonic with respect to the second coordinate and intersections of the curves are transverse double points equipped with information as a positive/negative/virtual crossing and strings may have bars by which we mean short arcs intersecting the strings transversely. See Figure 2, where the five crossings are negative, positive, virtual, positive and positive from the top.
Here is an alternative definition.
Definition 2.2**.**
Let be and let be the second factor projection. A twisted virtual braid diagram of strands (or of degree ) is an immersed 1-manifold in E, where are embedded arcs, called strands, possibly with bars by which we mean short arcs intersecting the strands transversely, satisfying the following conditions (1)–(5):
- (1)
.
- (2)
For each , is a homeomorphism.
- (3)
The set of multiple points of the strands consists of transverse double points, which are referred as crossings of the diagram.
- (4)
Each crossing is equipped with information of a positive crossing, a negative crossing or a virtual crossing.
- (5)
Every bar avoids the crossings.
Let denote the set of crossings of and the points on the strands where bars intersect with. A twisted virtual braid diagram is said to be good if it satisfies the following condition.
- (6)
The restriction map is injective.
The twisted virtual braid diagram depicted in Figure 2 is good. On the other hand, the twisted virtual braid diagram depicted in Figure 3 is not good, since there exist a pair of bars lying in for some , or since there exists a virtual crossing and a bar lying in for some .
Definition 2.3**.**
Two twisted virtual braid diagrams and of degree are equivalent if there is a finite sequence of twisted virtual braid diagrams of degree , say , with and such that for each , is obtained from by one of the following:
- •
An isotopy of keeping the conditions (1)–(5) of a twisted virtual braid diagram.
- •
An extended Reidemeister move.
A twisted virtual braid is an equivalence class of twisted virtual braid diagrams.
The set of twisted virtual braids forms a group, where the product is defined by the concatenation similar to the braid group such that is on when we draw the braid diagram vertically. The twisted virtual braid group is denoted by .
Let , , and be twisted virtual braid diagrams depicted in Figure 4. Twisted virtual braids represented by them will be also denoted by the same symbols. The group is generated by , and , which we call standard generators.
Figure 5 shows classical braid moves, corresponding to R2 and R3. Figure 6 shows virtual braid moves, corresponding to V2, V3, and V4. (There are some other moves corresponding to R3 and V4. However, it is well known that those moves are equivalent to the moves in the figure, cf. [8].)
We call the two moves depicted in the top row of Figure 7 twisted braid moves of type , and the move on the left of the second row a twisted braid move of type . The move on the right of the bottom is called a twisted braid move of type or of type . When we replace the positive crossings with negative ones, it is called a twisted braid move of type or of type .
Braid moves corresponding to extended Reidemeister moves are classical braid moves, virtual braid moves and twisted braid moves.
Theorem 2.4**.**
The twisted virtual braid group is generated by standard generators, , and , and the following relations are defining relations, where denotes the identity element:
[TABLE]
Remark 2.5**.**
Using , we see that relations and are equivalent the following and , respectively:
[TABLE]
Remark 2.6**.**
There are two kinds of twisted braid moves of type as shown in Figure 7. The left one corresponds to relations and the right one to :
[TABLE]
Using , we see that relations are equivalent to .
Remark 2.7**.**
There are two kinds of twisted braid moves of ; one is type as shown in Figure 7 and the other is type . The former corresponds to relations and the latter to :
[TABLE]
Using and , we see that relations are equivalent to .
Proof.
Note that the inverse elements of and in are themselves. Let be the set of standard generators of and let be the set of standard generators and their inverse elements of :
[TABLE]
Let be a twisted virtual braid diagram. When it is good, it is presented uniquely as a concatenation of elements of , which we call a preferred word of . When it is not good, one can modify it slightly by an isotopy of keeping the condition of a twisted virtual braid diagram to become good. Thus, generates the group .
Let and are good twisted virtual braid diagrams. Suppose that is obtained from by an isotopy of keeping the condition of a twisted virtual braid diagram. Then they are related by a finite sequence of changing heights of a pair of points in . A single height change of a pair of such points corresponds to one of relations (1), (4), (6), (9), (10), (11) and variants of (1), (6) and (11) with replaced by and/or replaced by . Note that the variants are consequences of the original relations up to relations (3) and (8). Thus, we see that the preferred words of and are congruent modulo relations (1), (4), (6), (9), (10), (11) and relations (3) and (8).
Suppose that is obtained from by an extended Reidemeister move. When the move is R2, the change of preferred words corresponds to , which is a trivial relation. When the move is R3, it is well known that the change of preferred words corresponds to a relation which is a consequence of relations (2). When the move is V2, the change of preferred words corresponds to relations (3). When the move is V3, the change of preferred words corresponds to relations (5). When the move is V4, we may assume that it is the move as in Figure 5, which corresponds to relations (7). When the move is T1, the change of preferred words corresponds to relations (12) or (16). When the move is T3, the change of preferred words corresponds to relations (13) or (17). Therefore we see that the preferred words of and are congruent each other modulo all relations (1)–(13).
Since all relations (1)–(13) are valid in the group , these relations are defining relations. ∎
Remark 2.8**.**
The twisted virtual group is different from the ring group ([2]) or the extended welded braid group ([5]). Brendle and Hatcher [2] discussed the space of configurations of unlinked Euclidean circles, called rings, whose fundamental group is the ring group . They showed that the ring group is isomorphic to the motion group of the trivial link of components in the sense of Dahm [3]. The ring group has a finite index subgroup isomorphic to the braid-permutation group, also called the welded braid group, introduced by Fenn, Rimányi and Rourke [6]. Damiani [4] studied the ring group from various points of view. In particular, she introduced in [5] the notion of the extended welded braid group defined by using diagrams motivated from the work of Satoh [11]. Damiani’s extended welded braid group is isomorphic to the ring group.
The twisted virtual braid group is different from the ring group and the extended welded braid group for , since they admit a relation , which is not allowed in the twisted virtual braid group .
3. Braid presentation of twisted links
The closure of a twisted virtual braid (diagram) is defined by a similar way for a classical braid.
Example 3.1**.**
The closure of a twisted virtual braid diagram is shown in Figure 8.
In this section we show that every twisted link is represented by the closure of a twisted virtual braid diagram (Theorem 3.6).
3.1. Gauss data
For a twisted link diagram , we prepare some notation:
- •
Let be the set of all real crossings of .
- •
Let be the map from to the set assigning the signs to real crossings.
- •
Let be the set of all bars in .
- •
Let be a regular neighborhood of , where .
- •
For , we denote by , and the four points of as depicted in Figure 9.
- •
For , we denote by and the two points of as depicted in Figure 10.
- •
Put , where means the closure.
- •
Let , and
- •
Let be the restriction of to , which is a union of some oriented arcs and loops generically immersed in such that the double points are virtual crossings of , and the set of boundary points of the arcs is the set
- •
Let be the number of components of .
- •
Define a subset of such that if and only if has an oriented arc starting from and ends at .
The Gauss data of a twisted link diagram is the quintuple
[TABLE]
Example 3.2**.**
Let be a twisted link diagram depicted in Figure 11. When we name the real crossings and as in the figure, the Gauss data is
[TABLE]
We say that two twisted link diagrams and have the same Gauss data if and there exists a bijection satisfying the following conditions:
- •
, and .
- •
preserves the signs of real crossings; for .
- •
if and only if , where is the bijection induced from , i.e., for and for .
Let be a twisted link diagram and as before. Suppose that is a twisted link diagram with the same Gauss data with . Then by an isotopy of we can move such that
- •
and are identical in for every ,
- •
has no real crossings and bars in , and
- •
there is a bijection between the arcs/loops of and those of with respect to the endpoints of the arcs.
In this situation, we say that is obtained from by replacing .
Lemma 3.3**.**
Let and be twisted link diagrams, and let .
(1) If is obtained from by replacing , then they are related by a finite sequence of isotopies of with support and V1, V2, V3, V4, and T1 moves.
(2) If two twisted link diagrams and have the same Gauss data, then is equivalent to .
Proof.
(1) Let be regular neighborhoods of the real crossings and bars of . Let and be the arcs/loops of and respectively. Using an isotopy of with support , we may assume that the intersection of with are transverse double points. The arc/loop is homotopic to in (relative to the boundary when is an arc). Taking the homotopy generically with respect to the arcs/loops , and the 2-disks , we see that the arc/loop can be changed into by a finite sequence of moves as shown in Figure 12 up to isotopy of with support . Considering that all crossings in Figure 12 are virtual crossings, we regard these moves as V1, V2, V3, V4, and T1 moves. In this way, we can change into without changing other arcs/loops of and . Applying this argument inductively, all arcs/loops of change into the corresponding ones of .
(2) Moving by an isotopy of , we may assume that is obtained from by replacing . By (1), we obtain the assertion. ∎
3.2. Braiding process
Let be the origin of and identify with by polar coordinates, where is the set of positive numbers. Let denote the radial projection.
For a twisted link diagram , we denote by the set of real crossings, by the set of points on where bars intersect with, and by the set of all (real or virtual) crossings and the set of points on where bars intersect with.
Definition 3.4**.**
A closed twisted virtual braid diagram is a twisted link diagram satisfying the following conditions (1) and (2):
- (1)
is contained in .
- (2)
Let be the underlying immersion of , where is a disjoint union of copies of . Then is a covering map of of degree which respects the orientations of and .
A closed twisted virtual braid diagram is good if it satisfies the following condition.
- (3)
Let be regular neighborhoods of the real crossings and bars of . Then for .
Proposition 3.5**.**
Every twisted link diagram is equivalent, as a twisted link, to a good closed twisted virtual braid diagram such that and have the same Gauss data.
Proof.
Let be a twisted link diagram and let be regular neighborhoods of the real crossings and bars of . Moving by an isotopy of , we may assume that all are in , for and the restriction of to satisfies the condition of a closed twisted virtual braid diagram. Replace the remainder such that the result is a good closed twisted virtual braid diagram . Then and have the same Gauss data, and by Lemma 3.3 they are equivalent as twisted links. ∎
The procedure in the proof of Proposition 3.5 makes a given twisted link diagram to a good closed twisted virtual braid diagram having the same Gauss data with . This is the braiding process in our paper.
A point of is called a regular value for a closed twisted virtual braid diagram if . Cutting along the half line for a regular value of , we obtain a twisted virtual braid diagram whose closure is equivalent to .
Thus, Proposition 3.5 implies the following.
Theorem 3.6**.**
Every twisted link is represented by the closure of a twisted virtual braid diagram.
4. The Markov theorem for twisted links
In this section we show a theorem on braid presentation of twisted links which is analogous to the Markov theorem for classical links.
A twisted Markov move of type [math] or a TM0-move is a replacement of a twisted virtual braid diagram with another of the same degree such that and are equivalent as twisted virtual braids, i.e., they represent the same element of the twisted virtual braid group.
A twisted Markov move of type or a TM1-move is a replacement of a twisted virtual braid (or its diagram) with where is a twisted virtual braid (or its diagram) of the same degree with . We also call this move a conjugation.
A twisted Markov move of type or a TM1-move may be defined as a replacement of a twisted virtual braid (or its diagram) with where and are twisted virtual braids (or their diagrams) of the same degree. See Figure 13.
For a twisted virtual braid (or its diagram) of degree and non-negative integers and , we denote by the twisted virtual braid (or its diagram) of degree obtained from by adding trivial strands to the left and trivial strands to the right. This defines a monomorphism .
A stabilization of positive, negative or virtual type is a replacement of a twisted virtual braid (or its diagram) of degree with , or , respectively.
A twisted Markov move of type or a TM2-move is a stabilization of positive, negative or virtual type, or its inverse operation. See Figure 14.
A right virtual exchange move is a replacement
[TABLE]
and a left virtual exchange move is a replacement
[TABLE]
where and are twisted virtual braids (or their diagrams). A twisted Markov move of type or a TM3-move is a right/left virtual exchange move or its inverse operation. See Figure 15.
Definition 4.1**.**
Two twisted virtual braids (or their diagrams) are Markov equivalent if they are related by a finite sequence of twisted Markov moves TM1–TM3 (or TM0–TM3 when we discuss them as diagrams).
Theorem 4.2**.**
Two twisted virtual braids (or their diagrams) have equivalent closures as twisted links if and only if they are Markov equivalent.
Remark 4.3**.**
In Section 5, it turns out that if two twisted virtual braids (or their diagrams) is related by a left virtual exchange move then they are related by a sequence of TM1-moves (or TM0-moves and TM1-moves when we discuss them as diagrams) and a right virtual exchange move. Thus we may remove left virtual exchange moves from the definition of Markov equivalence.
Let and be closed twisted virtual braid diagrams and let and be twisted virtual braid diagrams obtained from and by cutting along and for some regular values and . We say that is obtained from by a twisted Markov move of type [math] or a TM0-move if they are equivalent as closed twisted virtual braids. Note that is obtained from by a TM0-move if and only if and are related by a finite sequence of TM0-moves and TM1-moves. We say that is obtained from by a twisted Markov move of type or a TM2-move if and are related by a TM2-move and some TM1-moves. We say that is obtained from by a twisted Markov move of type or a TM3-move if and are related by a TM3-move and some TM1-moves.
Definition 4.4**.**
Two closed twisted virtual braid diagrams and are Markov equivalent if they are related by a finite sequence of TM0-, TM2- and TM3-moves.
Proposition 4.5**.**
Two closed twisted virtual braid diagrams and are Markov equivalent if and only if twisted virtual braid diagrams and are Markov equivalent, where and are obtained from and by cutting along and for some regular values and .
Proof.
For a given closed twisted virtual braid diagram , is uniquely determined up to TM1-moves. Then the assertion is trivial by definition. ∎
By Proposition 4.5, Theorem 4.2 is equivalent to the following theorem.
Theorem 4.6**.**
Two closed twisted virtual braid diagrams are equivalent as twisted links if and only if they are Markov equivalent.
To prove Theorem 4.6, we require the following lemma.
Lemma 4.7**.**
Two closed twisted virtual braid diagrams with the same Gauss data are Markov equivalent.
Proof.
Let and be closed twisted virtual braids with the same Gauss data. Modifying them by isotopies of , we may assume that they are good. Let be regular neighborhoods of the real crossings and bars of , and be regular neighborhoods of the corresponding real crossings and bars of .
Case (I). Suppose that and appear in in the same cyclic order. Modifying by an isotopy of keeping the condition of a good closed twisted virtual braid, we may assume that and the restrictions of and to these disks are identical. Let be the arcs/loops of and be the corresponding arcs/loops of . Let be a regular value for and such that is disjoint from . If there exists an arc/loop of such that , then move a small segment of or toward the origin by some V2 moves which are
TM0-moves and apply some VM2-moves of virtual type so that after the modification. Thus without loss of generality, we may assume that for all .
Let and be the underlying immersions of and , respectively, such that they are identical near the preimages of the real crossings and bars. Let be arcs/loops in with and for . Note that and are orientation-preserving immersions into with . Since and have the same degree, so we have a homotopy of relative to the boundary such that and and is an orientation-preserving immersion. Taking such a homotopy generically with respect to the other arcs/loops of and and the 2-disks , we see that can be transformed to by a sequence of TM0-moves. Apply this procedure inductively, we can change to by a sequence of TM0-moves and TM2-moves. Thus we see that is transformed into by a finite sequence of TM0 and TM2-moves.
Case (II). Suppose that and do not appear in in the same cyclic order. It is sufficient to show that we can interchange the position of two consecutive ’s. Suppose that we want to interchange and .
(1) Suppose that is a neighborhood of a real crossing. Figure 16 shows how to interchange and by TM0-moves and TM2-moves.
(2) Suppose that is a neighborhood of a bar. Figure 17 shows how to interchange and by TM0-moves and TM2-moves.
Applying this argument, we can make and to appear in the same cyclic order on using VM0 and VM2-moves. Then we can reduce the case to Case (I). ∎
Proof of Theorem 4.6.
If two closed twisted virtual braids (or their diagrams) are Markov equivalent then they are equivalent as twisted links. Conversely, suppose that and are closed twisted virtual braid diagrams which are equivalent as twisted links. There is a finite sequence of twisted link diagrams, say, such that is obtained from by one of the extended Reidemeister moves.
For each , may not be a closed twisted virtual braid diagram. Let be a closed twisted virtual braid diagram obtained from by the braiding process in the previous section. We assume and . Then for each , and have the same Gauss data. It is sufficient to prove that and are Markov equivalent.
It is shown in [9] that and are Markov equivalent when is obtained from by one of R1, R2, R3, V1, V2, V3, and V4. (In [9] virtual links and closed virtual braid diagrams are discussed. However the argument in [9] is valid in our current situation.)
Thus, it is sufficient to consider a case that is obtained from by a twisted move T1, T2 or T3.
(1) Let be obtained by from a T1 move. Then and have same Gauss data, and hence and have same Gauss data. By Lemma 4.7, and are Markov equivalent.
(2) Let be obtained by by a T2 move. Assume that a pair of bars in is removed by the T2 move to obtain . Let be a -disk where the T2 move is applied such that is an arc, say , with two bars and is the arc . Let and be neighborhoods of the two bars such that . By an isotopy of , deform , and such that is with two bars and is an orientation-preserving embedding. Let be a closed twisted virtual braid obtained from the deformed by applying the braid process in the previous section such that is pointwise fixed, and let be a closed twisted virtual braid obtained from by removing the two bars intersecting . Then and are related by a TM0-move. Since and have the same Gauss data, they are Markov equivalent. Since and have the same Gauss data, they are Markov equivalent. Thus and are Markov equivalent. The case that a pair of bars are introduced to to obtain is shown similarly.
(3) Let be obtained from by a T3 move. There are 4 possible orientations for a T3 move, say T3a, T3b, T3c, and T3d as in Figure 18.
First consider a case that is obtained from by a move T3a or T3b. Assume that is as in the left and is as in the right of Figure 18. Let be a -disk where the move is applied. Then is a pair of arcs, say and , intersecting transversely at a real crossing and there are four bars. Let be a neighborhood of the real crossing of and be neighborhoods of the four bars of in such that . By an isotopy of , deform , , , and such that and are orientation-preserving embeddings. Let be a closed twisted virtual braid diagram obtained from the deformed by applying the braid process in the previous section such that is pointwise fixed, and let be a closed twisted virtual braid diagram obtained from by applying a T3a (or T3b) move. Then and are related by a TM0-move. Since and have the same Gauss data, they are Markov equivalent. Since and have the same Gauss data, they are Markov equivalent. Thus and are Markov equivalent. The case that is as in the right and is as in the left of the figure is shown similarly.
Now consider the case that is obtained from by a move T3c or T3d. Note that a move T3c (or T3d) is a consequence of a move T3b (or T3a) modulo moves V1, V2, V3, and V4. One can see this by rotating the two diagrams in T3c (or T3d) by 90 degrees clockwise. Then the left hand side becomes the same diagram with the left hand side of T3b (or T3a). The right hand side of T3c (or T3d) after the rotation has a real crossing and no bars. One can see that the right hand side of T3b (or T3a) also has a real crossing and no bars. Considering the Gauss data of the tangle in and applying the same argument to the proof of Lemma 4.7, we see that the right hand side of T3c (or T3d) after the rotation is transformed to the right hand side of T3b (or T3a) by V1, V2, V3, and V4 moves in . Thus we can reduce the case to T3a (or T3b) and the case of V1, V2, V3, and V4 moves. ∎
5. On virtual exchange moves of twisted virtual braids
It turns out that if two twisted virtual braids (or their diagrams) are related by a left virtual exchange move then they are related by a sequence of TM1-moves (or TM0-moves and TM1-moves) and a right virtual exchange move. Thus we may remove left virtual exchange moves from the definition of Markov equivalence.
Let be an isomorphism determined by
[TABLE]
For a twisted virtual braid diagram of degree which is good, we also denote by a twisted virtual braid diagram obtained from the diagram by applying the above correspondence to the preferred word of .
Let be a twisted virtual braid (or its diagram) with
[TABLE]
Let be an isomorphism determined by
[TABLE]
Then in and for . In particular and are related by a TM1-move (or TM0-moves and TM1-moves when we discuss them as diagrams).
Theorem 5.1**.**
If two twisted virtual braids of degree (or their diagrams) are related by a left virtual exchange move, then they are related by a sequence of TM1-moves (or TM0-moves and TM1-moves) and a right virtual exchange move.
Proof.
Let and be twisted virtual braid diagrams of degree related by a left virtual exchange move. Suppose that
[TABLE]
where and are good twisted virtual braid diagrams of degree . Then
[TABLE]
and hence and are related by a right virtual exchange move. Since is conjugate to as elements of , and is conjugate to , we see that and are related by a sequence of TM1-moves (or TM0-moves and TM1-moves when we discuss them as diagrams) and a right virtual exchange move. ∎
6. A reduced presentation of the twisted virtual braid group
L. Kauffman and S. Lambropoulou [8] gave a reduced presentation of the virtual braid group. Motivated by their work, we give a reduced presentation of the twisted virtual braid group. Using the reduced presentation, one can deal the twisted virtual braid group with less number of generators and relations.
In this section, we show that the presentation of the twisted virtual braid group given in Theorem 2.4 can be reduced to a presentation with generators and less relations by rewriting and in terms of , and as follows:
[TABLE]
See Figure 19. These can be seen geometrically from their diagrams or algebraically from and .
Theorem 6.1**.**
The twisted virtual braid group has a presentation whose generators are and the defining relations are as follows:
[TABLE]
In what follows, we refer to relations , and or equivalently , and as the virtual relations.
Lemma 6.2** (cf. [8]).**
Relations follow from relations and the virtual relations.
This lemma is directly seen. The following three lemmas are proved in [8]. So we omit the proofs.
Lemma 6.3** (Lemma 1 of [8]).**
Relations follow from relations , the virtual relations, and relations .
Lemma 6.4** (Lemma 3 of [8]).**
Relations follow from relations , the virtual relations, and relations and .
Lemma 6.5** (Lemma 2 of [8]).**
Relations follow from relations , the virtual relations, and relations and .
In the following proofs, we underline the expressions which we focus on.
Lemma 6.6**.**
Relations follow from relations , the virtual relations, and relation .
Proof.
[TABLE]
∎
Lemma 6.7**.**
Relations follow from relations , the virtual relations, and relations .
Proof.
Since , we consider the following two cases.
Case(i) Suppose . Then and we have
[TABLE]
Case(ii) Suppose . Then
[TABLE]
∎
Lemma 6.8**.**
Relations follow from relations , the virtual relations, and relations and .
Proof.
By the previous lemma, we may assume relations . It is sufficient to consider a case of .
[TABLE]
∎
Lemma 6.9**.**
Relations follow from relations , , the virtual relations, relations , and .
Proof.
By previous lemmas, we may assume relations and or equivalently .
First we show when , i.e., for . We apply induction on , with initial condition . The relation follows from and .
Assuming , we obtain as follows:
[TABLE]
Hence,
[TABLE]
Now, we show relations : for .
Case(i) Suppose . Then
[TABLE]
Case(ii) Suppose . Then
[TABLE]
∎
Lemma 6.10**.**
Relations follow from relations and the virtual relations.
Proof.
[TABLE]
∎
Lemma 6.11**.**
Relations follow from relations , , the virtual relations, and relations and .
Proof.
[TABLE]
∎
Proof of Theorem 6.1.
In the twisted virtual braid group, it is verified that all relations – are valid by a geometrical argument using diagrams or algebraic argument using the relations –. On the other hands, we see that the relations – follow from the relations – by the previous lemmas. ∎
Concluding remarks
In this paper we study twisted virtual braids and the twisted virtual braid group, and provide theorems for twisted links corresponding to the Alexander theorem and the Markov theorem. We also provide a group presentation and a reduced group presentation of the twisted virtual braid group. As future work, it will be interesting to study the pure twisted virtual braid group and construct invariants for twisted virtual braids and twisted links. For example, biquandles with structures related to twisted links introduced in [10] may be discussed by using twisted virtual braids.
Acknowledgements
K. Negi would like to thank the University Grants Commission(UGC), India, for Research Fellowship with NTA Ref.No.191620008047. M. Prabhakar acknowledges the support given by the Science and Engineering Board(SERB), Department of Science Technology, Government of India under grant-in-aid Mathematical Research Impact Centric Support(MATRICS) with F.No.MTR/2021/00394. This work was partially supported by the FIST program of the Department of Science and Technology, Government of India, Reference No. SR/FST/MS-I/2018/22(C), and was supported by JSPS KAKENHI Grant Number JP19H01788.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. O. Bourgoin, Twisted link theory, Algebr. Geom. Topol. 8 (2008), no. 3, 1249–1279.
- 2[2] T. E. Brendle and A. Hatcher, Configuration spaces of rings and wickets, Comment. Math. Helv. 88 (2013), 131–162.
- 3[3] D. M. Dahm, A generalization of braid theory, Ph.D. Thesis, Princeton University, 1962.
- 4[4] C. Damiani, A journey through loop braid groups, Expo. Math. 35 (2017), no. 3, 252–285.
- 5[5] C. Damiani, A Markov’s theorem for extended welded braids and links, Osaka J. Math. 56 (2019), no. 2, 255–268.
- 6[6] R. Fenn, R. Rimányi and C. Rourke, The braid-permutation group, Topology 36 (1997), 123–135.
- 7[7] L. H. Kauffman, Virtual knot theory, European J. Combin. 20 (1999), no. 7, 663–691.
- 8[8] L. H. Kauffman and S. Lambropoulou, Virtual braids, Fund. Math. 184 (2004), 159–186.
