Involutory Quandles and Dichromatic Links

: We deﬁne a new algebraic structure for two-component dichromatic links. This deﬁnition extends the notion of a kei (or involutory quandle) from regular links to dichromatic links. We call this structure a dikei that results from the generalized Reidemeister moves representing dichromatic isotopy. We give several examples on dikei and show that the set of colorings by these algebraic structures is an invariant of dichromatic links. As an application, we distinguish several pairs of dichromatic links that are symmetric as monochromatic links.


Introduction
A dichromatic link is a two-color link, where the two colors are usually represented by the labels "1" and "2". Many link invariants have been generalized to dichromatic links. For example, see [1][2][3].
Kei and quandles are used to describe knots and links. They are algebraic structures satisfying a number of axioms resulting from Reidemeister moves. A kei or a quandle for a given knot diagram is presented in terms of generators and relations, where the generators represent arcs, and the relations result from the crossings. See [4][5][6][7][8][9][10][11][12][13][14][15][16] for more information.
In this paper, we introduce an algebraic structure, which we call a dikei. This structure works as an involutory quandle (or a kei) for dichromatic links. This structure distinguishes several pairs of dichromatic links that are symmetric as monochromatic links (symmetric monochromatic links are identical links without colors). The isotopy of the dichromatic links involves a larger number of Reidemeister moves. Therefore, our dikei involves new axioms resulting from the extra Reidemeister moves. We give many examples of algebraic structures satisfying the axioms of a dikei. As a by-product of this structure, we apply the theory to distinguish among dichromatic links which are symmetric without the two colors.
This article is organized as follows. In Section 2, the basic concepts and terminology for kei and quandles are given. We also define dichromatic links and their isotopy invariance. In Section 3, the structure of a dikei is introduced. Many examples of structure satisfying the axioms of dikei are also given. In Section 4, we use dikei on examples of dichromatic links to distinguish them as an application of our new structure.

Basic Concepts and Terminology
In [9], most of the basic concepts and terminology on quandles can be found. This section begins with the definition of an involutory quandle (or a kei), and we show how the axioms of a kei are induced by the three Reidemeister moves. In Figure 1, each "color" corresponds to an arc in a diagram, and the x y operation corresponds to the transformation that, when an arc x passes under another arc y, we get x y. So, when x crosses under y, x y is a new arc, but y is unchanged; y is doing something to x. See [9] for reference. We give the definition of a kei. Definition 1 ([9]). A kei (involutory quandle) is a set X with a binary operation : X × X → X satisfying the following three axioms: The axioms of a kei result from the three Reidemeister moves as in the following figure 2. Definition 2 ([9]). Let X and Y be kei with operations X and Y , respectively. Then, a map f : Usual examples of kei include the following: • Any non-empty set X with operation x y = x, for all x, y ∈ X is a kei. It is called the trivial kei. • Let , : R n × R n → R be a symmetric bi-linear form on R n . Let X be the subset of R n consisting of vectors u such that u, u = 0. Then, the operation defines a kei structure on X. This kei is called a Coxeter kei.
• A set X = Z with operation x y = 2y − x, for all x, y ∈ Z is a kei.

•
A group X = G with operation x y = yx −1 y is a kei. It is called the core kei of the group G.
A dichromatic link in R 3 is the image of a smooth immersion of a finite number of circles in R 3 that have two colors, where the two colors are usually represented by the labels "1" and "2". For example, see Figure 3. Note that the word "color" is sometimes used for the colors of the components, and sometimes the same word is used for the arcs used in constructing a kei. The use of the word "color" in two contexts should not be confusing for the reader.
Two dichromatic links, L 1 and L 2 , are isotopy equivalent if one of them can be obtained from the other by a finite number of the extended Reidemeister moves, shown below in the figure 4, which preserves the color of each component.

Construction of Dikei
In this section, we define the notion of a dikei and give solid examples on dikei. We draw the coloring of the regular dichromatic crossings, as in the following figure 6.     4. Let (X, 1 ) and (X, 2 ) be two kei. Then, (X, 1 , 2 ) is called a dikei if the following two axioms are satisfied: The following straightforward lemma makes the set of coloring of a dichromatic link by a dikei an invariant of dichromatic links.  Let (X , ) be a kei, and let x 1 y = x 2 y = x y. Then, (X, 1 , 2 ) is a dikei. Lemma 3. Let (X , ) be a kei, and let x 1 y = x y, and x 2 y = x. Then, (X, 1 , 2 ) is a dikei.
Lemma 5. Let G be a group with x 1 y = yx −1 y and x 2 y = x. Then, (G, 1 , 2 ) is a dikei.
Theorem 1. Let Z n be the additive finite cyclic group of order n with the binary operations x 1 y = (n − 1)x + 2y and x 2 y = x. Then, (Z n , 1 , 2 ) is a dikei.
Proof. We show that 1 is a kei.
Proof. We show that satisfies the axioms in Definition 1.

Applications
Example 3. Consider the following two dichromatic links. Let G be a group with the operations x 1 y = yx −1 y and x 2 y = x. See Figure 10 for reference, where the numbers 1 and 2 represent the colors of the components in the dichromatic links. In Figure 10, the leftt-hand image (A) shows the relations at the crossings resulting from the binary operations, which give y = (xy −1 ) 2 x, xy −1 x = yx −1 y, and xy −1 xz −1 xy −1 x = z. Thus, the set of coloring is {(x, y, z) ∈ G × G × G : (xy −1 ) 3 = 1, (xy −1 xz −1 ) 2 = 1}.

Example 4.
Consider the following two dichromatic links. Let G be a group, and Q = {x ∈ G : x 2 = 1} with the operations x 1 y = yx −1 y and x 2 y = yxy. See Figure 11 for reference, where the numbers 1 and 2 represent the colors of the components in the dichromatic links. In Figure 11, the left-hand image (A) shows the relations at the crossings resulting from the binary operations, which give (xy −1 ) 3 x = x, (xy −1 ) 2 x = zyz, and (xy −1 ) 2 xz −1 (xy −1 ) 2 x = z. Thus, the set of coloring is
Example 5. Consider the following two dichromatic links. Let X = Z with the operations x 1 y = x and x 2 y = 2y − x. See Figure 12 for reference, where the numbers 1 and 2 represent the colors of the components in the dichromatic links. In Figure 12, the leftt-hand image (A) shows the relations at the crossings resulting from the binary operations, which give x = y, 2z − x = y and z = z. Thus, the set of coloring is Justification: In Figure 12, the right-hand image (B) shows the relations at the crossings resulting from the binary operations, which give 5y − 4x = x, 4x − 3y = 2y − x and 8x − 6y − z = z. Thus, the set of coloring is The solution set is equal for both of the sets of coloring above. Therefore, this coloring invariant does not distinguish these two dichromatic links. Example 6. Consider the following two dichromatic links. Let G be a group with the operations x 1 y = yx −1 y and x 2 y = x. See Figure 13 for reference, where the numbers 1 and 2 represent the colors of the components in the dichromatic links. In Figure 13, the left-hand image (A) shows the relations at the crossings resulting from the binary operations, which give x = (yx −1 ) 4 y, (xy −1 ) 3 x = yx −1 y, and (xy −1 ) 3 xz −1 (xy −1 ) 3 x = z. Thus, the set of coloring is In Figure 13, the right-hand image (B) shows the relations at the crossings resulting from the binary operations, which give x = y, zx −1 z = y, and z = z. Thus, the set of coloring is Justification: x = y, and Therefore, this coloring invariant distinguishes these two dichromatic links. To explain this, let G = Z 10 be the additive finite cyclic group of order 10; then S 1 = {(x, y, z) ∈ Z 10 × Z 10 × Z 10 : 5x = 5y, 3x − y − 2z = 0}, and S 2 = {(x, y, z) ∈ Z 10 × Z 10 × Z 10 : x = y, 2x = 2z}. Therefore, |S 1 | = 100, and |S 2 | = 20; we leave the calculations for the reader. Example 7. Consider the following two dichromatic links. Let G be a group, and Q = {x ∈ G : x 2 = 1} with the operations x 1 y = yxy and x 2 y = x. See Figure 14 for reference, where the numbers 1 and 2 represent the colors of the components in the dichromatic links. In Figure 14, the left-hand image (A) shows the relations at the crossings resulting from the binary operations, which give xyx = xy(x 3 y) 3 x, xyx 3 yx = y, yxzxy = z, and xzx = yzy. Thus, the set of coloring is In Figure 14, the right-hand image (B) shows the relations at the crossings resulting from the binary operations, which give zyz = x, zxz = y and z = z. Thus, the set of coloring is {(x, y, z) ∈ G × G × G : zyzx −1 = 1, zxzy −1 = 1}.

Conclusions
Our idea is that we extend the notion of an involutory quandle (or kei) from regular links to dichromatic links, and define a new algebraic structure for two-component dichromatic links. We call this structure a dikei. It results from the generalized Reidemeister moves representing dichromatic isotopy. We give several examples on dikei, and we could distinguish many two-component dichromatic links that are isotopic as without colors. This evidently provides the power of our structure as it is not affected by the symmetry in the pairs of links in the examples. We failed to distinguish some dichromatic links, as we think that there are other concrete examples satisfying the dikei axioms, and this is definitely to be investigated in future research.