1 Introduction
In classical knot theory, the double points in a knot diagram indicate the over and under crossing information. Kauffman [Reference Kauffman21] generalized these diagrams by introducing a new type of crossing which neither indicates which arc passes over nor which arc passes under. These crossings are termed as virtual crossings and are indicated as
. Diagrams with such crossings are referred as virtual link diagrams. These diagrams are considered up to the equivalence relations generated by planar isotopies and generalized Reidemeister moves. These moves encompass both traditional Reidemeister moves and their analogs involving virtual crossings. In [Reference Carter, Kamada and Saito7, Reference Kamada and Kamada18], virtual knot theory is interpreted as knot theory in oriented thickened surfaces up to a certain equivalence. Subsequently, Kuperberg [Reference Kuperberg24] proved that virtual knot theory is indeed the study of links in
$3$
-manifolds, thereby deducing that virtual knot theory represents a true topological extension of classical knot theory.
Kauffman [Reference Kauffman21] also introduced analogs of Artin braid groups, referred to as virtual braid groups. Geometrically, in addition to classical generators, virtual braid groups have generators that involve virtual crossings and an additional set of relations. These added relations encode new moves beyond the classical Reidemeister moves. Moreover, Kamada [Reference Kamada19] and Kauffman-Lambropoulou [Reference Kauffman and Lambropoulou20, Reference Kauffman and Lambropoulou22] proved Alexander and Markov theorems for oriented virtual knots. Since the introduction of virtual knot theory, numerous works have focused on virtual braids [Reference Bardakov and Bellingeri1–Reference Bardakov, Neshchadim and Singh3] and virtual links [Reference Boden and Nagel6, Reference Ceniceros and Nelson8, Reference Dye and Kauffman9, Reference Kamada16, Reference Kamada17, Reference Kauffman21].
The notions of birack and biquandle, introduced in [Reference Fenn, Jordan-Santana and Kauffman12], yield natural invariants of virtual braids and virtual knots, respectively. In [Reference Fenn and Bartholomew13], computations of biracks and biquandles of small sizes are presented, and, as an application, it is reproved that the Burau map from braids to matrices is not injective. In [Reference Kauffman and Manturov23], the introduction of virtual quandles and virtual biquandles extends the structure of a quandle and a biquandle, respectively, by incorporating an invertible unary map. This unary operator plays a crucial role in defining the action of virtual crossings on the labels of incoming arcs in a virtual knot diagram. Leveraging this unary operator, numerous invariants originating from biquandles are extended to virtual biquandles, thereby enhancing their strength. For instance, a notion of virtual knot group is defined [Reference Manturov25], whose various generalizations are explored in [Reference Boden, Gaudreau, Harper, Nicas and White5]. Furthermore, state-sum invariants are defined for virtual knots using virtual biquandles in [Reference Ceniceros and Nelson8, Reference Farinati and García Galofre11].
In this article, we found a connection between the coloring number invariant derived from biquandles and virtual biquandles. We prove that, for a given virtual link L and a virtual biquandle
$(X,f,R)$
, the set of colorings of L by
$(X,f,R)$
is in bijection with the set of colorings of L by a biquandle
$(X,VR)$
, where
$VR$
is a new operator defined on X (see Theorem 3.2) and defines a functor from the category of virtual biquandles to the category of biquandles. As a result, in Corollary 3.3, we prove that the number of colorings of L by virtual biquandles can be recovered from colorings by biquandles. Furthermore, by introducing a new set of labeling rules (see Figure 8), we construct a presentation of the associated fundamental virtual biquandle of L using only the relations coming from the classical crossings (see Theorem 4.4). This is a notable improvement over the conventional approach, which typically involves recording relations from both classical and virtual crossings. Thus, with the adoption of these new labeling rules, one can directly extract the fundamental virtual biquandle of L from its Gauss diagram (using rules depicted in Figure 9), which was not the case before.
This article is organized as follows. In Section 2, we revisit the fundamentals of virtual knot theory. Specifically, we review the concept of equivalence of virtual link diagrams, the definition of the fundamental virtual biquandle of a virtual link, and the colorings of virtual links using virtual biquandles. Additionally, we note that for a given virtual biquandle
$(X,f,R)$
, there exists an operator
$VR$
distinct from R, for which
$(X,VR)$
forms a biquandle.
In Section 3, we recall the definition of the virtual braid group
$VB_n$
and define two representations of
$VB_n$
to the automorphism group
$\operatorname {Aut}(X^n)$
of a virtual biquandle
$(X, f, R)$
. In Theorem 3.2, we prove that if L is a virtual link, then the set of colorings of L by a virtual biquandle
$(X,f,R)$
, following the rules illustrated in Figure 5, is in bijection with the set of colorings of L by
$(X,VR)$
under the rules depicted in Figure 4. In particular, we show that the coloring number of a virtual link L by virtual biquandles can be retrieved from colorings by biquandles.
In Section 4, we present two representations of the virtual braid group
$VB_n$
to the automorphism group of free virtual biquandle on a set of n elements. By employing these representations, we prove that for a given virtual link L, the fundamental virtual biquandle
$(VBQ(L), f, R)$
is isomorphic to
$(VBQ(L), f, VR)$
as virtual biquandles (refer to Theorem 4.4). This implies that we can construct a presentation of the fundamental virtual biquandle of L simply by recording the relations arising at classical crossing, using the new labeling rules shown in Figure 8. Consequently,
$(VBQ(L), f, R)$
can be recovered from a Gauss diagram representing L, using the rules shown in Figure 9.
In Section 5, we discuss potential directions stemming from this work.
2 Preliminaries
A non-empty set X with an operator
$R\colon X \times X \to X \times X$
, mapping
$(x,y) \mapsto (R_1(x,y), R_2(x,y) )$
, is called a biquandle if the following holds:
-
(1) R satisfies the Yang–Baxter relation, that is,
(2.1)
$$ \begin{align} (R \times \mathrm{id}) (\mathrm{id} \times R) (R \times \mathrm{id})=(\mathrm{id} \times R) (R \times \mathrm{id}) (\mathrm{id} \times R), \end{align} $$
where
$\mathrm {id}$
is the identity map on X; -
(2) R is invertible;
-
(3)
$R_1$
is left-invertible, meaning that for any
$x,z \in X$
, there exists a unique
$y \in X$
such that
$R_1(x,y)=z$
; -
(4)
$R_2$
is right-invertible, meaning that for any
$y, w \in X$
, there exists a unique
$x \in X$
such that
$R_2(x,y)=w$
; -
(5) R satisfies the type I condition, which is, for any
$a \in X$
, there exists a unique
$x \in X$
such that
$R(x,a)=(x,a)$
.
Note that the type I condition is equivalent to the following: for given
$a \in X$
, there exists a unique
$y \in X$
such that
$R(a, y)=(a,y)$
.
The following are some examples.
Example 2.1 Let G be a group and let
$R\colon G \times G \to G \times G$
be a map sending
$(x,y)$
to
$(x^{-1}y^{-1}x, y^2x )$
, then
$(G,R)$
is a biquandle called Wada biquandle. For more examples of biquandles arising from groups, refer to [Reference Wada27].
Example 2.2 Let k be a commutative ring with unity
$1$
, and units
$\alpha $
and
$\beta $
, such that
$(1-\alpha )(1-\beta )=0$
. Then
$\displaystyle R= \left [ \begin {array}{cc} 1-\alpha & \alpha \\ \beta & 1-\beta \end {array} \right ] $
makes the ring k into a biquandle. This example can be generalized by replacing k with
$k^m$
. Precisely, let
$R\colon k^m \times k^m \rightarrow k^m \times k^m $
be given by a matrix
$\displaystyle R= \left [ \begin {array}{cc} I - A & A \\ B & I-B \end {array} \right ], $
where the matrices A and B are invertible
$m \times m$
matrices with elements in k, satisfying
$AB=BA$
and
$(I-A) (I-B)=0$
, where I is the identity matrix. Then
$(k^m,R)$
is a biquandle.
We revisit the definition of virtual biquandles from [Reference Kauffman and Manturov23]. A virtual biquandle is a triplet
$(X,f,R)$
, where
$(X,R)$
is a biquandle and
$f: X \to X$
is an automorphism of
$(X,R)$
.
The following are straightforward examples of virtual biquandles.
Example 2.3 Consider the Wada biquandle
$(G,R)$
as described in Example 2.1. If f is a group automorphism
$f:G \to G$
, then the
$(G,f,R)$
forms a virtual biquandle.
Example 2.4 Consider the biquandle
$(k,R)$
defined in Example 2.2. If f is an automorphism of the ring k, then
$(k,f,R)$
forms a virtual biquandle.
A homomorphism from
$(X,f,R)$
to
$(Y,f',R')$
is a map
$\phi : (X,f,R) \to (Y,f', R')$
such that
$\phi :(X,R) \to (Y, R')$
is a biquandle homomorphism and
$\phi \circ f= f' \circ \phi $
.
The proof of Proposition 2.5 can be found in [Reference Elhamdadi and Singh10]; however, for the sake of completeness, we recall it here.
Proposition 2.5 If
$(X,f,R)$
is a virtual biquandle, then
$(X,VR)$
is a biquandle, where
$VR\colon X \times X \to X \times X$
defined as
$VR(x,y)=(R_1(x,f(y)), R_2(f^{-1}(x),y))$
. Moreover, f is also an automorphism of
$(X,VR)$
.
Proof The invertibility of R and f gives the invertibilty of
$VR$
as
Thus it is sufficient to prove that
$VR$
is a Yang–Baxter operator.
L.H.S of Equation (2.1) is
$$ \begin{align*} &(VR \times \mathrm{id} ) (\mathrm{id} \times VR) (VR \times \mathrm{id})~~(x,y,z)\\&=(VR \times \mathrm{id}) (\mathrm{id} \times VR)~~ \big( R_1(x,f(y)), R_2(f^{-1}(x),y), z \big)\\ &=(VR \times \mathrm{id} ) ~~ \big( R_1(x,f(y)), R_1( R_2 (f^{-1}(x), y), f(z) ), R_2 ( R_2 (f^{-2}(x), f^{-1}(y)), z) \big)\\ &=\big( R_1 \big( R_1(x,f(y)), R_1(R_2(x,f(y)), f^2(z) ) \big),\\&R_2 \big( R_1 (f^{-1}(x), y), R_1 (R_2(f^{-1}(x),y), f(z))\big), R_2 ( R_2 (f^{-2}(x), f^{-1}(y)), z) \big). \end{align*} $$
R.H.S of Equation (2.1) is
$$ \begin{align*} &(\mathrm{id} \times VR) (VR \times \mathrm{id}) (\mathrm{id} \times VR)~~(x,y,z)\\&=(\mathrm{id} \times VR) (VR \times \mathrm{id}) ~~\big( x, R_1(y,f(z)), R_2 (f^{-1}(y),z) \big)\\ &=(\mathrm{id} \times VR) ~~\big( R_1\big( x, R_1(f(y), f^2(z)), R_2(f^{-1}(x), R_1(y, f(z))), R_2(f^{-1}(y),z) \big) \big)\\ &= \big( R_1(x, R_1(f(y), f^2(z))), R_1(R_2(f^{-1}(x), R_1(y, f(z)))), R_2(y, f(z)) ,\\ &R_2(R_2(f^{-2}(x), R_1(f^{-1}(y),z)), R_2(f^{-1}(y),z)) \big). \end{align*} $$
Now L.H.S=R.H.S, if and only if the following equations hold for all
$x,y,z \in X$
:
$$ \begin{align} &R_2 \big( R_1 (f^{-1}(x), y), R_1 (R_2(f^{-1}(x),y), f(z))\big) \nonumber\\ &=R_1\big(R_2(f^{-1}(x), R_1(y, f(z))), R_2(y,f(z))\big) \end{align} $$
Equations (2.2), (2.3), and (2.4) follow from that
as R is a Yang–Baxter operator.
The construction of a biquandle from a virtual biquandle, in Proposition 2.5, gives a functor from the category of virtual biquandles to the category of biquandles. This follows from the observation that if we have a morphism
$g: (X,f, R) \to (X',f',R')$
in the virtual biquandle category, then we have the following commutative diagrams,

implying the following commutative diagram

From the above discussion, we note down the following result.
Proposition 2.6 There is a functor from the category of virtual biquandles to the category of biquandles.
From Proposition 2.6 it follows that
$(X,f, VR)$
is a virtual biquandle.
Remark 2.7 Note that if we have a biquandle
$(X,R)$
and an automorphism
${f \in \operatorname {Aut}((X,R))}$
, then
$(X, f, R')$
, where
$R'=(\mathrm {id} \times f)~ R~ (\mathrm {id} \times f^{-1})$
, is a virtual biquandle. Moreover, we can recover the operator R as
$R=(\mathrm {id} \times f^{-1})~ R' ~ (\mathrm {id} \times f)$
, and thus the biquandle
$(X,R)$
.
We recall the following notions of virtual knot theory from [Reference Kauffman21].
A virtual link diagram is a generic immersion of a finitely many circles into the Euclidean plane
$\mathbb {R}^2$
or the
$2$
-sphere
$\mathbb {S}^2$
, where the double points are decorated either as classical crossings or virtual crossings, as shown in Figure 1.
Classical crossing and virtual crossing.

Two virtual link diagrams are said to be equivalent if they are related by a finite sequence of planar isotopies and generalized Reidemeister moves shown in Figure 2. A virtual link is an equivalence class of virtual link diagrams under the generalized Reidemeister moves and planar isotopies.
Generalized Reidemeister moves.

In an oriented virtual link diagram, a classical crossing is positive if the co-orientation of the over-arc and that of the under-arc match with the orientation of the plane, otherwise it is negative. Positive and negative crossings are depicted in Figure 3.
Positive and negative crossings.

Labeling rules for biquandle.

Labeling rules for virtual biquandle.

Consider an oriented virtual link L, represented by a virtual link diagram D. In D, a semiarc is defined as an arc between two consecutive double points. The associated fundamental biquandle
$BQ(L)$
is the quotient of the free biquandle generated by the labels on the set of semiarcs in D. This is done by applying the equivalence relation induced by the relations at crossing in D, as shown in Figure 4. This association is independent of the diagrams used to represent L. For more details, we refer the readers to [Reference Kauffman and Manturov23, Section 2.6] and [Reference Fenn, Jordan-Santana and Kauffman12, Reference Hrencecin and Kauffman14].
In a similar way, one can associate a fundamental virtual biquandle (
$VBQ(L), f , R)$
to L. This virtual biquandle is defined as the quotient of the free virtual biquandle generated by the labels on the set of semiarcs in the virtual link diagram D. This is done by applying the equivalence relation induced by the relations at the crossings in D, as shown in Figure 5. Importantly, the virtual biquandle (
$VBQ(L), f, R)$
is independent of the diagram D up to isomorphisms. See [Reference Kauffman and Manturov23, Section 2.6] for more details.
A coloring of a virtual link L by a virtual biquandle
$(X,f',R')$
is a virtual biquandle homomorphism
$\phi :(\hspace{-1pt}VBQ(L), f, R) \to (X,f',R')$
. Note that labeling the semiarcs of the diagram D with elements from
$(X,f',R')$
, following the rules depicted in Figure 5, results in a coloring of L.
3 Set theoretic bijection between the set of colorings by biquandles and virtual biquandles
In this section, we prove that if L is a virtual link, then the set of colorings of L by a virtual biquandle
$(X,f,R)$
under the rules illustrated in Figure 5 is in bijection with the set of colorings of L by
$(X,VR)$
under the rules illustrated in Figure 4.
First recall the definition of the virtual braid group
$VB_n$
on n-strands, which has the following presentation (see [Reference Bardakov and Bellingeri1, Theorem 4]):
-
• Generators:
$\sigma _1, \sigma _2, \ldots , \sigma _{n-1},\rho _1, \rho _2, \ldots , \rho _{n-1}.$
-
• Relations:
$$ \begin{align*} &\sigma_i \sigma_{i+1} \sigma_i = \sigma_{i+1} \sigma_i \sigma_{i+1}, ~i=1,2,\ldots, n-2;\\ &\sigma_i \sigma_j = \sigma_j \sigma_i, ~|i-j| \geq 2;\\ &\rho_i\rho_{i+1} \rho_i = \rho_{i+1}\rho_i \rho_{i+1}, ~ i=1,2,\ldots,n-2;\\ &\rho_i \rho_j =\rho_j \rho_i,~ | i-j| \geq 2;\\ &\rho_i^2 =1,~ i=1,2,\ldots,n-1;\\ &\sigma_i \rho_j = \rho_j \sigma_i,~ |i-j| \geq 2;\\ &\rho_i \rho_{i+1} \sigma_i = \sigma_{i+1} \rho_i \rho_{i+1},~ i=1,2,\ldots, n-2. \end{align*} $$
Geometrically,
$\sigma _i$
,
$\sigma _i^{-1}$
and
$\rho _i$
are shown in Figure 6.
Generators of virtual braid group
$VB_n$
.

For
$\beta _1, \beta _2 \in VB_n$
, the composition
$\beta _2 \beta _1$
in
$VB_n$
represents the braid shown in Figure 7.
Composition operation on
$VB_n$
.

Let
$VB_n$
be the virtual braid group on n-strands and
$(X, f, R)$
be a virtual biquandle. Then
$VB_n$
acts on the product
$X^n$
of n copies of X by the representation
defined as follows:
$$ \begin{align*} &\phi(\sigma_i) : \left\{\!\!\! \begin{array}{l} x_i \mapsto R_1(x_i,x_{i+1}), \\ x_{i+1} \mapsto R_2(x_i,x_{i+1}), \\ x_j \mapsto x_j, \textrm{ for } j \neq i, i+1, \\ \end{array} \right.~~~ &\phi(\rho_i) : \left\{\!\!\! \begin{array}{l} x_i \mapsto f^{-1}(x_{i+1}), \\ x_{i+1} \mapsto f(x_i), \\ \end{array} \right. \end{align*} $$
for
$1 \leq i \leq n-1$
. It is easy to check that

Now, consider an automorphism
defined as
Note that
Now define a new action
of
$VB_n$
on
$X^n$
given by
We give the following explicit images of the generators of
$VB_n$
under the representation
$\psi $
:
$$ \begin{align*} &\psi(\sigma_i) : \left\{ \begin{array}{l} x_i \mapsto R_1\big(x_i,f(x_{i+1})\big), \\ x_{i+1} \mapsto R_2\big(f^{-1}(x_i),x_{i+1}\big), \\ x_j \mapsto x_j, \textrm{ for } j \neq i, i+1, \\ \end{array} \right.~~~ &\psi(\rho_i) : \left\{ \begin{array}{l} x_i \mapsto x_{i+1}, \\ x_{i+1} \mapsto x_i \\ \end{array} \right. \end{align*} $$
and

Lemma 3.1 Let
$\beta \in VB_n$
and
$(X,f,R)$
be a virtual biquandle. Then there is a bijection between the fixed point set of
$\phi (\beta )$
and
$\psi (\beta )$
.
Proof It is sufficient to observe that if
$\phi (\beta )\big ( (x_1, \ldots , x_n) \big ) =(x_1, \ldots , x_n)$
, then
$\psi (\beta ) \big (\theta ( (x_1, \ldots , x_n) ) \big ) = \theta ( (x_1, \ldots , x_n) )$
, and
$\theta $
is a bijection.
By [Reference Kamada19], for every virtual link L there exists a virtual braid
$\beta $
whose closure is L.
Theorem 3.2 Suppose
$(X,f,R)$
is a virtual biquandle and L a virtual link diagram. Then the set of colorings of L by
$(X,f,R)$
, under the virtual biquandle coloring rule
$($
see Figure 5
$)$
, is in bijection with the set of colorings of L by
$(X,VR)$
, under the biquandle coloring rule
$($
see Figure 4
$)$
.
Proof Let
$\beta \in VB_n$
such that its closure is L. Then the set of colorings of L by
$(X,f,R)$
under the virtual biquandle rule
$($
see Figure 5
$)$
is in bijection with the fixed point set of
$\phi (\beta )$
. Similarly, the set of colorings of L by
$(X,VR)$
under the biquandle coloring rule
$($
see Figure 4
$)$
is in bijection with the fixed point set of
$\psi (\beta )$
. Now by Lemma 3.1, and noting that the set of colorings of virtual link diagrams related by the generalized Reidemeister moves (Figure 2) are always in bijection, the result follows.
As a result of Theorem 3.2, we have the following corollary.
Corollary 3.3 Let L be a virtual knot and
$(X,f,R)$
a finite virtual biquandle. Then the number of colorings of L by
$(X,f,R)$
under the rules shown in Figure 5 is equal to the number of colorings of L by
$(X, VR)$
under the rules shown in Figure 4.
Thus, the number of colorings of a virtual link L by a virtual biquandle can be retrieved from colorings of L by a suitable biquandle.
4 Deriving Fundamental Virtual Biquandle from Classical Crossings
Let
$(FVBQ_n,f,R)$
denotes the free virtual biquandle on the set
$\{x_1, x_2, \ldots , x_n\}$
. The virtual braid group
$VB_n$
on n-strands acts on
$FVBQ_n$
via the representation
defined as follows:
$$ \begin{align*} &\Phi(\sigma_i) : \left\{ \begin{array}{l} x_i \mapsto R_1(x_i,x_{i+1}), \\ x_{i+1} \mapsto R_2(x_i,x_{i+1}), \\ x_j \mapsto x_j, \textrm{ for } j \neq i, i+1, \\ \end{array} \right.~~~ &\Phi(\rho_i) : \left\{ \begin{array}{l} x_i \mapsto f^{-1}(x_{i+1}), \\ x_{i+1} \mapsto f(x_i). \\ \end{array} \right. \end{align*} $$
Note that for
$1 \leq i \leq n-1$
,
$$ \begin{align*} \Phi(\sigma_{i}) \circ f &= f \circ \Phi(\sigma_{i})\\ \Phi(\rho_{i}) \circ f&=f \circ \Phi(\rho_{i}).\\ \end{align*} $$
One can check that

Now, consider an automorphism
defined as
Now define a new action of
$VB_n$
on
$(FVBQ_n, f,R)$
given by
We write down the images of the generators of
$VB_n$
under the map
$\Psi $
:
$$ \begin{align*} &\Psi(\sigma_i) : \left\{ \begin{array}{l} x_i \mapsto R_1\big(x_i,f(x_{i+1})\big), \\ x_{i+1} \mapsto R_2\big(f^{-1}(x_i),x_{i+1}\big), \\ x_j \mapsto x_j, \textrm{ for } j \neq i, i+1, \\ \end{array} \right.~~~ &\Psi(\rho_i) : \left\{ \begin{array}{l} x_i \mapsto x_{i+1}, \\ x_{i+1} \mapsto x_i \\ \end{array} \right. \end{align*} $$
and

For a given
$\beta \in VB_n$
, associate a virtual biquandle
$VBQ(\Phi ,\beta ) = FVBQ_n/\mathcal {R}$
, where
$\mathcal {R}$
is the equivalence relation generated by the set
$\{ \Phi (\beta )(x_i)=x_i~|~ 1 \leq i \leq n\}$
. We write
$VBQ(\Phi ,\beta )$
in a presentation form as follows:
Similarly, replacing the representation
$\Phi $
with
$\Psi $
, we associate a virtual biquandle
$VBQ(\Psi , \beta )= FVBQ_n/\mathcal {R'}$
, where
$\mathcal {R'}$
is the equivalence relation generated by the set
$\{\Psi (\beta )(x_i)=x_i~|~ 1 \leq i \leq n \}$
. A presentation form of
$VBQ(\Psi , \beta )$
is as follows:
In [Reference Kauffman and Manturov23, Section 2.6], the formal virtual biquandle notion is defined. The term “formal” refers to a framework for defining various notions of virtual quandles based on the coloring rules at virtual crossings. For any such model, the corresponding algebraic structure and its presentation can be determined by defining a specific representation of virtual braids into the automorphism group of some algebra. For instance, presentations of biquandles associated with virtual knots have been studied through braid representations in [Reference Hrencecin and Kauffman14, Section 5]. This technique is well-known in mathematical folklore, and we refer the reader to [Reference Wada27, Section 1] for a proof in a specific setting, though the overall idea remains the same in different scenarios. In our case, the notion of the associated fundamental virtual biquandle corresponds to the representation
$\Phi : VB_n \to \operatorname {Aut}(FVBQ_n, f, R)$
of virtual braids. Consequently, we obtain the following result.
Proposition 4.1 Let L be a virtual link and
$\beta $
be a virtual braid such that
$\mathrm {cl}(\beta )$
represents the link L. Then
$VBQ(\Phi , \beta )$
is isomorphic to the fundamental virtual biquandle of L.
Proof The result follows from the observation that in the representation
$\Phi $
, the actions of
$\Phi (\sigma _i)$
,
$\Phi (\sigma _i^{-1})$
, and
$\Phi (\rho _i)$
mimic the labeling rules used to defined the fundamental virtual biquandle of a link, shown in Figure 5.
Consequently, the following result follows.
Corollary 4.2 Let
$\beta ,\beta ' \in VB_n$
such that
$\mathrm {cl}(\beta )$
and
$\mathrm {cl}(\beta ')$
represents the same virtual link. Then
$VBQ(\Phi ,\beta )\cong VBQ(\Phi ,\beta ')$
.
Thus, the associated virtual biquandle
$VBQ(\Phi ,\beta )$
is an invariant of virtual links.
Theorem 4.3 Let
$\beta \in VB_n$
. Then the virtual biquandle
$VBQ(\Psi ,\beta )$
is isomorphic to the virtual biquandle
$VBQ(\Phi ,\beta )$
. In particular,
$VBQ(\Psi ,\beta )$
is a virtual link invariant.
Proof For
$\beta \in VB_n$
, the virtual biquandle
$VBQ(\Phi ,\beta )$
has a following presentation
Consider the automorphism
$\Theta : FVBQ_n \to FVBQ_n$
as defined above. Since
$\Theta $
is an automorphism, thus
$$ \begin{align*} VBQ(\Phi,\beta)\cong &\langle x_1, \ldots, x_n,f, R~|~\Theta(\Phi(\beta)(x_i))=\Theta(x_i) \textrm{ for } 1 \leq i \leq n \rangle\\ \cong & \langle x_1, \ldots, x_n,f, R~|~\Theta\circ\Phi(\beta)\circ\Theta^{-1}(\Theta(x_i))=\Theta(x_i) \textrm{ for } 1 \leq i \leq n \rangle\\ \cong & \langle x_1, \ldots, x_n,f, R~|~\Psi(\beta)(\Theta(x_i))=\Theta(x_i) \textrm{ for } 1 \leq i \leq n \rangle\\ \cong & \langle x_1, \ldots, x_n,f, R~|~\Psi(\beta)(f^{n-i}(x_i))=f^{n-i}(x_i) \textrm{ for } 1 \leq i \leq n \rangle\\ \cong & \langle x_1, \ldots, x_n,f, R~|~\Psi(\beta)(x_i)=x_i \textrm{ for } 1 \leq i \leq n \rangle\\ \cong &VBQ(\Psi, \beta). \end{align*} $$
This concludes the proof.
Let L be an oriented virtual link represented by a virtual link diagram D. Then we associate a virtual biquandle
$(X, f', R')$
to L defined as the quotient of a free virtual biquandle, which is generated by the labels on the set of semiarcs in the diagram D, by the equivalence relation induced by the relations at the crossings in D as shown in Figure 8.
Theorem 4.4 The virtual biquandle
$(X,f',R')$
is isomorphic to the fundamental virtual biquandle
$(VBQ(L), f, R)$
.
New labeling rules.

Proof The proof follows from Theorem 4.3 with the observation that
$(X, f', R')$
is isomorphic to the virtual biquandle
$(VBQ(\Psi , \beta ),f, R)$
, where
$\beta \in VB_n$
such that
$\mathrm {cl}(\beta )$
is L.
Hence, the fundamental virtual biquandle can be retrieved from just classical crossings in a virtual link.
Depiction of new labeling rules on Gauss diagrams.

A Gauss diagram consists of a finite number of circles oriented anticlockwise with a finite number of signed arrows whose heads and tails lie on the circles. For every oriented virtual link diagram L one can construct a Gauss diagram, where the arrows corresponds to the classical crossings in L. Figure 9 depicts the encoding of new labeling rules (from Figure 8) on Gauss diagrams. Thus, we can recover the fundamental virtual biquandle for a given virtual link L directly from a Gauss diagram representing L.
5 Concluding remarks
In this article, using virtual braid group representations, we prove that the coloring number invariant of virtual links, derived from virtual biquandles, can be obtained from colorings by biquandles. Also, by Remark 2.7, we note that colorings using biquandles can be recovered from those using virtual biquandles. Moreover, Theorem 4.4 suggests that any invariant stemming from the fundamental virtual biquandle can be extracted solely from classical crossings in virtual link diagrams. This suggests that classical crossings in virtual links may encompass more information than previously acknowledged. In our ongoing work [Reference Elhamdadi and Singh10], we are integrating the unary operator of virtual biquandles with Alexander numbering of links and standard biquandle coloring, thereby enhancing the state-sum invariant. In our forthcoming research, we aim to delve further into the “virtualized” invariants, such as the Alexander polynomial as defined in [Reference Boden and Chrisman4, Reference Jaeger, Kauffman and Saleur15, Reference Silver and Williams26], and the state-sum invariant derived from virtual biquandles [Reference Ceniceros and Nelson8, Reference Farinati and García Galofre11], shedding further light on their intricacies.
Acknowledgements
The authors would like to thank the referee for the fruitful suggestions that improved the paper.










