Virtualized Delta, sharp, and pass moves for oriented virtual knots and links
Takuji NAKAMURA
Faculty of Education,
University of Yamanashi,
Takeda 4-4-37, Kofu, Yamanashi, 400-8510, Japan
[email protected], Yasutaka NAKANISHI
Department of Mathematics, Kobe University,
Rokkodai-cho 1-1, Nada-ku, Kobe 657-8501, Japan
[email protected], Shin SATOH
Department of Mathematics, Kobe University,
Rokkodai-cho 1-1, Nada-ku, Kobe 657-8501, Japan
[email protected] and Kodai Wada
Department of Mathematics, Kobe University, Rokkodai-cho 1-1, Nada-ku, Kobe 657-8501, Japan
[email protected]
Abstract.
We study virtualized Delta, sharp, and pass moves
for oriented virtual links,
and give necessary and sufficient conditions
for two oriented virtual links to be related by
the local moves.
In particular, they are unknotting operations
for oriented virtual knots.
We provide lower bounds for the unknotting numbers
and prove that they are best possible.
This work was supported by JSPS KAKENHI Grant Numbers
JP20K03621, JP19K03492, JP22K03287, and JP23K12973.
1. Introduction
A local move is one of the main tools in classical knot theory
which studies a relationship between
topological and algebraic structures of classical knots and links in the -sphere.
For example,
the -move corresponds to the set of linking numbers of classical links;
that is, two classical links are related by a finite sequence of -moves
if and only if they have the same pairwise linking numbers.
In particular,
the -move is an unknotting operation for classical knots.
On the other hand, it is known that the -move is
not an unknotting operation for virtual knots (cf. [7]).
In our previous paper [5],
we introduced a more elemental move
called a virtualized -move (or a -move simply)
for unoriented virtual knots and links
such that an ordinal -move is decomposed into
a pair of virtualized -moves.
See Figure 1.1.
It has been shown in [5] that the virtualized -move
is an unknotting operation for unoriented virtual knots,
and corresponds to the set of invariants called the parities
for unoriented virtual links.
\begin{overpic}[width=227.62204pt]{vDelta-eps-converted-to.pdf}
\put(63.0,26.0){$v\Delta$}
\put(152.0,26.0){$v\Delta$}
\end{overpic}Figure 1.1. A virtualized -move for an oriented virtual knot or link
In this paper, we study virtualized -moves
for oriented virtual knots and links,
which are divided into two classes called
-moves and -moves
according to the orientations of the strings involved in the moves.
Furthermore we introduce a virtualized -move
(or a -move) and a virtualized pass-move
(or a -move) as elemental versions of
an ordinal -move and an ordinal pass-move, respectively.
For ,
we say that two oriented virtual links are -equivalent
if they are related by a finite sequence of -moves.
Then we will prove the following
by using the th parity and
th intersection number
of an oriented -component virtual link ,
which are invariants coming from the linking numbers of .
Theorem 1.1.
Let and be oriented -component
virtual links with .
Then the following are equivalent.
(i)
and are -equivalent.
(ii)
and are -equivalent.
(iii)
and are -equivalent.
(iv)
holds for any .
Theorem 1.2.
Let and be oriented -component
virtual links with .
Then the following are equivalent.
(i)
and are -equivalent.
(ii)
and are -equivalent.
(iii)
holds for any .
For ,
we see that any two oriented virtual knots are -equivalent.
In particular, the -move is an unknotting operation
for oriented virtual knots.
Therefore we can define the -unknotting number
of an oriented virtual knot ,
and will prove the following.
Theorem 1.3.
For any
and positive integer ,
there are infinitely many oriented virtual knots
with .
This paper is organized as follows.
In Section 2,
we divide virtualized -moves into eight types
and
,
and virtualized -moves into two types and
according to the orientations of strings.
We study their relations and prove Theorem 1.1.
Sections 3 and 4 are devoted to the proof of Theorem 1.2.
In Section 3,
we divide virtualized pass-moves into four types
according to the string orientations.
We study relations among ’s and ’s,
and prove the equivalence of (i) and (ii) in Theorem 1.2.
In Section 4,
we construct a family of oriented -component virtual links,
and prove that any oriented -component virtual link
is -equivalent to a certain link belonging to the family.
We define invariants
by using the linking numbers of ,
and prove the equivalence of (i) and (iii) in
Theorem 1.2.
Finally, in Section 5,
we provide lower bounds for the -distance
between two oriented virtual knots
for
in terms of their odd writhes and -writhes.
By using these lower bounds,
we prove Theorem 1.3.
A virtualized -move or simply a -move
is a local deformation on a link diagram
as shown in Figure 2.1.
There are eight oriented types of virtualized -moves
labeled by
and
as in the figure.
The first four moves are collectively called -moves
and the latter -moves.
We say that two oriented virtual links and are
-, -, and -equivalent
if their diagrams are related by a finite sequence of
-, -, and -moves
(up to generalized Reidemeister moves),
respectively.
(i) The sequence in the top row of Figure 2.2
shows that a crossing change is realized by a combination of
a -move and several generalized Reidemeister moves,
where the symbol means a combination of
generalized Reidemeister moves.
For a -move,
we may use the above sequence with the orientations
of all the strings reversed.
See the second row of the figure.
For - and -moves,
we may use the sequences for
- and -moves
with opposite crossing information at every real crossing, respectively.
See the third and bottom rows of the figure.
(ii) The sequence in Figure 2.3
shows that a crossing change is realized by a combination of
a -move and several generalized Reidemeister moves.
We remark that it is obtained from the sequence for a -move
given in (i) by reversing the orientation of the string pointed
from the lower right to the upper left.
We have a similar sequence for a -move
as shown in the figure.
∎
For two local moves and ,
we use the notation
if a -move is realized by a combination of
-moves and generalized Reidemeister moves.
Lemma 2.2.
For the local moves
and
,
we have the following.
(i)
.
(ii)
.
(iii)
for any and .
Proof.
(i) It is sufficient to prove
The sequence in the top row of Figure 2.4 shows that
a -move is
realized by a combination of a -move,
a -move, and a generalized
Reidemeister move.
Since a -move is realized by
a combination of two crossing changes and
a generalized Reidemeister move,
and a crossing change is realized by
a -move by Lemma 2.1(i),
we have .
The remaining cases are proved similarly as shown in the figure,
where
means a combination of crossing changes at real crossings.
Each of the implications can be proved by reversing the orientation of a certain string
in a sequence given in (i).
For example,
Figure 2.5 shows .
\begin{overpic}[width=284.52756pt]{pf-lem-delta2-eps-converted-to.pdf}
\put(57.6,22.3){$\Delta$}
\put(133.0,24.8){$v\Delta_{1}^{\circ}$}
\put(219.0,22.3){R}
\end{overpic}Figure 2.5. Proof of
(iii)
By (i) and (ii), it is sufficient to prove
.
Figure 2.6 shows that a -move is realized by
a combination of
three crossing changes, three -moves,
and several generalized Reidemesiter moves.
Therefore we have
by Lemma 2.1(ii).
∎
\begin{overpic}[width=284.52756pt]{pf-lem-delta3-eps-converted-to.pdf}
\put(61.3,125.8){R}
\put(181.5,125.8){cc}
\put(2.0,40.9){$v\Delta_{2}^{\wedge}$}
\put(128.0,38.4){R}
\end{overpic}Figure 2.6. Proof of
A virtualized -move or simply
a -move is a local deformation on a link diagram
as shown in Figure 2.7.
There are two types of virtualized -moves
labeled by and
according to the sign of the real crossings
as in the figure.
We say that two oriented virtual links and are
-equivalent
if their diagrams are related by a finite sequence of
-moves (up to generalized Reidemeister moves).
.
More precisely, a -move is realized by a -move,
and vice versa.
Proof.
Figure 2.8 shows that
a -move is realized by a combination of a -move
and several generalized Reidemeister moves.
Thus we have .
The proof of is
obtained from the above sequence by
changing crossing information at every real crossing.
∎
\begin{overpic}[width=341.43306pt]{pf-lem-sharp-eps-converted-to.pdf}
\put(43.0,22.3){R}
\put(165.0,23.6){$v\sharp_{1}$}
\put(293.0,22.3){R}
\end{overpic}Figure 2.8. Proof of
Lemma 2.4.
For any ,
a crossing change is realized by a -move.
Proof.
The sequence in Figure 2.9 shows that
a crossing change is realized by a combination of
a -move and several generalized Reidemeister moves.
Therefore we have the conclusion by Lemma 2.3
∎
\begin{overpic}[width=312.9803pt]{pf-lem-cc2-eps-converted-to.pdf}
\put(39.0,30.3){R}
\put(150.0,31.8){$v\sharp_{1}$}
\put(266.5,30.3){R}
\end{overpic}Figure 2.9. Proof of Lemma 2.4 for
Lemma 2.5.
For any and ,
we have
.
Proof.
By Lemmas 2.2(i) and 2.3,
it is sufficient to prove
.
The sequence in Figure 2.10 shows that
a -move is realized by a combination of
a crossing change, a -move, and
several generalized Reidemeister moves.
Therefore we have
by Lemma 2.4.
\begin{overpic}[width=341.43306pt]{pf-lem-delta-sharp1-eps-converted-to.pdf}
\put(54.5,25.2){cc}
\put(132.5,25.2){R}
\put(203.0,26.7){$v\sharp_{1}$}
\put(278.5,25.2){R}
\end{overpic}Figure 2.10. Proof of
The sequence in Figure 2.11 shows that
a -move is realized by a combination of
two crossing changes, a -move,
a -move, and several generalized
Reidemeister moves.
Therefore we have
by Lemmas 2.1(i), 2.2(i),
and 2.3.
∎
\begin{overpic}[width=355.65944pt]{pf-lem-delta-sharp2-eps-converted-to.pdf}
\put(46.8,23.5){cc}
\put(113.5,23.5){R}
\put(201.0,25.9){$v\Delta_{1}^{\wedge}$}
\put(201.0,6.7){$v\Delta_{4}^{\wedge}$}
\put(300.5,23.5){R}
\end{overpic}Figure 2.11. A -move is realized by - and -moves
(i)(ii).
We have (i)(ii) by Lemma 2.2(iii),
and (ii)(i) by definition.
(ii)(iii).
This follows from Lemma 2.5 immediately.
(i)(iv).
This has been proved in [5, Theorem 1.5].
∎
3. Proof of the equivalence of (i) and (ii) in Theorem 1.2
A virtualized pass-move or simply a vp-move
is a local move on a link diagram
as shown in Figure 3.1.
There are four types of virtualized pass-moves
labeled by as in the figure.
We say that two oriented virtual links and are
-equivalent
if their diagrams are related by a finite sequence of
-moves (up to generalized Reidemeister moves).
For any ,
we have .
More precisely, a -move is realized by a -move.
Proof.
Figure 3.2 shows that
a -move is realized by a combination of a -move
and several generalized Reidemeister moves.
The other cases are proved similarly.
∎
\begin{overpic}[width=341.43306pt]{pf-lem-pass-eps-converted-to.pdf}
\put(0.0,130.0){\text@underline{$vp_{1}\Rightarrow vp_{2}$}}
\put(0.0,52.0){\text@underline{$vp_{1}\Rightarrow vp_{3}$}}
\put(43.5,99.9){R}
\put(122.5,101.4){$vp_{1}$}
\put(208.5,99.9){R}
\put(290.7,99.9){R}
\put(43.5,21.5){R}
\put(122.5,23.0){$vp_{1}$}
\put(208.5,21.5){R}
\put(290.7,21.5){R}
\end{overpic}Figure 3.2. A -move is realized by a -move
Lemma 3.2.
For any ,
a crossing change is realized by a -move.
Proof.
The sequence in Figure 3.3 shows that a crossing change
is realized by a combination of a -move and several generalized
Reidemeister moves.
Therefore we have the conclusion by Lemma 3.1.
∎
\begin{overpic}[width=312.9803pt]{pf-lem-cc3-eps-converted-to.pdf}
\put(39.0,30.3){R}
\put(150.0,31.8){$vp_{1}$}
\put(266.5,30.3){R}
\end{overpic}Figure 3.3. Proof of Lemma 3.2 for
Lemma 3.3.
For any ,
we have .
Proof.
By Lemmas 2.2(ii) and 3.1,
it is sufficient to prove
.
The sequence in Figure 3.4 shows that
a -move is realized by a combination of
a crossing change, a -move, and
several generalized Reidemeister moves.
Therefore we have
by Lemma 3.2.
\begin{overpic}[width=341.43306pt]{pf-lem-delta-pass1-eps-converted-to.pdf}
\put(54.5,25.2){cc}
\put(132.5,25.2){R}
\put(203.0,26.7){$vp_{1}$}
\put(278.5,25.2){R}
\end{overpic}Figure 3.4. Proof of
The sequence in Figure 3.5 shows that
a -move is realized by a combination of
two crossing changes, a -move,
a -move, and several generalized
Reidemeister moves.
Therefore we have
by Lemmas 2.1(ii), 2.2(ii),
and 3.1.
∎
\begin{overpic}[width=355.65944pt]{pf-lem-delta-pass2-eps-converted-to.pdf}
\put(46.8,23.5){cc}
\put(113.5,23.5){R}
\put(201.0,25.9){$v\Delta_{1}^{\circ}$}
\put(201.0,6.7){$v\Delta_{3}^{\circ}$}
\put(300.5,23.5){R}
\end{overpic}Figure 3.5. A -move is realized by - and -moves
4. Proof of the equivalence of (i) and (iii) in Theorem 1.2
A Gauss diagram of an oriented -component link diagram is
a union of oriented circles regarded as the preimage of
the immersed circles with chords connecting two points in
the preimage of each real crossing.
Each chord is equipped with the sign of the corresponding real crossing,
and it is oriented from the overcrossing to the undercrossing.
A -move on a link diagram
is described by deleting/adding three chords on a Gauss diagram
as shown in Figure 4.1,
where the signs of the chords are the same.
\begin{overpic}[width=312.9803pt]{vDelta-circ-Gauss-eps-converted-to.pdf}
\put(63.0,96.3){$v\Delta_{1}^{\circ}$}
\put(231.0,96.3){$v\Delta_{2}^{\circ}$}
\put(63.0,27.2){$v\Delta_{3}^{\circ}$}
\put(231.0,27.2){$v\Delta_{4}^{\circ}$}
\end{overpic}Figure 4.1. A -move on a Gauss diagram
A forbidden detour move [2, 8]
or a fused move [1] on a link diagram
is described by exchanging the positions of
two consecutive initial and terminal endpoints of chords
on a Gauss diagram.
There are four types according to the signs of the chords,
where we label them by
as shown in Figure 4.2.
The sequence in the top of Figure 4.3
shows for
and for .
We remark that two Reidemeister moves II
appear in this sequence.
Similarly, the sequence in the bottom of the figure
shows for
and for .
∎
\begin{overpic}[width=341.43306pt]{pf-lem-fd-eps-converted-to.pdf}
\put(0.0,144.5){\text@underline{$FD_{1}\Rightarrow FD_{2}$ for $\varepsilon=+1$
and $FD_{4}\Rightarrow FD_{3}$ for $\varepsilon=-1$}}
\put(160.5,122.0){$FD_{1}$}
\put(155.0,113.0){\scriptsize{$(\varepsilon=+1)$}}
\put(160.5,95.5){$FD_{4}$}
\put(155.0,86.5){\scriptsize{$(\varepsilon=-1)$}}
\put(72.3,112.0){R}
\put(262.3,112.0){R}
\put(7.0,104.0){$\varepsilon$}
\put(43.5,104.0){$-\varepsilon$}
\put(104.0,105.0){$\varepsilon$}
\put(116.0,117.0){$-\varepsilon$}
\put(129.0,98.0){$\varepsilon$}
\put(139.5,98.0){$-\varepsilon$}
\put(197.0,105.0){$\varepsilon$}
\put(211.0,117.0){$-\varepsilon$}
\put(218.5,98.0){$\varepsilon$}
\put(235.5,98.0){$-\varepsilon$}
\put(296.0,104.0){$\varepsilon$}
\put(323.0,104.0){$-\varepsilon$}
\put(0.0,55.0){\text@underline{$FD_{3}\Rightarrow FD_{1}$ for $\varepsilon=+1$
and $FD_{2}\Rightarrow FD_{4}$ for $\varepsilon=-1$}}
\put(160.5,36.0){$FD_{3}$}
\put(155.0,27.0){\scriptsize{$(\varepsilon=+1)$}}
\put(160.5,9.4){$FD_{2}$}
\put(155.0,0.4){\scriptsize{$(\varepsilon=-1)$}}
\put(72.3,25.9){R}
\put(262.3,25.9){R}
\put(7.0,17.0){$\varepsilon$}
\put(45.0,17.0){$\varepsilon$}
\put(97.0,9.0){$\varepsilon$}
\put(107.0,9.0){$-\varepsilon$}
\put(121.0,27.0){$\varepsilon$}
\put(135.0,17.0){$\varepsilon$}
\put(193.5,9.0){$\varepsilon$}
\put(208.5,9.0){$-\varepsilon$}
\put(217.0,27.0){$\varepsilon$}
\put(234.0,17.0){$\varepsilon$}
\put(296.0,17.0){$\varepsilon$}
\put(324.0,17.0){$\varepsilon$}
\end{overpic}Figure 4.3. Proof of Lemma 4.1
Lemma 4.2.
For any ,
we have
.
Proof.
The sequence in Figure 4.4 shows that
an -move is realized by a combination of
a -move, a -move,
and two Reidemeister moves II.
By Lemmas 2.2(ii) and 4.1,
we have the conclusion.
∎
\begin{overpic}[width=284.52756pt]{pf-lem-delta-fd-eps-converted-to.pdf}
\put(83.0,118.4){R}
\put(188.5,120.9){$v\Delta_{4}^{\circ}$}
\put(5.0,37.2){$v\Delta_{3}^{\circ}$}
\put(120.5,34.6){R}
\end{overpic}Figure 4.4. An -move is realized by a -move and a
-move
A forbidden move [3] on a link diagram
is described by exchanging the positions of
two consecutive endpoints of chords on a Gauss diagram
which are both initial or both terminal.
There are six types according to the signs and orientations of the chords,
where we label them by
as shown in Figure 4.5.
We say that two oriented virtual links and are
-equivalent
if their diagrams are related by a finite sequence of
forbidden moves (up to generalized Reidemeister moves).
We remark that any two oriented virtual knots are -equivalent
[4, 6].
We first consider the case .
The sequence in Figure 4.6 shows that
an -move is realized by a combination of
two crossing changes and an -move.
Note that a crossing change at a real crossing on a link diagram
is described by changing
the sign and orientation of the corresponding chord on a Gauss diagram.
Therefore we have
by Lemmas 2.1(ii) and 4.2
for any .
\begin{overpic}[width=341.43306pt]{pf-lem-delta-f-eps-converted-to.pdf}
\put(71.0,25.5){cc}
\put(160.5,27.0){$FD_{2}$}
\put(261.5,25.5){cc}
\end{overpic}Figure 4.6. Proof of
Similarly,
an -move for is realized by a combination of
two crossing changes and an -move for some .
Thus we have the conclusion
by Lemmas 2.1(ii) and 4.2.
∎
In the remaining of this section,
let be an integer with .
For integers ,
let be the Gauss diagram
of an oriented -component virtual link such that
(i)
has no self-chords,
(ii)
there are no nonself-chords between
and (),
(iii)
if , then there are no nonself-chords
between and ,
(iv)
if , then there are parallel nonself-chords
oriented from to with positive signs,
(v)
if , then there are parallel nonself-chords
oriented from to with negative signs, and
(vi)
along with respect to the orientation,
we meet the endpoints of the chords
between and before those between and
.
Figure 4.7 shows the Gauss diagram with .
Let be the -component virtual link
presented by .
Any oriented -component virtual link is
-equivalent to
for some
.
To prove this proposition,
we prepare the following lemma.
Lemma 4.5.
Let be a Gauss diagram of
an oriented -component virtual link.
Then any nonself-chord oriented from to
with sign
can be replaced with a pair of nonself-chords
one of which is oriented from to with sign
and the other is from to with sign
by a combination of -moves
and a Reidemeister move II for any .
Proof.
The sequence in Figure 4.8 shows that
a nonself-chord oriented from to with sign
is replaced with a pair of nonself-chords
one of which is oriented from to with sign
and the other is from to with sign
by a combination of a -move for some , a crossing change,
and a Reidemeister move II.
Therefore we have the conclusion by Lemmas 2.1(ii) and 2.2(ii).
∎
Let be a Gauss diagram of .
Using forbidden (detour) moves and
Reidemeister moves I,
we can remove all the self-chords from .
By Lemmas 4.2 and 4.3,
we may assume that satisfies the condition (i)
up to -moves and Reidemeister moves.
If there is a nonself-chord between and
, then we can replace it
with a pair of chords between and ,
and and by Lemma 4.5.
Hence we may assume that satisfies
the conditions (i) and (ii) up to -moves and
Reidemeister moves.
Finally, can be deformed into
the one satisfying the conditions (i)–(vi)
by forbidden (detour) moves, crossing changes,
and Reidemeister moves II.
Therefore we have the conclusion
by Lemmas 2.1(ii), 4.2, and 4.3.
∎
Let be an oriented -component virtual link,
and a Gauss diagram of .
The linking number of an ordered pair
is the sum of the signs of all the chords
oriented from to ,
which is an invariant of (cf. [3, Section 1.7]).
We denote it by .
For a chord of ,
it is convenient to introduce the signs of endpoints of
as follows.
If the sign of is ,
then we assign and
to the initial and terminal endpoints of , respectively.
Then
is equal to the sum of the signs of all the endpoints
of chords oriented from to .
The th intersection number of , denoted by ,
is defined by
for .
Equivalently, is equal to
the sum of the signs of all the endpoints of chords
between and .
Lemma 4.6.
If two oriented -component virtual links
and are -equivalent,
then holds
for any .
Proof.
Every pair of three chords appeared in a -move
has two adjacent endpoints with opposite signs and .
See Figure 4.9.
∎
(iii)(i).
By Proposition 4.4,
and are -equivalent to
for some and ,
respectively.
It follows from Lemmas 4.6 and 4.7
that
for any .
Since holds,
is -equivalent to .
∎
5. -, -,
-, and -unknotting numbers
In this section,
we will consider the case of oriented virtual knots.
Lemma 5.1.
For every ,
any two oriented virtual knots are -equivalent to each other.
In particular, the -move is an unknotting operation for oriented
virtual knots.
Proof.
By Lemmas 2.2(iii), 2.5,
3.3, and 4.3,
we have the following.
Therefore we see that
if two oriented virtual knots are -equivalent,
then they are -equivalent for every
.
Since any two oriented virtual knots are -equivalent [4, 6],
they are -equivalent.
∎
For and
two oriented virtual knots and ,
we denote by the minimal number of
-moves which are required to deform a diagram of into that of .
It is called the -distance between and .
In particular, we denote by ,
and call it the -unknotting number of ,
where is the trivial knot.
We briefly review the -writhe
and the odd writhe of an oriented virtual knot ,
which are invariants of (cf. [7]).
Let be a Gauss diagram of ,
and a chord of .
The endpoints of divide the underlying oriented circle of
into two arcs.
Let be the one of the two arcs
oriented from the initial endpoint of to the terminal.
The index of
is the sum of the signs of all the endpoints of chords on ,
and denoted by .
For , the sum of the signs of all the chords with index
is an invariant of .
It is called the -writhe of ,
and denoted by .
Furthermore the odd writhe of is defined to be
.
Proposition 5.2.
For two oriented virtual knots and ,
we have the following.
(i)
for
.
(ii)
.
In particular, we have
Proof.
(i)
For ,
if and are -equivalent,
then they are -equivalent by definition.
Thus we have .
Since it follows from [5, Proposition 2.6] that
holds,
we have the inequality.
For , a -move contains two positive and two negative
real crossings. Therefore
a single -move changes the odd writhe by at most two.
(ii) Since a -move contains four real crossings,
a single -move changes the odd writhe by at most four.
∎
Proposition 5.3.
For two oriented virtual knots and ,
we have the following.
(i)
(ii)
In particular, we have
Proof.
(i) A -move does not change the index
of any chord except for the three chords involved in the move.
See Figure 4.9 again.
Therefore if and are related by a single -move,
then we have .
(ii) A -move does not change the index
of any chord except for the four chords involved in the move.
See Figure 5.1 as an example.
Therefore if and are related by a single -move,
then we have .
∎
\begin{overpic}[width=170.71652pt]{delta-pass-n-writhe-eps-converted-to.pdf}
\put(81.0,43.0){$vp_{1}$}
\end{overpic}Figure 5.1. An example of a -move
Theorem 1.3 is decomposed into
Theorems 5.4–5.7 as follows.
Theorem 5.4.
For any positive integer ,
there are infinitely many oriented virtual knots
with .
Proof.
For an integer ,
we consider a long virtual knot
presented by a diagram
as shown in the left of Figure 5.2,
where the vertical twists consist of
positive real crossings and virtual crossings.
By taking the closure of the product of copies of ,
we obtain an oriented virtual knot as in the right of the figure.
\begin{overpic}[width=312.9803pt]{pf-thm-infinite-vdw-eps-converted-to.pdf}
\put(74.0,127.0){\rotatebox{-90.0}{$4s-1$ crossings}}
\put(42.5,6.5){$*$}
\put(48.0,-13.0){$T_{s}$}
\put(201.0,49.0){$m$ copies of $T_{s}$}
\put(194.8,12.0){$T_{s}$}
\put(265.0,12.0){$T_{s}$}
\put(220.0,-13.0){$K_{s}(m)$}
\end{overpic}Figure 5.2. Diagrams of and
As shown in the proof of [5, Theorem 2.9],
the set gives an infinite family of
oriented virtual knots with .
Since the long knot diagram of can be unknotted
by a -move for the three real crossings
around the region with the mark ,
we have .
∎
Theorem 5.5.
For any positive integer ,
there are infinitely many oriented virtual knots
with .
Proof.
For an integer , let be a long virtual knot presented by
a diagram as shown in the top of Figure 5.3.
Then its Gauss diagram is shown
in the bottom of the figure,
and has chords ,
, and
with signs
where denotes the sign of a chord .
Let be an oriented virtual knot as the closure of the product
of copies of .
\begin{overpic}[width=312.9803pt]{pf-thm-infinite-vdc-eps-converted-to.pdf}
\put(49.0,122.0){$a_{1}$}
\put(107.0,122.0){$a_{2s}$}
\put(219.0,122.0){$c_{1}$}
\put(277.0,122.0){$c_{2s}$}
\put(161.0,138.0){$b_{1}$}
\put(171.0,172.0){$b_{2}$}
\put(183.0,138.0){$b_{3}$}
\put(18.0,22.0){$a_{1}$}
\put(53.0,22.0){$a_{2s}$}
\put(168.0,22.0){$c_{1}$}
\put(202.0,22.0){$c_{2s}$}
\put(115.0,69.0){$b_{2}$}
\put(190.0,69.0){$b_{3}$}
\put(154.0,85.0){$b_{1}$}
\end{overpic}Figure 5.3. A diagram of and its Gauss diagram
We can apply a -move to the three real crossings , ,
and on the long knot diagram
so that becomes unknotted.
Thus we have .
To prove ,
we will calculate the -writhe of as follows.
Since we have
For any positive integer ,
there are infinitely many oriented virtual knots
with .
Proof.
For an integer , let be
a long virtual knot presented by
a diagram as shown in the top of Figure 5.4.
Then its Gauss diagram is shown
in the bottom of the figure,
and has chords ,
, and
with signs
Let be an oriented virtual knot as the closure of the product
of copies of .
\begin{overpic}[width=284.52756pt]{pf-thm-infinite-vs-eps-converted-to.pdf}
\put(48.0,186.0){$c_{1}$}
\put(112.0,186.0){$b_{1}$}
\put(146.0,186.0){$b_{2}$}
\put(164.0,186.0){$c_{2}$}
\put(171.0,251.0){$a_{1}$}
\put(117.0,251.0){$a_{2s}$}
\put(112.0,214.0){$b_{3}$}
\put(146.0,214.0){$b_{4}$}
\put(103.0,75.0){$c_{1}$}
\put(103.0,61.0){$c_{2}$}
\put(146.0,128.0){$b_{1}$}
\put(146.0,114.5){$b_{2}$}
\put(146.0,101.5){$b_{3}$}
\put(146.0,88.0){$b_{4}$}
\put(68.0,20.0){$a_{1}$}
\put(101.0,20.0){$a_{2s}$}
\end{overpic}Figure 5.4. A diagram of and its Gauss diagram
We can apply a -move to , , ,
and so that becomes unknotted.
Thus we have .
On the other hand, since we have
, ,
, and ,
it holds that
This induces .
Therefore we have
by Proposition 5.2(ii),
and hence .
Furthermore for any , since
holds,
we have .
∎
Theorem 5.7.
For any positive integer ,
there are infinitely many oriented virtual knots
with .
Proof.
For an integer ,
let be a long virtual knot presented by a diagram
as shown in the top of Figure 5.5.
Then its Gauss diagram is shown in the bottom of the figure,
and has chords
,
,
, and
with signs
Let be an oriented virtual knot as the closure of
the product of copies of .
\begin{overpic}[width=341.43306pt]{pf-thm-infinite-vp-eps-converted-to.pdf}
\put(86.0,181.5){$a_{1}$}
\put(132.0,181.5){$a_{2s}$}
\put(165.0,168.0){$b_{1}$}
\put(196.0,168.0){$b_{2}$}
\put(196.0,196.0){$b_{3}$}
\put(165.0,196.0){$b_{4}$}
\put(75.0,144.5){$c_{1}$}
\put(99.0,144.5){$c_{2}$}
\put(253.0,192.0){$d_{2s+2}$}
\put(253.0,144.0){$d_{1}$}
\put(5.0,17.0){$a_{1}$}
\put(35.0,17.0){$a_{2s}$}
\put(109.0,17.0){$c_{1}$}
\put(136.0,17.0){$c_{2}$}
\put(205.0,17.0){$d_{1}$}
\put(235.0,17.0){$d_{2s+2}$}
\put(185.0,69.0){$b_{1}$}
\put(105.0,55.5){$b_{2}$}
\put(205.0,55.5){$b_{3}$}
\put(289.0,55.5){$b_{4}$}
\end{overpic}Figure 5.5. A diagram of and its Gauss diagram
We can apply a -move to
, , , and
so that becomes unknotted.
Thus we have
.
On the other hand, since we have
it holds that
Therefore we have
by Proposition 5.3(ii),
and hence .
Furthermore for any , since
holds,
we have .
∎
We remark that the oriented virtual knots
constructed in the proof of Theorem 5.5 satisfy
In fact, we have .
Generally the two lower bounds for
given in Propositions 5.2(i)
and 5.3(i) are independent
in the following sense.
Proposition 5.8.
For any positive integer ,
there are infinitely many oriented virtual knots
with
Proof.
For an integer ,
let be a long virtual knot presented by
a diagram as shown in the top of Figure 5.6.
Then its Gauss diagram is shown in the bottom of the figure,
and has positive chords
,
, and
.
Let be an oriented virtual knot as the closure of the product
of copies of .
\begin{overpic}[width=284.52756pt]{ex-infinite-vdc2-eps-converted-to.pdf}
\put(96.0,166.0){$b_{1}$}
\put(135.5,166.0){$b_{2}$}
\put(115.5,190.0){$b_{3}$}
\put(190.0,193.0){$a_{1}$}
\put(189.0,248.0){{\small$a_{2s-1}$}}
\put(117.0,247.0){$c_{1}$}
\put(117.0,262.0){$c_{2}$}
\put(100.0,105.0){$b_{1}$}
\put(59.0,91.0){$b_{2}$}
\put(135.0,91.0){$b_{3}$}
\put(39.0,22.0){$a_{1}$}
\put(71.5,22.0){$a_{2s-1}$}
\put(122.0,22.0){$c_{1}$}
\put(136.5,22.0){$c_{2}$}
\end{overpic}Figure 5.6. A diagram of and its Gauss diagram
We can apply a -move to , ,
and so that becomes unknotted.
Thus we have .
On the other hand, since we have
it holds that
This induces .
By Propositions 5.2(i) and 5.3(i),
we have
Furthermore for any , since
holds,
we have .
∎
Similarly to the case above,
the oriented virtual knots
constructed in the proof of Theorem 5.7 satisfy
In fact, we have .
Generally the two lower bounds for
given in Propositions 5.2(i)
and 5.3(ii) are independent
in the following sense.
Proposition 5.9.
For any positive integer ,
there are infinitely many oriented virtual knots
with
Proof.
For an integer , let be a long virtual knot presented by
a diagram as shown in the top of Figure 5.7.
Then its Gauss diagram is shown in the bottom of the figure,
and has chords ,
, and
with signs
Let be an oriented virtual knot as the closure of the product
of copies of .
\begin{overpic}[width=256.0748pt]{ex-infinite-vp2-eps-converted-to.pdf}
\put(51.0,127.0){$b_{1}$}
\put(82.0,127.0){$b_{2}$}
\put(82.0,153.0){$b_{3}$}
\put(51.0,153.0){$b_{4}$}
\put(71.0,181.0){$c$}
\put(123.0,127.0){$a_{1}$}
\put(171.0,127.0){$a_{2s}$}
\put(95.0,83.0){$b_{1}$}
\put(55.0,69.5){$b_{2}$}
\put(116.0,69.5){$b_{3}$}
\put(157.5,69.5){$b_{4}$}
\put(38.0,18.0){$a_{1}$}
\put(69.0,18.0){$a_{2s}$}
\put(111.0,18.0){$c$}
\end{overpic}Figure 5.7. A diagram of and its Gauss diagram
We can apply a -move to , , ,
and so that becomes unknotted.
Thus we have .
On the other hand, since we have
it holds that
This induces .
By Propositions 5.2(i) and 5.3(ii),
we have
Furthermore for any , since
holds,
we have .
∎
References
[1]
B. Audoux, P. Bellingeri, J.-B. Meilhan, and E. Wagner,
Extensions of some classical local moves on knot diagrams,
Michigan Math. J. 67 (2018), no. 3, 647–672.
[2]
A. S. Crans, B. Mellor, and S. Ganzell,
The forbidden number of a knot,
Kyungpook Math. J. 55 (2015), no. 2, 485–506.
[3]
M. Goussarov, M. Polyak, and O. Viro,
Finite-type invariants of classical and virtual knots,
Topology 39 (2000), no. 5, 1045–1068.
[4]
T. Kanenobu,
Forbidden moves unknot a virtual knot,
J. Knot Theory Ramifications 10 (2001), no. 1, 89–96.
[5]
T. Nakamura, Y. Nakanishi, S. Satoh, and K. Wada,
Virtualized Delta moves for virtual knots and links,
available at arXiv:2401.12506.
[6]
S. Nelson,
Unknotting virtual knots with Gauss diagram forbidden moves,
J. Knot Theory Ramifications 10 (2001), no. 6, 931–935.
[7]
S. Satoh and K. Taniguchi,
The writhes of a virtual knot, Fund. Math. 225 (2014), no. 1, 327–342.
[8]
S. Yoshiike and K. Ichihara,
Forbidden detour number on virtual knot,
Kyungpook Math. J. 61 (2021), no. 1, 205–212.