The construction of multipermutation solutions of the Yang-Baxter equation of level 2
P\v{r}emysl Jedli\v{c}ka, Agata Pilitowska, Anna Zamojska-Dzienio

TL;DR
This paper classifies and constructs involutive set-theoretic solutions to the Yang-Baxter equation of level 2, distinguishing between distributive and non-distributive types, and provides enumeration results up to size 14.
Contribution
It introduces a new construction method for distributive solutions using abelian groups and matrices, and classifies solutions into two classes with enumeration up to size 14.
Findings
Distributive solutions can be constructed from abelian groups and matrices.
Non-distributive solutions can be derived from distributive solutions and permutations.
All distributive involutive solutions up to size 14 are enumerated.
Abstract
We study involutive set-theoretic solutions of the Yang-Baxter equation of multipermutation level 2. These solutions happen to fall into two classes -- distributive ones and non-distributive ones. The distributive ones can be effectively constructed using a set of abelian groups and a matrix of constants. Using this construction, we enumerate all distributive involutive solutions up to size 14. The non-distributive solutions can be also easily constructed, using a distributive solution and a permutation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
The construction of multipermutation solutions of the Yang-Baxter equation of level 2
Přemysl Jedlička
,
Agata Pilitowska
and
Anna Zamojska-Dzienio
(P.J.) Department of Mathematics, Faculty of Engineering, Czech University of Life Sciences, Kamýcká 129, 16521 Praha 6, Czech Republic
(A.P., A.Z.) Faculty of Mathematics and Information Science, Warsaw University of Technology, Koszykowa 75, 00-662 Warsaw, Poland
Abstract.
We study involutive set-theoretic solutions of the Yang-Baxter equation of multipermutation level 2. These solutions happen to fall into two classes – distributive ones and non-distributive ones. The distributive ones can be effectively constructed using a set of abelian groups and a matrix of constants. Using this construction, we enumerate all distributive involutive solutions up to size 14. The non-distributive solutions can be also easily constructed, using a distributive solution and a permutation.
Key words and phrases:
Yang-Baxter equation, set-theoretic solution, multipermutation solution, one-sided quasigroup, birack, left distributivity, rack.
2010 Mathematics Subject Classification:
Primary: 16T25. Secondary: 20N02, 20B25.
1. Introduction
The Yang-Baxter equation is a fundamental equation occurring in integrable models in statistical mechanics and quantum field theory [22]. Let be a vector space. A solution of the Yang–Baxter equation is a linear mapping such that
[TABLE]
Description of all possible solutions seems to be extremely difficult and therefore there were some simplifications introduced (see e.g. [8]).
Let be a basis of the space and let and be two mappings. We say that is a set-theoretic solution of the Yang–Baxter equation if the mapping extends to a solution of the Yang–Baxter equation. It means that , where satisfies the braid relation:
[TABLE]
A solution is called non-degenerate if the mappings and are bijections, for all . A solution is involutive if , and it is square free if , for every .
Convention 1.1**.**
All solutions, we study in this paper, are set-theoretic, non-degenerate and involutive so we will call them simply solutions. The set can be of arbitrary cardinality.
It is known (see e.g. [37, 17, 7]) that there is a one-to-one correspondence between solutions of the Yang-Baxter equation and involutive biracks – algebras which have a structure of two one-sided quasigroups and and satisfy some additional identities (5.1)–(5.5). This fact allows one to characterize solutions of the Yang-Baxter equation applying universal algebra tools.
In [10, Section 3.2] Etingof, Schedler and Soloviev introduced, for each solution , the equivalence relation on the set : for each
[TABLE]
They showed that the quotient set can be again endowed with a structure of a solution and they call such a solution the retraction of the solution and denote it by . A solution is said to be a multipermutation solution of level , if is the smallest integer such that . Since then many results appeared that study multipermutation solutions, often of a small level, e.g. [15, Section 8] or [18] which focused on the quantum spaces of (finite) solutions with multipermutation level 2. Square-free multipermutation solutions are always decomposable [35] and several authors gave descriptions of some of these solutions either as a generalized twisted union [10, 13, 5] or a strong twisted union [15, 17]. We have to say, however, that this approach brings decompositions only and does not offer a direct way how to construct such solutions. In our work we bring a simple-to-use way how to construct multipermutation solutions of level 2 using abelian groups only. Moreover, our approach works for all such solutions, not only for square-free ones.
It was proved by Gateva-Ivanova and Cameron [15, Proposition 8.2] that, for a square-free solution , we have , for all , if and only if the solution is a multipermutation solution of level . In the language of identities this is equivalent to being left distributive. It turns out, that this property can be characterized by several different identities and the equivalence of these identities holds in more general structures. This is why we in Section 2 study left quasigroups and we establish connections between several identities of binary algebras.
Given a square-free solution of a multipermutation level 2 and the associated birack , the algebra turns out to be a medial quandle (see Lemma 3.3). The structure of medial quandles was studied in [19] and one of the main results was a construction of medial quandles based on a set of abelian groups, a matrix of homomorphisms and a matrix of constants. In Section 3, we adapt the construction to the current context (the matrix of homomorphisms is actually not needed here anymore) and we generalize it so that it may include all distributive solutions, not only those square-free ones.
If a solution is a multipermutation solution of level and , then , where and , is a distributive solution [Theorem 7.12]. This phenomenon is a special case of something called an isotope. In Section 4 we study these special isotopes on the level of left quasigroups.
In Section 5 we finally get to biracks and we show what results from Section 2 and Section 3 tell us in the world of distributive involutive biracks. Some of these results generalize the latest results by Gateva-Ivanova [14]. We then translate the results into the language of solutions of the Yang-Baxter equation in Section 7. We prove that a solution is of multipermutation level 2 if and only if it is medial [Theorem 7.6] and we show equivalent properties for distributive solutions of multipermutation level 2 [Theorem 7.7]. We also rephrase how to construct any solution of multipermutation level 2. Additionally, we present a short direct proof that each abelian group (of arbitrary order) is an IYB group (Theorem 7.11).
In Section 6 we focus on non-distributive biracks associated to solutions of multipermutation level 2 and the isotopy that transforms them into distributive ones. This way we can effectively construct all solutions of multipermutation level 2, which is used in Section 8 to enumerate small biracks. Distributive biracks are enumerated up to size 14, for the others of multipermutation level 2 we give an upper bound only since we lack an easy-to-use isomorphism criterion.
2. Left quasigroups
In this preliminary section we introduce some identities that we shall use throughout the text and we show a few examples of left quasigroups with such properties.
Definition 2.1**.**
A left quasigroup is an algebra with two binary operations: the left multiplication and the left division respectively, satisfying for every the following conditions:
[TABLE]
A right quasigroup is defined analogously as an algebra with two binary operations of right multiplication and the right division satisfying for every the conditions:
[TABLE]
Condition (2.1) simply means that all left translations by
[TABLE]
are bijections, with . Equivalently, that for every , the equation has the unique solution in . Similarly, Condition (2.2) gives that all right translations by ; , are bijections with .
It is obvious that if is a left quasigroup then is also a left quasigroup. The left multiplication group of a left quasigroup is the permutation group generated by left translations, i.e. the group .
Definition 2.2**.**
Let . A left quasigroup is called:
- •
left distributive, if for every :
[TABLE]
- •
-reductive, if for every :
[TABLE]
- •
-permutational, if for every :
[TABLE]
- •
medial, if for every :
[TABLE]
- •
right cyclic, if it satisfies the right cyclic law, i.e. for every :
[TABLE]
- •
non-degenerate, if the mapping
[TABLE]
is a bijection
- •
idempotent, if for every
[TABLE]
A left distributive left quasigroup is a rack. Idempotent racks are called quandles.
The condition of left distributivity is well established in the literature. It appeared in a natural way in such areas as low-dimensional topology – in knot [3] and braid [6] invariants or in the theory of symmetric spaces [24]. Probably at first it was introduced already at the end of 19th century in papers of Peirce [29] and Schrder [36]. Recently, Lebed and Vendramin [23] considered the condition in the context of solutions of the Yang-Baxter equation.
The property of mediality was first investigated as a generalization of the associative law for quasigroups (see Murdoch [26] and Sushkievich [38]). It appears also in the characterization of mean value functions [1]. The first systematic approach to medial groupoids was undertaken by Ježek and Kepka in [21]. Idempotency in the theory of the Yang-Baxter solutions is called square-freeness. Idempotent and medial quasigroups are investigated since the middle of 20th century. In the wider context, two monographs [34, 33] of Romanowska and Smith are devoted to idempotent and medial algebras called modes which are present in different branches of mathematics and find applications in computer science, economics, physics, and biology.
-reductive groupoids were considered by Płonka as a special case of cyclic groupoids [30]. The more general -reductive modes were investigated in [31] and [32]. In [19] and [20] -reductive quandles were characterized.
Right cyclic quasigroups (under the name cycle sets) were introduced by Rump in [35]. He showed that there is a correspondence between solutions of the Yang-Baxter equation and non-degenerate cycle sets (see Theorem 5.3).
Finally, Condition (2.5) was defined by Gateva-Ivanova in [14, Remark 4.6] to describe multipermutation solutions of the Yang-Baxter equation (see Theorem 7.3). Earlier, Gateva-Ivanova and Cameron used Condition (2.4) (see [15, Theorem 5.15]). They did not name these properties.
Observation 2.3**.**
Each -reductive left quasigroup is -permutational and each -permutational, idempotent left quasigroup is -reductive.
For a solution of the Yang-Baxter equation, Gateva-Ivanova considered in [14, Definition 4.3] Condition which in the language of left quasigroups means that
[TABLE]
It is evident, that each idempotent left quasigroup satisfies Condition .
By Observation 2.3 we have that each idempotent -permutational left quasigroup is -reductive, for arbitrary . The same is also true for -permutational left quasigroups which satisfy Condition (see also [14, Proposition 4.7]).
Lemma 2.4**.**
Let be a left quasigroup which satisfies Condition and . Then is -permutational if and only if it is -reductive.
Proof.
We have only to prove that each -permutational left quasigroup which satisfies Condition is -reductive. But it is evident. By Condition for each there exists such that . Then for every we have:
[TABLE]
which completes the proof. ∎
In this paper we are mainly interested in -reductive and -permutational left quasigroups. In particular, a left quasigroup is -reductive if, for every :
[TABLE]
and it is -permutational if for every :
[TABLE]
Example 2.5**.**
The left quasigroup with the following left multiplication:
[TABLE]
is a 2-reductive rack and, according to Lemma 3.3, it is medial. In this case and .
Example 2.6**.**
Let be a left quasigroup with the following left multiplication:
[TABLE]
Clearly, and . One can check that is both right cyclic and -permutational but neither left distributive nor -reductive. Additionally, by Corollary 6.4, is medial.
For a left quasigroup , Condition (2.3) means that all left translations for every , are automorphisms of , i.e. for every
[TABLE]
Lemma 2.7**.**
Let be a left quasigroup. Then
- •
* is left distributive if and only if is left distributive.*
- •
* is -reductive if and only if is -reductive.*
- •
* is medial if and only if is medial.*
- •
* is idempotent if and only if is idempotent.*
Proof.
If is an automorphism, then is clearly an automorphism as well, giving Property (2.12). Furthermore, for every :
[TABLE]
Similarly, we can show that for every (see also [33, Exercise 8.6H])
[TABLE]
Next examples show that, for right cyclic or -permutational left quasigroup , the left quasigroup does not have to be right cyclic or -permutational.
Example 2.8**.**
Let be a left quasigroup with the following left multiplication and left division:
[TABLE]
or equivalently, , and . This left quasigroup is -permutational, but
[TABLE]
Example 2.9**.**
Let be a left quasigroup with the following left multiplication and left division:
[TABLE]
i.e. , , and . In this case the left quasigroup is right cyclic, but
[TABLE]
Directly from (2.3) and Lemma 2.7 we obtain that the left distributivity implies, for every ,
[TABLE]
Note also that, for an arbitrary automorphism of , we have
[TABLE]
3. 2-reductive racks
It is known [15, Theorem 5.15] that a square-free multipermutation solutions of level 2 is 2-reductive. It turns out that 2-reductivity has connections to other identities presented in Section 2. We study all these connections on the class of racks which are, after all, an interesting class itself, having many applications, e.g. in knot theory [12], [9, Chapter 5]. Moreover, we can apply existing tools, like a construction using affine meshes which is presented in the second half of this section.
Lemma 3.1**.**
Let be a rack. The following conditions are equivalent:
- (1)
* is right cyclic;* 2. (2)
the group is abelian; 3. (3)
* is right cyclic;* 4. (4)
* is -reductive.*
Proof.
In a rack, by (2.13), the conditions (2) and (4) are equivalent:
[TABLE]
Furthermore, by (2.13) and (2.7) for every we have:
[TABLE]
which completes the proof. ∎
Corollary 3.2**.**
Let be a right cyclic left quasigroup. Then the following conditions are equivalent:
- (1)
* is a rack;* 2. (2)
* is -reductive.*
Proof.
If is a rack then by Lemma 3.1 it is 2-reductive.
Conversely, by 2-reductivity of the right cyclic left quasigroup we have
[TABLE]
which shows that is left distributive. ∎
Lemma 3.3**.**
Let be a -reductive left quasigroup. Then the following conditions are equivalent:
- (1)
* is left distributive;* 2. (2)
the group is abelian; 3. (3)
* is right cyclic;* 4. (4)
* is right cyclic;* 5. (5)
* is medial.*
Proof.
Let be a 2-reductive left quasigroup. The implications: , and directly follow by Lemma 3.1.
If the group is abelian then
[TABLE]
which gives .
If is right cyclic then
[TABLE]
and similarly, if is right cyclic then
[TABLE]
so and are proved.
Finally,
[TABLE]
which shows that and completes the proof. ∎
In [19, Theorem 3.14] David Stanovský and the authors of this paper presented a general construction of medial quandles. It turned out [19, Theorem 6.9] that the case of 2-reductive quandles is actually much less complicated because 2-reductive quandles are rather combinatorial than algebraic structures. Moreover, the construction of 2-reductive quandles can be easily generalized for 2-reductive racks, as we shall see below.
Definition 3.4**.**
A trivial affine mesh over a non-empty set is the pair
[TABLE]
where are abelian groups and constants such that , for every .
If is a finite set we will usually display a trivial affine mesh as a pair , where is an matrix.
Definition 3.5**.**
The sum of a trivial affine mesh over a set is an algebra defined on the disjoint union of the sets , with two operations
[TABLE]
for every and .
Theorem 3.6**.**
An algebra is a -reductive rack if and only if it is the sum of some trivial affine mesh. The orbits of the action of then coincide with the groups of the mesh.
Proof.
At first we show that the sum of a trivial affine mesh is a 2-reductive rack with orbits , .
Let , , . Obviously the equation has a unique solution . Furthermore,
[TABLE]
and
[TABLE]
For and we have
[TABLE]
Thus the group acts transitively on if and only if the elements , , generate the group . Now let be a 2-reductive rack, and choose a transversal to the orbit decomposition. By Lemma 3.3, the group is abelian. Hence for every , the orbit is an abelian group with and , for .
Let for every
[TABLE]
Since is abelian, and each is an automorphism of , we have . This implies that the set
[TABLE]
generates the group . This shows that is the sum of the trivial affine mesh over the set .
Finally, let and with . Therefore we obtain
[TABLE]
So we verified that the sum of yields the original rack . ∎
Note that the sum of such trivial affine mesh is idempotent if and only if , for each .
Theorem 3.7**.**
Let and be two trivial affine meshes, over the same index set . Then the sums of and are isomorphic -reductive racks if and only if there is a bijection of the set and group isomorphisms such that , for every .
Proof.
The proof goes in the same way as the proof of [19, Theorem 4.2] for medial quandles in the case of 2-reductive ones. ∎
Example 3.8**.**
Up to isomorphism, there are exactly five 2-reductive racks of size 3. They are the sums of the following trivial affine meshes:
- •
One orbit:
- •
Two orbits: , and .
- •
Three orbits: .
Theorems 3.6 and 3.7 allow us to enumerate -reductive racks, up to isomorphism. The numbers are presented in Table 1 in Section 8.
4. 2-permutational left quasigroups
Our goal in this paper is to study multipermutation solutions of level 2. In the language of identities they are 2-permutational, see Theorem 7.3. This is why we focus on 2-permutational left quasigroups. In particular, we link them via a permutation to 2-reductive left quasigroups studied in the previous section. We start with a few auxiliary lemmas.
Lemma 4.1**.**
Let be a -permutational left quasigroup. Then for every
[TABLE]
Proof.
[TABLE]
Lemma 4.2**.**
Let be a medial left quasigroup. Then for every
- (1)
; 2. (2)
; 3. (3)
.
Proof.
Directly by mediality we have
[TABLE]
Further, by (2.6)
[TABLE]
which implies
[TABLE]
As we noticed in Examples 2.8 and 2.9, for right cyclic or -permutational left quasigroups , the left quasigroup need not be right cyclic nor -permutational. But under some additional assumptions, they are.
Lemma 4.3**.**
Let be a -permutational medial left quasigroup. Then both left quasigroups and are right cyclic.
Proof.
Let . Then
[TABLE]
Lemma 4.4**.**
Let be a right cyclic medial left quasigroup. Then both and are -permutational.
Proof.
We prove the claim first for using Lemma 2.7. Note that Condition (2.6) for means that for
[TABLE]
Hence,
[TABLE]
and the right-hand side does not depend on . Now, for , we notice that substituting in (2.6) we get which we use in
[TABLE]
where the last equality follows from being -permutational. Again, the right-hand side does not depend on , which finishes the proof. ∎
In the theory of quasigroups (see e.g. [28, Section II.2]), there is a standard method, called isotopy, how to derive a quasigroup from another quasigroup. We do not need this notion in the full generality, we shall present here a special case only.
Definition 4.5**.**
Let be a left quasigroup and be a bijection of the set . Define on the set new binary operations:
[TABLE]
The algebra is called the -isotope of .
Remark 4.6**.**
It is easy to note that
[TABLE]
Therefore is also a left quasigroup. To obtain the multiplication table of for a -isotope of a finite left quasigroup , one should permute all columns of the multiplication table of using the permutation .
Remark 4.7**.**
Let be a non-degenerate left quasigroup. It means that the mapping
[TABLE]
is a bijection. If is a bijection of the set then the mapping
[TABLE]
is a bijection, too. This proves that the left quasigroup , being the -isotope of , is non-degenerate.
Lemma 4.8**.**
Let be a left quasigroup and be a bijection of the set . Then the -isotope of is
- (1)
-reductive if and only if, for every ,
[TABLE] 2. (2)
-permutational if and only if, for every ,
[TABLE] 3. (3)
left distributive if and only if, for every ,
[TABLE]
Proof.
Let be the -isotope of . Hence for every
[TABLE]
∎
Corollary 4.9**.**
Let be a left quasigroup and be a bijection of the set . Then is -permutational if and only if the -isotope of is -permutational.
Proof.
Clearly, Condition (2.11) implies Condition (4.6), for each permutation of the set . Further, by Lemma 4.8(2) it is sufficient to show that left quasigroup which satisfies Condition (4.6) is -permutational. Indeed, for every we have
[TABLE]
∎
Corollary 4.10**.**
Let be a -reductive left quasigroup and be a bijection on the set . Then the -isotope of is a -permutational left quasigroup.
In general -isotope of -reductive left quasigroup does not have to be -reductive. The left quasigroup from Example 2.6 is the -isotope of the -reductive left quasigroup from Example 2.5 but it is not -reductive.
The idea of the next theorem is the following: we already know how to construct 2-reductive racks, using the construction from Section 3. Now, according to Corollary 4.10, -isotopes of these 2-reductive racks are 2-permutational. And we want these -isotopes to be right cyclic.
Theorem 4.11**.**
Let be a -reductive left quasigroup and be a bijection on the set such that for every
[TABLE]
Then the -isotope of is a -permutational right cyclic left quasigroup.
Proof.
Let be the -isotope of . By Corollary 4.10, is -permutational. Further, Condition (4.8) is equivalent to the following one:
[TABLE]
Substituting by and by in (4.9) we obtain:
[TABLE]
Together with Lemma 2.7 this implies that for
[TABLE]
which shows that the left quasigroup is right cyclic. ∎
Example 4.12**.**
By Lemma 3.1, Condition (4.8) is satisfied by every automorphism of a -reductive rack, since for
[TABLE]
On the other hand, each -permutational medial left quasigroup has as an isotope that is a -reductive rack.
Theorem 4.13**.**
Let be a left quasigroup and be a bijection on the set which satisfies Condition (4.5) and such that for each
[TABLE]
Then the -isotope of is a -reductive rack.
Proof.
Let be the -isotope of . By Lemma 4.8(1), is -reductive. Moreover, for we have
[TABLE]
By Lemma 4.8(3) the left quasigroup is left distributive, and in consequence -reductive rack. ∎
Corollary 4.14**.**
Let be a -permutational medial left quasigroup and . Then the -isotope of is a -reductive rack.
Proof.
By Lemmas 4.1 and 4.2, for each
[TABLE]
which shows that Conditions (4.5) and (4.11) are satisfied for . Corollary follows by Theorem 4.13. ∎
Example 4.15**.**
Let be the -permutational medial left quasigroup from Example 2.6 and let . Then , with and , is a -reductive rack with the -multiplication table presented in Example 2.5.
The next example shows that the assumption of mediality in Corollary 4.14 is not always needed.
Example 4.16**.**
Let be a left quasigroup with the following left multiplication:
[TABLE]
i.e. and . This left quasigroup is -permutational, but not medial
[TABLE]
But for Condition (4.11) is satisfied and the -isotope of
[TABLE]
is -reductive rack .
It is worth emphasizing that all results from Sections 2 – 4 established for left quasigroups are also true for right quasigroups, when using their dual versions.
5. Left distributive involutive biracks
In the previous three sections we prepared tools that we shall be now using on biracks – universal algebraic incarnations of set-theoretic solutions of the Yang-Baxter equation. Originally, biracks are algebras studied in low-dimensional topology [11, 9]. The equational definition of a birack we use here was given first in [37]. (Note that Stanovský considered two left quasigroups there.)
Definition 5.1**.**
An algebra with four binary operations is called a birack, if is a left quasigroup, is a right quasigroup and the following holds for any :
[TABLE]
We will say that a birack is left distributive, if is a rack, is right distributive, if for every
[TABLE]
i.e. the right quasigroup is right distributive. The birack is distributive if it is left and right distributive. It is evident that all properties of left distributive biracks stay true in its dual form for right distributive ones.
Example 5.2**.**
Let be a non-empty set and let be two bijections with . An algebra such that for every ,
[TABLE]
is a birack called -permutational (since both quasigroups are -permutational). If , -permutational birack is called a projection birack.
Each -permutational birack is left distributive, since for every
[TABLE]
A birack is idempotent if both one-sided quasigroups and are idempotent. And a birack is involutive if it additionally satisfies, for every :
[TABLE]
Note that Conditions (5.4) and (5.5) give, for every ,
[TABLE]
It follows then, that an involutive birack is idempotent if or is idempotent. We shall see (Corollary 5.8) that an involutive birack is left distributive if and only if it is right distributive.
The next, well known result (see [35, Proposition 1], [7, Proposition 1.5], [20, Section 4.2]) is crucial for our considerations.
Theorem 5.3**.**
An algebra is an involutive birack if and only if is a non-degenerate right cyclic left quasigroup.
Recall, if is a non-degenerate right cyclic left quasigroup then defining for every , , and , the algebra is an involutive birack.
Remark 5.4**.**
Conditions (5.1) – (5.3) and (5.4) – (5.5) are dual with respect to operations and . Thus Theorem 5.3 immediately implies (see [7], [35] or [20, Section 4.2]) that in an involutive birack , the right quasigroup is non-degenerate and left cyclic i.e. for every
[TABLE]
and the mapping
[TABLE]
is a bijection.
Moreover (see [35] and [20, Section 2]), operations and are connected by
[TABLE]
which is equivalent to the fact that the mappings and are mutually inverse. It simply means that each involutive birack is a biquandle (see [37]).
An involutive birack is -reductive if the left quasigroup is -reductive. By Theorem 5.3 and Corollary 3.2 we directly obtain the following.
Corollary 5.5**.**
An involutive birack is left distributive if and only if it is -reductive.
From now on, we will use both terms: a (left) distributive involutive birack and a -reductive involutive birack, interchangeably. In some cases in a birack , the left multiplication and the right multiplication are mutually inverse, i.e. for every , the following condition is satisfied:
[TABLE]
Condition (5.7) is called lri (see [17, Definition 2.18]).
For example, Condition lri is satisfied in idempotent involutive biracks [17, Corollary 2.33]. Moreover, Gateva-Ivanova showed that also -reductive involutive biracks satisfy this condition. Below we present a shorter alternative proof of this fact.
Lemma 5.6**.**
[14, Lemma 7.1]** An involutive -reductive birack satisfies Condition lri.
Proof.
Let be an involutive -reductive birack. Then, for each we obtain
[TABLE]
and
[TABLE]
The converse statement to Lemma 5.6 is not true even for the idempotent case.
Example 5.7**.**
Let be the following idempotent involutive birack: , , . The birack satisfies Condition lri, but it is not -reductive, since .
As a result of Lemma 5.6, one obtains that an involutive left (or right) distributive birack is distributive.
Corollary 5.8**.**
An involutive birack is left distributive if and only if it is right distributive.
Proof.
By Corollary 5.5, an involutive left distributive birack is -reductive and by Lemma 5.6 it satisfies Condition lri. Hence, for every , we have . By Lemma 2.7 is left distributive, and straightforward calculations show that is right distributive.
The proof in the opposite direction follows by the fact that a right distributive right quasigroup satisfies dual -reductive law, and in consequence it also satisfies Condition lri. ∎
Moreover, if is an involutive distributive birack then the left quasigroup and the right quasigroup are mutually orthogonal, i.e. for every , the pair of equations
[TABLE]
has a unique solution: and . Indeed, by Corollary 5.5
the left quasigroup is -reductive. Therefore, we have
[TABLE]
Further, by Lemma 5.6, and . Hence,
[TABLE]
Since by Corollary 5.5, for an involutive distributive birack , the left quasigroup is -reductive, Theorem 3.6 immediately implies
Theorem 5.9**.**
Each involutive distributive birack is a disjoint union, over a set , of abelian groups , for every , with operations:
[TABLE]
for and .
Taking the notion from -reductive racks, we will shortly say that the birack is the sum of a trivial affine mesh over a set . Note that each orbit is a -permutational birack.
Recall Condition discussed in Section 2. Involutive distributive biracks without fixed points are examples of biracks which do not satisfy the condition. The representation of involutive distributive birack as the sum of a trivial affine mesh allows one to verify quickly Condition .
Remark 5.10**.**
Let be an involutive distributive birack. By Theorem 5.9, the birack is the sum of a trivial affine mesh over a set . Then satisfies Condition if and only if
[TABLE]
Remark 5.10 says that an involutive distributive birack satisfies Condition if and only if in each column in the matrix of constants there is at least one [math].
Example 5.11**.**
Let a birack be the sum of the trivial affine mesh . Then is distributive but does not satisfy Condition . This birack is also not -permutational.
Let be a birack. Etingof, Schedler and Soloviev defined in [10] the relation
[TABLE]
By their results, the relation is a congruence of involutive biracks, i.e. an equivalence relation on the set preserving all four operations in a birack .
Example 5.12**.**
Let be an involutive distributive birack. By Theorem 5.9, the birack is the sum of a trivial affine mesh over a set . For and
[TABLE]
Lemma 5.13**.**
Let be an involutive distributive birack. Then the quotient birack is a projection one.
Proof.
By Corollary 5.5, is -reductive. In consequence, . Since the relation is a congruence of , and . By Lemma 5.6, which gives . ∎
6. 2-permutational involutive biracks
Lemma 5.13 shows that, for each involutive distributive birack, its quotient by the relation (5.8) is a projection birack. There are also not distributive involutive biracks such that the quotient is a -permutational birack.
Example 6.1**.**
Let be the following involutive birack:
[TABLE]
i.e. and . Example 2.6 shows that the birack is not left distributive, but the left quasigroup is -permutational. Clearly, the quotient
[TABLE]
is a -permutational, but not a projection birack.
Definition 6.2**.**
An involutive birack is -permutational (medial) if the left quasigroup is -permutational (medial).
Proposition 6.3**.**
An involutive birack is -permutational if and only if it is medial.
Proof.
Let be an involutive -permutational birack. Since the relation (5.8) is a congruence of an involutive birack then by (2.1) and (2.11) for every we have:
[TABLE]
which implies
[TABLE]
By Theorem 5.3, the left quasigroup is right cyclic. Hence for we obtain
[TABLE]
Substitution of by and by gives that the birack is medial
[TABLE]
Lemma 4.4 completes the proof. ∎
Rump showed in [35, Theorem 2] that each finite right cyclic left quasigroup is non-degenerate (see also [20, Proposition 4.7]). Therefore, directly by Theorem 5.3 and Proposition 6.3, we obtain
Corollary 6.4**.**
Each finite -permutational right cyclic left quasigroup is medial.
But the following question is still open.
Question 6.5**.**
Is it true that every infinite -permutational right cyclic left quasigroup is medial?
Corollary 6.6**.**
An involutive -permutational birack is distributive if and only if the quotient is idempotent.
Proof.
By Proposition 6.3 the birack is medial. Let be idempotent. This implies that for each , . Therefore, by Lemma 4.2, for every ,
[TABLE]
Lemma 5.13 completes the proof. ∎
Using Condition lri it is easy to recognize distributive biracks among -permutational involutive ones.
Lemma 6.7**.**
Let be a -permutational involutive birack. Then is distributive if and only if it satisfies Condition lri.
Proof.
Let be -permutational and let it satisfy lri. Then
[TABLE]
The converse follows by Lemma 5.6. ∎
The condition of -permutationality in Lemma 6.7 cannot be weakened, even in the idempotent case, as we see on the next example (see also Example 5.7).
Example 6.8**.**
Let be the following involutive birack: , , . Clearly, the birack satisfies Condition lri, but it is not -permutational, since .
In Section 4 we presented the notion of a -isotope. This construction allows us to tie distributive and 2-permutational biracks.
Let be an involutive birack. By Theorem 5.3, is a right-cyclic, non-degenerate left quasigroup. Let be a bijection of a set such that the -isotope of is right cyclic. Then, by Remark 4.7 and Theorem 5.3, one can define uniquely the involutive birack . We will call the birack obtained in this way the -isotope of . Note that then
[TABLE]
Remark 6.9**.**
Let be an involutive birack and let be a bijection on the set which satisfies Conditions (4.5) and (4.11). By Theorem 4.13, the -isotope of is a -reductive rack and by Lemma 3.3 it is right cyclic. The -isotope of is a distributive involutive birack. Moreover, by Lemma 5.6, satisfies Condition lri, i.e. and . This can be also obtained by direct calculations with use of Condition (4.5).
Let be the -isotope of a finite involutive birack and let satisfy Condition lri. Then the multiplication table of is obtained by a permuting columns of the multiplication table of and the multiplication table of is obtained by a permuting rows of the multiplication table of .
Remark 6.10**.**
Let be an involutive distributive birack and let be a bijection on the set which satisfies Condition (4.8). By Corollary 5.5 and Theorem 4.11, the -isotope of is a -permutational right cyclic left quasigroup. Then the -isotope of is a -permutational involutive birack.
Note that by Lemmas 4.1 and 4.2 for a 2-permutational involutive birack it is always possible to construct its non-trivial -isotope, taking , for any .
Lemma 6.11**.**
Let be a -permutational involutive birack and let . The -isotope of is an involutive distributive birack.
Proof.
By Proposition 6.3, the birack is medial. By Corollary 4.14 the -isotope of is a 2-reductive rack. Then the -isotope of is a distributive involutive birack. ∎
Theorem below shows that each -permutational involutive birack originates from an involutive distributive birack.
Theorem 6.12**.**
Each -permutational involutive birack is a -isotope of a distributive one, for some bijection .
Proof.
Let be a -permutational involutive birack and let . By Lemma 6.11 the -isotope of is a distributive involutive birack.
Let . By Lemma 4.2(3) we have for each
[TABLE]
which shows that the left quasigroup satisfies Condition (4.8), for .
Moreover, for each
[TABLE]
which shows that is the -isotope of the involutive distributive birack . ∎
Now we collect some useful facts about bijections satisfying Conditions (4.5) and (4.8).
Remark 6.13**.**
Let be an involutive birack and let be a bijection on the set which satisfies Condition (4.8). Then, for every ,
[TABLE]
Indeed, by Definition 5.8 we have
[TABLE]
On the other hand,
[TABLE]
Remark 6.14**.**
Let be an involutive birack which satisfies Condition lri. Consider the -isotope of for some bijection of the set . Then satisfies Condition lri if and only if for every
[TABLE]
Indeed, for every
[TABLE]
If happens to be an automorphism of the left quasigroup , then
[TABLE]
Hence, in this case the -isotope of satisfies then Condition lri if and only if the automorphism commutes with each left translation. In particular, the -isotope of an involutive 2-reductive birack is 2-reductive for any choice or , with .
Example 6.15**.**
Let be the -permutational involutive birack with its left quasigroup from Example 2.6. Then the -isotope , with , , and is an involutive distributive birack with the -table presented in Example 2.5.
Example 6.16**.**
Let be the distributive involutive birack with the left quasigroup defined in Example 2.5. Note that the permutation satisfies Condition (4.8). Then constructing the -isotope of we obtain the 2-permutational involutive birack with the -table presented in Example 2.6. The -table is the following
[TABLE]
Since and , the birack does not satisfy Condition lri.
Note that different choices of a bijection in the construction of the isotope may give non isomorphic biracks.
Example 6.17**.**
Let be the -permutational involutive birack with multiplication
[TABLE]
i.e. , and . Then -isotopes, for , of have the following multiplication tables of
[TABLE]
Both isotopes are distributive. It is clear that these two biracks are not isomorphic, as the -isotope is idempotent, whereas the -isotope is not.
Example 6.18**.**
In Example 6.16 we showed that the birack with the -table presented in Example 2.6 is the -isotope, for , of the distributive birack with the left quasigroup defined in Example 2.5. Nevertheless, there is another choice of a permutation that yields another birack. If we take then this satisfies Condition (4.8) as well and we obtain the involutive 2-permutational birack with multiplication :
[TABLE]
which is clearly not isomorphic to the birack . Note that both permutations and are actually automorphisms of the birack but neither the -isotope nor the -isotope is isomorphic to .
For an involutive birack , a bijection on the set is an isomorphism between the -isotope and the -isotope of if and only if
[TABLE]
Hence, we obtain the following observation.
Remark 6.19**.**
Let be an involutive birack. An automorphism of is an isomorphism between the -isotope and the -isotope of if and only if
[TABLE]
7. Solutions
As it was written in Section 1, each solution of the Yang-Baxter equation yields an involutive birack . And conversely, if is an involutive birack, then defining
[TABLE]
we obtain a solution of the Yang-Baxter equation.
Such an equivalence allows us to treat each solution as an involutive birack and formulate results from Sections 5 and 6 in the language of solutions. In particular, -permutational birack corresponds to a permutation solution and the projection birack corresponds to the trivial solution.
Etingof et al. reasoned that the quotient set , by the relation (5.8), has a structure of a solution with and for and . They called such solution the retraction of and denoted it by . The birack corresponding to the retraction solution is the quotient birack .
Among solutions, an important role is played by multipermutation solutions, see e.g. [5, 15, 39]. Let be a solution. One defines iterated retraction in the following way: and , for any natural number . A solution is called a multipermutation solution of level if is the least nonnegative integer such that
[TABLE]
In the language of an involutive birack this means that applying times the congruence to the subsequent quotient biracks, one obtains the one-element birack.
Let us consider , the quotient birack of and denote it by . Let and , for any natural number .
Definition 7.1**.**
An involutive birack is a multipermutation birack if there exists a positive integer such that is a -permutational birack. A birack of is called a multipermutation birack of level if is the least nonnegative integer such that
[TABLE]
A birack is irretractable if , i.e. is the trivial relation.
Observation 7.2**.**
[16, Section 3]** Let . A square-free solution is a multipermutation solution of level if and only if is a trivial solution.
Theorem 7.3**.**
[14, Proposition 4.7]** Let be a solution and . is a multipermutation solution of level if and only if Condition (2.5) holds for the corresponding birack .
Definition 7.4**.**
A solution is distributive (-reductive, -permutational, medial, respectively), if it corresponds to a distributive (-reductive, -permutational, medial, respectively) involutive birack.
Fact 7.5**.**
[15, Proposition 8.2]**, [14, Proposition 4.7] A square-free solution is multipermutation of level if and only if it is distributive. In this case it has an abelian permutation group . More generally, if a solution satisfies Condition then it is a multipermutation solution of level if and only if it is -reductive.
By Corollary 5.5, Proposition 6.3, Corollary 6.6 and Theorem 7.3, we can generalize some results given in [17, 15, 14].
Theorem 7.6**.**
Let be a solution. Then
- (1)
* is a multipermutation solution of level if and only if it is medial.* 2. (2)
If is distributive then it is a multipermutation solution of level .
Theorem 7.7**.**
Let be a multipermutation solution of level . The following conditions are equivalent:
- (1)
* is distributive,* 2. (2)
* is -reductive,* 3. (3)
* satisfies Condition lri, i.e. ,* 4. (4)
* is the trivial solution.*
By Theorem 5.9 we can completely describe all distributive solutions.
Theorem 7.8**.**
Each distributive solution is a disjoint union, over a set , of abelian groups , for every , with
[TABLE]
where and .
By Corollary 5.8 each distributive solution satisfies Condition stu, introduced in [17, Definition 5.1], which means that it is trivially a strong twisted union of abelian groups .
Example 7.9**.**
Let be a (finite or infinite) index set and let , for , be cyclic groups. Let be constants such that , for all , and, for each , there exists at least one , such that is a generator of the group . Then , with and defined in (7.1), is a distributive solution.
We can construct all distributive solutions of size using the following algorithm:
Algorithm 7.10**.**
Outputs all distributive solutions of size :
- (1)
For all partitionings do (2)–(4). 2. (2)
For all abelian groups , …, of size do (3)–(4). 3. (3)
For all constants do (4). 4. (4)
If, for all , we have then construct a solution using (7.1).
When all solutions are constructed, we can get rid of isomorphic copies using Theorem 3.7.
In [4] the permutation group of a finite solution was called the involutive Yang-Baxter group (IYB group) associated to the solution . In particular, Cedo et al. showed in [4, Corollary 3.11] that each finite nilpotent group of class 2 (and thus each finite abelian group) is an IYB group. Here, using the construction of the sum of a trivial affine mesh, we present short direct proof of this fact for an abelian group of an arbitrary cardinality.
Theorem 7.11**.**
Let be an abelian group. Then there exists a solution with its permutation group isomorphic to .
Proof.
Let be generated by a (finite or infinite) set . We construct the solution as the sum of the trivial affine mesh over , with and , for all .
By construction, , for all and . Therefore the permutation group consists solely of mappings , for each and some . This means that the group naturally embeds into . Moreover, the permutation group is generated by , for , and hence it is isomorphic to . ∎
By Corollary 4.14 and Lemma 6.11 each multipermutation solution of level 2 defines a distributive one.
Theorem 7.12**.**
Let be a multipermutation solution of level and . Then , where and , for , is a distributive solution.
On the other side, Theorem 6.12 shows that each multipermutation solution of level 2 originates from a distributive solution. We have even more. The theorem gives a procedure how to obtain all multipermutation solutions of level from distributive ones.
We have to take all distributive solutions such that there exists with and, for each of them, all permutations of the set which satisfy Condition (4.8) i.e. for
[TABLE]
Then , where and , will be multipermutation solutions of level .
By Lemma 6.7 and Remark 6.13 we can construct all non-distributive solutions of multipermutation level 2 of size .
Algorithm 7.13**.**
Outputs all non-distributive solutions of multipermutation level 2 of size :
- (1)
For every distributive solution of size do (2)–(7). 2. (2)
If there exist no such that return to (1). 3. (3)
For every permutation do (4)–(6). 4. (4)
If , return to (3). 5. (5)
If does not send classes of onto classes of , return to (3). 6. (6)
If does not satisfy (4.8), return to (3). 7. (7)
Construct the solution , where and .
Unlike in the case of distributive solutions, we do not have any efficient criterion to test isomorphisms. As Example 6.17 shows, the same solutions can be obtained from different distributive solutions.
8. Enumeration
In this section we enumerate solutions of multipermutation level 2 for small sizes and we estimate, for all sizes, how many racks and solutions are there, up to isomorphism.
Using the characterization by sums of trivial affine meshes we can straightforwardly describe all solutions of small sizes. The size 4 can be done manually.
Example 8.1**.**
By results of [10], there are 23 solutions of size 4, up to isomorphism. Two of them are irretractable. Exactly 17 of them are distributive. They are the sums of the following trivial affine meshes:
- •
One orbit:
- •
Two orbits: , , , ,
, , , ,
, .
- •
Three orbits: , , ,
, .
- •
Four orbits: .
There remain four multipermutation solutions of size that are not distributive. Two of them are of level , both of them described in Example 6.18. Two of them are of level - the corresponding biracks have the following tables of -multiplication:
[TABLE]
They are not isomorphic since the first one has two idempotent elements, whereas the other one has none.
The same way as we did it for size , we can compute other small sizes, on a computer of course. We start with the numbers of small racks. In Table 1, we compare the numbers of isomorphism classes of all racks (see OEIS sequence A181770 [27]) and 2-reductive racks. Computing -reductive racks directly using Theorems 3.6 and 3.7 is hopeless for larger numbers. Hence the numbers of -reductive racks were computed using Burnside’s lemma, see [19] for more details.
As we can see, the numbers of -reductive racks grow really fast, actually, according to Blackburn [2], there are at least -reductive racks of size . We can also give an upper bound, which is not far from the lower bound. The proof is exactly the same as the proof of [19, Theorem 8.2].
Theorem 8.2**.**
There are at most -reductive racks of size , up to isomorphism.
The numbers in Table 1 suggest that the vast majority of all racks are -reductive. However, we do not have any proof of this fact. Hence we can only conjecture that:
Conjecture 8.3**.**
There are racks of size , up to isomorphism.
In Table 2, we can see the numbers of solutions. The total numbers of solutions is taken from [10], the numbers of -reductive solutions are the same as the numbers of -reductive racks. The numbers of -permutational solutions (i.e. multipermutation solutions of level ) that are not -reductive were computed by a brute force search algorithm using the Mace4 software [25].
Theorem 8.4**.**
There are at most multipermutation solutions of level of size , up to isomorphism.
Proof.
As was shown in Theorem 7.12, every multipermutation solution of level can be obtained as an isotope of a -reductive solution using a permutation. Hence, using Theorem 8.2, the number of -permutational solutions is less than . ∎
In the case of solutions, Table 2 suggests that the numbers of all solutions grow faster than the numbers of multipermutation solutions of level but not much faster. We can therefore conjecture:
Conjecture 8.5**.**
There are solutions of size , up to isomorphism.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Aczél, On mean values , Bull. Amer. Math. Soc. 54 (1948), 392–400.
- 2[2] S. Blackburn, Enumerating finite racks, quandles and kei , Electron. J. Combin. 20 (2013), no. 3, Paper 43, 9 pp.
- 3[3] J.S. Carter, A survey of quandle ideas in: Kauffman, H. Louis (ed.) et al., Introductory lectures on knot theory, Series Knots and Everything 46 , World Sci. Publ., Hackensack, NJ, (2012), 22–53.
- 4[4] F. Cedó, E. Jespers, Á. del Río, Involutive Yang-Baxter groups , Trans. Amer. Math. Soc. 362 (2010), 2541–2558.
- 5[5] F. Cedó, E. Jespers, J. Okniński, Retractability of set theoretic solutions of the Yang-Baxter equation , Adv. Math. 224 (2010), 2472–2484.
- 6[6] P. Dehornoy, Braids and self-distributivity , Progress in Maths 192, Birkhauser, 1999.
- 7[7] P. Dehornoy, Set-theoretic solutions of the Yang-Baxter equation, RC-calculus, and Garside germs , Adv. in Math. 282 (2015), 93–127.
- 8[8] V.G. Drinfeld, On some unsolved problems in quantum group theory , In: P.P. Kulish (ed.) Quantum groups, in: Lecture Notes in Math., vol. 1510, Springer-Verlag, Berlin, (1992), pp. 1–8.
