Constructing an infinite family of quandles from a quandle
Abstract.
Quandles are self-distributive, right-invertible, idempotent algebras. A group with conjugation for binary operation is an example of a quandle. Given a quandle and a positive integer , define , where . Then, is again a quandle. We set forth the following problem. “Find such that the sequence is made up of pairwise non-isomorphic quandles.” In this article we find such a quandle . We study the general linear group of -by- matrices over as a quandle under conjugation. Its (algebraically) connected components, that is, its conjugacy classes, are subquandles of it. We show the latter are connected as quandles and prove rigidity results about them such as the dihedral quandle of order is not a subquandle for most of them. Then we consider the quandle which is the projective linear group of -by- matrices over with conjugation, and prove it solves the problem above. In the course of this work we prove a sufficient and necessary condition for a quandle to be latin. This will reduce significantly the complexity of algorithms for ascertaining if a quandle is latin.
Key words and phrases:
Quandle, connected quandle, -connected quandle, -quandle, general linear group, projective linear group2020 Mathematics Subject Classification:
20N02, 57K12Introduction
Quandles are binary algebras whose axioms are the interpretation of Reidemeister moves of oriented link diagrams. Any group with conjugation for binary operation is a quandle. In the 1980s, Joyce [23, 24] and Matveev [31] proved that the fundamental quandle of an oriented knot is a complete knot invariant up to the orientation of the ambient space and that of the knot. This result extends to orientable non-split links. Since then quandles have been studied extensively and are used to construct new invariants. We refer the readers to [20, 33, 25] for more details.
Besides knot theory, the importance of quandles paved into other areas of mathematics, such as Hopf algebras [1], solutions to the set-theoretic quantum Yang-Baxter equation [1, 22, 17] and Riemannian symmetric spaces [29]. Concurrently, a study of quandles and racks from the algebraic point of view emerged. A (co)homology theory for quandles and racks has been developed in [13, 12] that led to stronger invariants for knots and knotted surfaces. Algebraic and combinatorial properties of quandles have been investigated, for example, in [4, 2, 7, 8, 34, 9, 15, 32, 32, 27, 26, 30]. In the last few years new aspects of quandle theory were introduced like covering theory [16, 18], extension theory [11, 3], commutator theory [10] and ring theory [19, 6].
Given a quandle and a positive integer , we define for . Then, is again a quandle (see [5]). In this article we present a solution to the following problem.
Problem.
Find a quandle such that the sequence is made up of pairwise non-isomomorphic quandles.
In the current article we also address the conjugation quandle on and on , the latter eventually providing an answer to the problem above (Theorem 5.16). We let stand for the conjugation quandle on . We prove a number of results about and about its infinite (algebraically) connected components which are subquandles of it. (We note that since these are topological groups then they are also topological quandles.) Our results are new even from the point of view of conjugacy classes of . For instance, we prove that the non-trivial connected components of are -connected (Theorem 4.4, Theorem 4.11, Theorem 4.15). This means that some pair of elements in the quandle, say requires two elements, say , to solve the equation and no in the quandle requires more than two to solve said equation. In the course of our work on , we prove a general result concerning -connectedness from which we obtain that a quandle is latin if and only if one of its left multiplications is bijective (Theorem 2.1). This latter result reduces considerably the complexity of the algorithms for checking if a quandle is latin.
Resuming the discussion of our work on , we also provide a partial classification of the quandles which are the connected components of (Theorem 6.1, Theorem 6.2, Theorem 6.4). In particular, we prove that there are infinitely many non-isomporphic such quandles. Furthermore, we prove results about rigidity of these quandles. For instance, we prove that cannot be a subquandle of most of them and also that certain strings of two elements do not fix elements by right multiplication (Theorem 6.10, Theorem 6.11).
The present article is organized as follows. In Section 1, we recall the basics of quandles that are used later. In Section 2, we find a sufficient and necessary condition for a quandle to be Latin (respect., -connected). In Section 3, we note down some results of generating quandles by multiplying a quandle operation with itself. In Section 4, we prove that all the non-trivial connected components of are -connected. In Section 5, we prove that, for , the -conjugation quandles over are pairwise distinct. In Section 6, we provide a partial classification of the connected components of . In Section 7, we provide some ideas for future work.
1. Preliminaries
In this section, we recall the definition of quandles and the associated terms with some examples.
Definition 1.1.
A quandle is a non-empty set together with a binary operation satisfying the following axioms:
-
Q1
for all .
-
Q2
For each , there exists a unique such that .
-
Q3
for all .
The axiom Q2 is equivalent to the bijectivity of the right multiplication by each element of . This gives a dual binary operation on defined as if . Thus, the axiom Q2 is equivalent to saying that
for all , and hence it allows us cancellation from the right. The axioms Q1 and Q3 are referred to as idempotency and distributivity axioms, respectively. The idempotency and cancellation law gives for all .
Examples.
The following are some examples of quandles.
-
•
Let be any non-empty set. Then define a binary operation on as for all . Then becomes a quandle and is called trivial quandle.
-
•
If is a group and , then the binary operation turns into the quandle called the -conjugation quandle of . For , the quandle is simply denoted by .
-
•
A group with the binary operation turns into the quandle called the core quandle of . In particular, if is a cyclic group of order , then it is called the dihedral quandle and is denoted by . Usually, one writes with .
In Section 3 we elaborate about and as functors from the category of groups to the category of quandles .
A homomorphism of quandles and is a map with for all . By the cancellation law in and , we get for all . The quandle axioms are equivalent to saying that for each , the map given by is an automorphism of fixing . The group generated by such automorphisms is called the group of inner automorphisms of , denoted .
We recall some relevant definitions. A quandle is said to be
-
•
connected if the group acts transitively on . For example, the dihedral quandle is connected whereas is not.
-
•
involutory if for all . For example, the core quandle of any group is involutory.
-
•
latin if the left multiplication defined by is a bijection for each .
-
•
-connected if is a surjective map for each . Each latin quandle is obviously -connected, but the converse is not true. For example, is -connected but not latin.
-
•
-connected if it is not -connected for and for any , we have and where and for all and . Note that this property is a quandle invariant.
The associated group of a quandle is the group with the set of generators as and the defining relations as
for all . For example, if is a trivial quandle, then is the free abelian group of rank equal to the cardinality of . The natural map
given by is a quandle homomorphism. The map is not injective in general.
If is a quandle, then by [35, Lemma 4.4.7], we can write
for all and . Henceforth, we will write a left-associated product
simply as
A repeated use of left association identity gives the following result [35, Lemma 4.4.8].
Lemma 1.1.
The product
of two left-associated forms and in a quandle can again be written in a left-associated form as
Thus, any product of elements of a quandle can be expressed in the canonical left-associated form , where , and for , whenever .
Let be a quandle, and . Then for , we let , where . We say is -quandle if for all . For example, core quandles are -quandles.
Remark 1.1.
Note that if is -quandle, then it is also -quandle, where .
Definition 1.2.
For , a quandle is said to be of type , if is the least number satisfying for all . We denote the type of by . If there does not exist any such , then we say the quandle is of type .
If for a quandle , is finite, then we say is of finite type. Clearly finite quandles and -quandles are of finite type.
A subset of a quandle is called subquandle if it is a quandle under the same binary operation of . The terms defined for quandles in this section are similarly defined for subquandles, for example, if is a quandle and its subquandle, then we say is an -subquandle, if for all we have .
2. A sufficient and necessary condition for a quandle to be latin (resp., -connected)
In this section, we find a sufficient and necessary condition for a quandle to be latin and -connected.
Theorem 2.1.
Let be a quandle. Then is latin if and only if there exists such that is bijective.
Proof.
By definition of latin quandle the necessity is obvious.
Now we will prove the converse. Let and . Since is surjective, there exists such that , which implies .
Claim.
is surjective.
Let . We need to find such that . Consider . Again the surjectivity of implies the existence of such that
Taking implies that , and thus proves the claim.
Claim.
is injective.
Let . If , then which is equivalent to . But since is injective, we have , which further implies that . Thus is injective. ∎
In the HAP package [21], finite Latin quandles are recognized by testing whether all left translations are permutations or not. As an application of Theorem 2.1, the time complexity of detecting Latin quandles can be reduced.
Theorem 2.2.
Let be a finite quandle and . Suppose that the cycles of have pairwise distinct lengths and for every , has a unique fixed point. Then is Latin.
In the following theorem, we find a sufficient and necessary condition for a quandle to be -connected.
Theorem 2.3.
Let be a quandle and such that for any element there exist , where such that . If is not -connected, where , then is -connected.
Proof.
Let and . By assumption, there exist , where , such that . Again by assumption, there exist , where , such that
where for . This completes the proof. ∎
3. Properties of multiplication of quandle operation
In this section we study properties of quandles which are generated by iterating its quandle operation a given number of times (see Proposition 3.1)-multiplication of quandle operation (see [5]).
The following result is proved in [5, Theorem 4.11] in a general setting, but we are noting it down for completeness.
Proposition 3.1.
Let be a quandle. Then for each , is a quandle, where for
Proof.
We just need to verify that satisfies the quandle axioms. Clearly it satisfies Q1 axiom. Let and in . Then , and is unique because is a bijection. Thus Q2 is also satisfied. Now take . We need to show that . Using Q3 recursively times, we note that . Thus . ∎
Now onwards, for a quandle , we denote the quandle by .
Remark 3.1.
If is a quandle and is , then is for all .
If is a quandle such that Type is finite, say , then is a trivial quandle. Furthermore, . Thus the following questions are in order.
Question 3.2.
Let be a quandle such that is . Does there exist , where , such that ?
Question 3.3.
Let be a quandle such that is . Does there exist , where , such that ?
In Section 5, we will answer the above questions for , and .
We note that if is a quandle homomorphism, then the map defined as is a quandle homomorphism. Thus we have the following result.
Proposition 3.4.
Let denote the category of quandles. Then we have a functor defined as and as .
Remark 3.2.
Using Proposition 3.4, we note that the functor is the composite of and functors, that is .
For each quandle , there is a quandle homomorphism defined as .
Corollary 3.5.
Let be a quandle. Then for each , the following are true:
-
(1)
The map defined as is a quandle homomorphism
-
(2)
the map defined as is a quandle homomorphism.
Proof.
The result follows from Proposition 3.4. ∎
Proposition 3.6.
Let be a quandle. Then for each , the following holds:
-
(1)
the map defined on the generators as is a group homomorphism.
-
(2)
the map defined as is a quandle homomorphism.
-
(3)
the map defined as is a quandle homomorphism.
Proof.
Let . Then the map defined on the generators as is a group homomorphism if and only if
which is true. Thus is a group homomorphism. The second assertion follows from the fact that the natural map is a quandle homomorphism. The last assertion follows from the fact that there is a natural surjective group homomorphism given by . ∎
4. Connected components of
Consider the group of invertible -by- matrices over the field of complex numbers . The projective general linear group of degree over is the quotient of by its center . It is known that each connected component of a quandle is a subquandle. In this section we will prove that each non-trivial connected components of are -connected.
It is well known that there are exactly three families of conjugacy classes in , namely:
-
(1)
for each , the conjugacy class of ,
-
(2)
for each , the conjugacy class of ,
-
(3)
for each , the conjugacy class of , which is a singleton set.
Remark 4.1.
We disregard above because each of its quandles corresponds to the trivial quandle with one element.
Notation.
-
(1)
For , we denote the set of conjugacy class of and by and , respectively. Note that
-
(2)
We denote the matrix by .
-
(3)
For any , the trace of and determinant of are denoted by and , respectively.
Lemma 4.1.
Each connected component of the quandle having more than one element is a non-trivial (infinite) subquandle.
Proof.
Let and . Then
Thus is a non-trivial subquandle; it is also an infinite quandle since .
Let . Then
Thus is a non-trivial subquandle; it is also an infinite quandle since . ∎
4.1. The proof that is -connected, where
In this subsection we will prove that for where , the quandle is -connected (see Theorem 4.4).
Lemma 4.2.
Let and . Then there exists such that if and only if .
Proof.
For in , we have:
(1) | |||
(2) |
Thus for to be in , the trace of must be zero. This proves the necessity of
Now let , and take Then clearly is in and satisfies conditions in (2) which further implies that it satisfies . Thus . ∎
Lemma 4.3.
Let such that , and such that either or . Then the following holds:
-
(i)
there exists such that and
-
(ii)
there exists such that and
Proof.
We will show that there exists such that , that is, we will prove that is a diagonalizable matrix in . We will prove the existence of when , the other case where is similar. The system of equations for the eigenvectors of is ()
so that
where in the last passage we used the characteristic equation. The eigenvectors are then:
where we keep the scalars and for later to choose them appropriately so that the diagonalizing matrix,
is in . Thus, we need
(3) | ||||
(4) |
Since , the quadratic equation in cannot have solutions and (note that ), which further implies that is not a solution of the above equations. Thus, choosing a solution of the quadratic equation for and obtaining in terms of this provides , such that .
Similarly, one can solve and for a diagonalizing matrix
to be in . Thus there exists such that . ∎
Theorem 4.4.
Let , and . Then is a connected quandle. If , then is a -connected quandle.
Proof.
If , then being a trivial quandle with one element, is connected.
Now suppose . By Q1-axiom . By Lemma 4.2, there does not exist any such that . Thus cannot be -connected. Furthermore, by Lemma 4.3, for any such that either or , there exist such that , , , and Thus for any , either there exists such that or there exist such that . Thus by Theorem 2.3, is -connected. ∎
4.2. The proof that is -connected
In this subsection, we will prove that for , the quandle is -connected (see Theorem 4.11).
Lemma 4.5.
Let such that . Then there exist such that and .
Proof.
Lemma 4.6.
Let and , where . Then there does not exist any such that .
Proof.
Assume on the contrary and suppose that there exists with , , , and
This implies that , which contradicts . This completes the proof. ∎
Lemma 4.7.
Let and . Then the following holds:
-
(1)
there exists such that .
-
(2)
there exists such that .
Proof.
We will prove (1) part. The proof of (2) is along similar lines.
Suppose and . Then,
which is an upper triangular matrix in . Thus taking implies that ∎
Theorem 4.8.
The quandle is a -connected quandle.
Proof.
The quandle is non-trivial (see Lemma 4.1). By Lemma 4.6, we know that is not -connected. Noting that if , then . By Theorem 2.3, we know that to prove is -connected, it is sufficient to prove that for any , either there exists such that or there exists such that . In the following points we have covered all the possibilities for .
-
(a)
If , then by Lemma 4.2 there exists such that .
-
(b)
If , where , then by Lemma 4.7, there exists such that .
- (c)
-
(d)
Let , where Then by Lemma 4.5, there exists such that .
This completes the proof. ∎
Theorem 4.9.
Let . Then, and are isomorphic quandles.
Proof.
Set
We leave the proof of injectivity and surjectivity to the reader and we prove that is a quandle homomorphism:
∎
Remark 4.2.
The proof of Theorem 4.9 may suggest that the same argument is valid with replaced by , a matrix in the centralizer of quandle (viewed as a subset of ). We will next show that, although true, this does not contribute any new information. For , has only one element. Thus, the ’s are isomorphic among themselves and non-isomorphic with and , where , since the latter are infinite quandles. Given and , for to commute with then has to be a diagonal matrix. To further commute with other matrices, also has to be a scalar matrix. But this amounts to multiplication by a scalar. This concludes this remark.
Corollary 4.10.
Let . Then and are isomorphic quandles.
Proof.
Analogous to the proof of Theorem 4.9. ∎
Remark 4.3.
Theorem 4.11.
The quandle is a -connected quandle.
4.3. The proof that is -connected
In this subsection, we will prove that for , the quandle is -connected (see Theorem 4.15).
Lemma 4.12.
The quandle is not -connected.
Proof.
Let , then
implies that and . Now for to be in , the trace criteria implies that , but the determinant criteria implies that Thus , and hence is not -connected. ∎
Lemma 4.13.
Let .
-
(1)
If , then there exists such that .
-
(2)
If , then there exists such that .
Proof.
We will prove the first one, the other is similar to it.
Let , and . Then
One can check that the matrix is invertible (), thus we have a unique solution for and in terms of . Thus
which implies
Thus for any such that , there exists , where either or , such that . ∎
Theorem 4.14.
The quandle is -connected.
Proof.
Theorem 4.15.
Let . Then is -connected.
5. Study of
In this section we will prove the following theorems.
Theorem.
Let . Then .
Theorem.
For any with , the quandle is not isomorphic to .
Proposition 5.1.
Let and , where and . Then .
Proof.
One way is obvious. Let . Since is invertible, we can find a matrix such that (see [14, Theorem 4.1]). Thus we have . ∎
Proposition 5.2.
For any , there are exactly three families of connected components in , namely:
-
(1)
for each , the conjugacy class of in ,
-
(2)
for each , the conjugacy class of in ,
-
(3)
for each , the singleton set .
Lemma 5.3.
Let and . Then , where is a subquandle of
Proof.
Let . By induction one can prove that for all . Now,
Thus, . ∎
Corollary 5.4.
For each , .
Definition 5.1.
An element is said to be a root of unity if there exists such that . In this case, we also say that is an -th root of unity.
Definition 5.2.
For , an element is said to be a -th primitive root of unity if and for .
Lemma 5.5.
Let and be -th roots of unity, and . Then is an -subquandle of .
Proof.
Let . Then there exists such that
Since , then , for all . ∎
Corollary 5.6.
Let and be -th roots of unity, and . Then is a trivial subquandle of .
Lemma 5.7.
Let , and . Then is an -subquandle of if and only if is an -th root of unity.
Proof.
If , then being a trivial subquandle implies that it is an -subquandle.
If and is an -th root of unity, then by Lemma 5.5, is an -subquandle of .
Now we will prove that for where , if is an -subquandle of , then is an -th root of unity. Let and , where . Clearly, and are in . By induction we have . Now
For to be -subquandle of , the equality must hold for all , which implies that .
∎
Corollary 5.8.
Let , and . Then the type of as a subquandle of is finite if and only if is a -th root of unity for some .
Now we prove the first main theorem.
Theorem 5.9.
The quandle is not isomorphic to for any .
Proof.
Let us suppose there exists an isomorphism
Then the image of each connected component under must be a connected component and the type of each connected component must be preserved under the map . This implies that each connected component of , having more than one element is a non-trivial subquandle (see Lemma 4.1), which is not true by Corollary 5.6 (see Proposition 5.2). Thus for any . ∎
For , we denote its image in by , that is, .
Remark 5.1.
Let . Then and are in the same conjugacy class if and only if is conjugate to in for some . This implies that following are the only families of distinct conjugacy classes in :
-
(1)
The set , where and are distinct elements in .
-
(2)
, where .
-
(3)
the singleton set containing the identity element of .
We note down the following results for without writing their proofs as they can be proved along similar lines as done in the case of , see above in this section.
Proposition 5.10.
For any , the only connected components in are , and the identity element, where and .
Lemma 5.11.
Let and . Then , where is a subquandle of .
Corollary 5.12.
For each , .
Lemma 5.13.
Each connected component of having more than one element is a non-trivial subquandle.
Lemma 5.14.
Let and be in , and . Then is an -subquandle of if and only if is an -th root of unity.
Lemma 5.15.
The quandle has exactly connected components which are trivial subquandles.
Proof.
The connected components in which are trivial are exactly those connected components in which are -subquandles. The number of ways one can choose two -th roots of unity such that one of them is identity is . Thus, by Lemma 5.14 there are only connected components in which are -subquandles. ∎
Thus we have the second main theorem.
Theorem 5.16.
For any with , the quandle is not isomorphic to .
Proof.
The result follows from Lemma 5.15. ∎
Question 5.17.
Let such that . Is it true that ?
6. Classification of connected components of
In Section 4, we proved that the non-trivial connected components of are -connected (see Theorem 4.4, 4.11, 4.15), and hence they are connected subquandles. In this section, we partially classify these connected components.
Theorem 6.1.
Let . Then is not isomorphic to .
Proof.
Assume on the contrary and suppose that is a quandle isomorphism. Since , and commute with one another, so do their images under the map (as is a quandle homomorphism). Thus there exists which simultaneously diagonalize , , and (see [28, Page 569]). But since there are only two diagonal matrices in and is a bijection, this is absurd. The proof is complete. ∎
Theorem 6.2.
Let and where . Then the following holds:
-
(1)
If is a -th primitive root of unity and is not a root of unity, then is not isomorphic to .
-
(2)
If is -th primitive root of unity and is -th primitive root of unity, then is not isomorphic to .
Proof.
The proof of (1) follows from Lemma 5.7.
Now for the proof of (2). Without loss of generality we assume . By Lemma 5.7 and Theorem 4.9, it is sufficient to prove that is not isomorphic to , where and are -th and -th primitive roots of unity, respectively. Note that is -quandle and is -quandle. Now let which is an element in . Then
as and is a -th primitive root of unity. Thus is not a -quandle and hence is not isomorphic to . ∎
Lemma 6.3.
Let and be quandle isomorphic to . If is not a root of unity, then is isomorphic to for all .
Proof.
Now we will prove that are well-defined and are bijective. Suppose such that . Then there exist such that and . Then implies that
which further implies that (see Theorem [14, Theorem 4.1] and noting that any -by- matrix with distinct non-zero eigen values have four square roots) where and are -th roots of unity. Noting that under similar transformation, eigen values are preserved and is not a root of unity, thus and hence . Thus each matrix in has a unique root in , and as a consequence the maps are well-defined for all . Furthermore, since is a quandle isomorphism, thus is not a root of unity, and therefore by the preceding kind of reasoning, the maps are injective. It is trivial to see that the maps are surjective.
Now we are left with the proof that these maps are quandle isomorphisms. Let . Then there exist unique such that and . Now
This completes the proof. ∎
Theorem 6.4.
Let the quandle be isomorphic to , where is not a root of unity. Then is isomorphic to , for all .
Corollary 6.5.
Let and not be roots of unity, and is not isomorphic to . Then is not isomorphic to for any .
Proposition 6.6.
For and , the maximal trivial subquandle in is of cardinality .
Proof.
Clearly the set is a trivial subquandle of of cardinality . Now suppose is a trivial subquandle of , having more than two elements. Since is trivial, thus the elements of commutes pair wise which further implies that they are simultaneous diagonalizable (see [28, Page 569]), which is a contradiction. ∎
Since the set of upper triangular matrices in is a commutative set, we have the following result.
Proposition 6.7.
The maximal cardinality of a trivial quandle in is equal to the cardinality of .
For , in .
Lemma 6.8.
Let , and , , , . Then there exist such that and .
Proof.
Let , such that . As , thus is a diagonal matrix. Now for ,
(5) |
Now onwards, assume . Since , the determinant argument implies
(6) |
and the trace argument implies
(7) |
Now onwards take and ( is used here, as ) . Thus
(8) |
and
(9) |
Thus for suitable values of and , there exist such that . We ar now left to prove that . Now
Since and , the above equations implies that . Now
Since it is given that neither nor , we have . This further implies that for the values in Equation (8), we have and ∎
Theorem 6.9.
Let such that . Then there exist such that and .
Proof.
By Lemma 6.8, we need to establish the statement only for the following pairs of eigen values:
-
(1)
for , where ,
-
(2)
for , where ,
-
(3)
for , where .
Here we are proving the statement for the above cases:
- 1)
- 2)
- 3)
∎
Theorem 6.10.
Let be the dihedral quandle of order . Then
-
(1)
is not a subquandle of for ;
-
(2)
is not a subquandle of for .
Proof.
We will first prove (1). Given , we will consider, without loss of generality, an element , and together with and , we will force these three elements to constitute the underlying set of an isomorph of . We note that, for , when two distinct elements are operated the result is the other element. Note that
We now force the equality:
(10) | |||||
if and only if
(11) | |||||
(12) | |||||
(13) | |||||
(14) |
We now explore the consequences of or . In Equations (11) and (14), we now have:
The first three instances, along with , imply
which is impossible since . The instance gives rise to the following three instances:
-
1.
which implies that the prospective isomorph to has at most two elements and therefore cannot be an isomorph to .
-
2.
with but by performing the operations with the other two elements we do not obtain a quandle structure with these three elements. Namely, forcing
implies
Forcing
implies
. Now using , we get . which is absurd.
-
3.
with with the same remark as for the previous item, arguing along the same lines.
but is impossible by hypothesis. This concludes the proof of (1).
We now prove (2). Since is isomorphic to for any (see Corollary 4.10), we will work with . Given , without loss of generality, we will impose an quandle structure on the elements
So, we impose
and since the trace of the matrices equals , then so
so altogether we have less than three elements and therefore we do not have an isomorph with . This completes the proof.
∎
Theorem 6.11.
The dihedral quandle of order , , is a subquandle of , for any .
Proof.
Since is isomorphic with , we will use the latter for our proof. Without loss of generality, we will prove that
is the underlying set of in , find conditions for and prove that the subquandle so generated is in fact . We thus resume the study of the system from the proof of Proposition 6.10, with :
so the three elements of the prospective isomorph with are:
We will now check that whenever two distinct elements from these three are operated, the result is the other element.
This completes the proof. ∎
7. Future Work
In this section we collect some questions for future work.
Conjecture 7.1.
Let be an infinite type quandle. Then is not isomorphic to , for and .
Question 7.2.
Let and be distinct -th primitive roots of unity. Is there any relation between the quandles and ?
Question 7.3.
Does there exist a connected quandle such that is connected for all ?
Question 7.4.
Classify infinite type quandles, where .
Question 7.5.
Can a dihedral quandle , where , be subquandle of or , where and ?
Question 7.6.
What other well known connected quandles are subquandles of ?
Acknowledgement.
Pedro Lopes is supported by CAMGSD via project UIDB/04459/2020, financed by national funds FCT/MCTES (PIDDAC). Manpreet Singh is supported by UIDP/04459/2020 Post-Doctoral Research Fellowship at CAMGSD, financed by national funds FCT/MCTES (PIDDAC).
References
- [1] N. Andruskiewitsch and M. Graña. From racks to pointed Hopf algebras. Adv. Math., 178(2):177–243, 2003.
- [2] V. Bardakov, T. Nasybullov, and M. Singh. Automorphism groups of quandles and related groups. Monatsh. Math., 189(1):1–21, 2019.
- [3] V. Bardakov and M. Singh. Quandle cohomology, extensions and automorphisms. J. Algebra, 585:558–591, 2021.
- [4] V. G. Bardakov, P. Dey, and M. Singh. Automorphism groups of quandles arising from groups. Monatsh. Math., 184(4):519–530, 2017.
- [5] V. G. Bardakov and D. A. Fedoseev. Multiplication of quandle structures. arXiv e-prints, page arXiv:2204.12571, Apr. 2022.
- [6] V. G. Bardakov, I. B. S. Passi, and M. Singh. Quandle rings. J. Algebra Appl., 18(8):1950157, 23, 2019.
- [7] V. G. Bardakov, M. Singh, and M. Singh. Free quandles and knot quandles are residually finite. Proc. Amer. Math. Soc., 147(8):3621–3633, 2019.
- [8] V. G. Bardakov, M. Singh, and M. Singh. Link quandles are residually finite. Monatsh. Math., 191(4):679–690, 2020.
- [9] G. Bianco and M. Bonatto. On connected quandles of prime power order. Beitr. Algebra Geom., 62(3):555–586, 2021.
- [10] M. Bonatto and D. Stanovský. Commutator theory for racks and quandles. J. Math. Soc. Japan, 73(1):41–75, 2021.
- [11] J. S. Carter, M. Elhamdadi, M. A. Nikiforou, and M. Saito. Extensions of quandles and cocycle knot invariants. J. Knot Theory Ramifications, 12(6):725–738, 2003.
- [12] J. S. Carter, D. Jelsovsky, S. Kamada, L. Langford, and M. Saito. State-sum invariants of knotted curves and surfaces from quandle cohomology. Electron. Res. Announc. Amer. Math. Soc., 5:146–156, 1999.
- [13] J. S. Carter, D. Jelsovsky, S. Kamada, L. Langford, and M. Saito. Quandle cohomology and state-sum invariants of knotted curves and surfaces. Trans. Amer. Math. Soc., 355(10):3947–3989, 2003.
- [14] A. Choudhry. Extraction of th roots of matrices. Linear Algebra Appl., 387:183–192, 2004.
- [15] W. E. Clark and M. Saito. Algebraic properties of quandle extensions and values of cocycle knot invariants. J. Knot Theory Ramifications, 25(14):1650080, 17, 2016.
- [16] M. Eisermann. Homological characterization of the unknot. J. Pure Appl. Algebra, 177(2):131–157, 2003.
- [17] M. Eisermann. Yang-Baxter deformations of quandles and racks. Algebr. Geom. Topol., 5:537–562, 2005.
- [18] M. Eisermann. Quandle coverings and their Galois correspondence. Fund. Math., 225(1):103–168, 2014.
- [19] M. Elhamdadi, N. Fernando, and B. Tsvelikhovskiy. Ring theoretic aspects of quandles. J. Algebra, 526:166–187, 2019.
- [20] M. Elhamdadi and S. Nelson. Quandles—an introduction to the algebra of knots, volume 74 of Student Mathematical Library. American Mathematical Society, Providence, RI, 2015.
- [21] G. Ellis. HAP, homological algebra programming, Version 1.47. https://gap-packages.github.io/hap, Aug 2022. Refereed GAP package.
- [22] P. Etingof, T. Schedler, and A. Soloviev. Set-theoretical solutions to the quantum Yang-Baxter equation. Duke Math. J., 100(2):169–209, 1999.
- [23] D. Joyce. A classifying invariant of knots, the knot quandle. J. Pure Appl. Algebra, 23(1):37–65, 1982.
- [24] D. E. Joyce. An Algebraic approach to symmetry with applications to knot theory. ProQuest LLC, Ann Arbor, MI, 1979. Thesis (Ph.D.), University of Pennsylvania.
- [25] S. Kamada. Surface-knots in 4-space. Springer Monographs in Mathematics. Springer, Singapore, 2017. An introduction.
- [26] A. Lages and P. Lopes. Quandles of cyclic type with several fixed points. Electron. J. Combin., 26(3):Paper No. 3.42, 28, 2019.
- [27] A. Lages, P. Lopes, and P. Vojtěchovský. A sufficient condition for a quandle to be Latin. J. Combin. Des., 30(4):251–259, 2022.
- [28] S. Lang. Algebra, volume 211 of Graduate Texts in Mathematics. Springer-Verlag, New York, third edition, 2002.
- [29] O. Loos. Reflexion spaces and homogeneous symmetric spaces. Bull. Amer. Math. Soc., 73:250–253, 1967.
- [30] P. Lopes and D. Roseman. On finite racks and quandles. Comm. Algebra, 34(1):371–406, 2006.
- [31] S. V. Matveev. Distributive groupoids in knot theory. Mat. Sb. (N.S.), 119(161)(1):78–88, 160, 1982.
- [32] S. Nelson and C.-Y. Wong. On the orbit decomposition of finite quandles. J. Knot Theory Ramifications, 15(6):761–772, 2006.
- [33] T. Nosaka. Quandles and topological pairs. SpringerBriefs in Mathematics. Springer, Singapore, 2017. Symmetry, knots, and cohomology.
- [34] H. Raundal, M. Singh, and M. Singh. Orderability of link quandles. Proc. Edinb. Math. Soc. (2), 64(3):620–649, 2021.
- [35] S. K. Winker. Quandles, knot invariants, and the n-fold banched cover. ProQuest LLC, Ann Arbor, MI, 1984. Thesis (Ph.D.)–University of Illinois at Chicago.