Abstract
In this paper, we determine all the Rota-Baxter operators of weight zero on semigroup algebras of order two and three with the help of computer algebra. We determine the matrices for these Rota-Baxter operators by directly solving the defining equations of the operators. We also produce a Mathematica procedure to predict and verify these solutions.
Keywords: Matrix, Mathematica, Rota-Baxter algebra, semigroup, semigroup algebra
2010 MATHEMATICS SUBJECT CLASSIFICATION: 16W99, 16S36, 20M25, 16Z05
1. Introduction
Rota-Baxter operators arose from the probability study of G. Baxter in 1960 [7], defined by the operator identity
| (1) |
where λ is a fixed scalar called the weight. When λ = 0, the operator is a natural algebraic generalization of the integral operator. In the 1960s and 70 s, these operators attracted attention from well-known analysts such as Atkinson [2] and combinatorialists such as Cartier and Rota [10, 39, 40]. In the 1980s these operators were studied in integrable systems as the operator form of the classical Yang-Baxter equations [41], named after the well-known physicists C.N. Yang and R.J. Baxter. Since the late 1990s, the study of Rota-Baxter operators has made great progress both in theory and in applications in combinatorics, number theory, operads, boundary value problems and mathematical physics [3–6, 9, 11, 17, 20–22, 38].
Rota-Baxter algebras arising naturally from applications as well as theoretical investigations (e.g. free Rota-Baxter algebras [16, 21]) are mostly infinite dimensional. To study finite dimensional Rota-Baxter algebras in general, it is useful to start with low dimensional Rota-Baxter algebras. Even there computations are quite complicated. In recent years, some progress regarding such computations has been achieved, with applications to pre-Lie algebras, dendriform algebras and the classical Yang-Baxter equation [1, 28, 35, 43]. In this paper, we study Rota-Baxter operators on a class of low dimensional algebras, namely semigroup algebras for small order semigroups.
Semigroup algebras, a natural generalization of group algebras, form an important class of associative algebras arising from semigroups [34]. The representation of semigroups leads to a semigroup algebra satisfying polynomial identities. In this regards, Rota-Baxter operators on a semigroup algebra can be regarded as an operated semigroup algebra satisfying an operator identity. It has been shown that every finite dimensional algebra of finite representation type over an algebraically closed field is a contracted semigroup algebra. Recently, semigroup algebras have experienced rapid development on the theoretical side [13, 14, 24, 25] as well as in applications to representation theory, cohomology, geometric group theory, topology, combinatorics, algebraic geometry, and number theory [8, 19, 26, 27, 30–33, 42]. Thus studying semigroup algebras in their canonical basis has a significance of its own.
In this paper, we classify all Rota-Baxter operators on semigroup algebras of order 2 and 3. Through studying Rota-Baxter operators on low dimensional semigroup algebras, we hope to find patterns for the study of Rota-Baxter operators on general semigroup algebras. See Section 6 for further details. Rota-Baxter operators on associative algebras of dimension 2 and 3 have been determined up to isomorphism in [28]. Here we focus on the particular presentation of such an algebra in terms of the canonical semigroup algebra basis, because of the aforementioned importance of using such a basis. Indeed, as one notices by comparing the classifications given here with the ones in [28], the resulting Rota-Baxter operators take a very different form.
Because of the complex nature of Rota-Baxter operators, determining their classification by hand is challenging even for low dimensional algebras, as observed in [1, 28, 43]. In such a case, computer algebra provides an indispensable aid for both predicting and verifying these operators. Nevertheless, for ensuring theoretical accuracy, it is still necessary to carry out a rigorous proof of the classification. In Section 2, we start by developing the general setup of the equations that serve as the necessary and sufficient conditions characterizing a Rota-Baxter operator on a semigroup algebra. We then provide the Mathematica procedure that has helped us in solving the classification problem. In Section 3, we classify all Rota-Baxter operators on semigroup algebras of order 2. For Rota-Baxter operators on semigroup algebras of order 3, we carry out the classification in two sections, with Section 4 for commutative semigroup algebras and Section 5 for noncommutative semigroup algebras. We end the paper with some conclusion remarks.
2. The general setup and the computer algebra procedure
In this section, we first formulate the general setup for determining Rota-Baxter operators of weight zero on a semigroup algebra. We then implement this setup in Mathematica to obtain a procedure that helped us to obtain classifications of Rota-Baxter operators on semigroup algebras of order two and three.
2.1. The general setup
In this subsection, we give the general setup of Rota-Baxter operators on a semigroup algebra in matrix form. Let S be a finite semigroup with multiplication that we often suppress. Thus . Let be a commutative unitary ring and let
| (2) |
denote the semigroup algebra of S. The order n of the semigroup S is also said to be the order of the semigroup algebra .
Let be a Rota-Baxter operator of weight zero. Since P is -linear, we have
| (3) |
The matrix is called the matrix of P. Further, P is a Rota-Baxter operator if and only if
| (4) |
Let the Cayley (multiplication) table of the semigroup S be given by
| (5) |
where . Then we have
and
Thus we obtain
Theorem 2.1.
Let be a semigroup with its Cayley table given by Eq. (5). Let be a commutative unitary ring and let be a linear operator with matrix . Then P is a Rota-Baxter operator of weight zero on if and only if the following equations hold.
(6) We will determine the matrices CP for all Rota-Baxter operators P on of order two or three.
2.2. The Mathematica procedure
In this subsection, we describe the computer algebra procedure (implemented in Mathematica) for computing the Rota-Baxter operators on semigroup algebras of semigroup of order 3, listed in Tables 1 and 2. This procedure serves both for guiding and verifying the manual proofs of the classification theorems carried out in later sections of the paper.
Table 1.
Table of commutative semigroups of order 3.
| CS of order 3 | CS of order 3 | CS of order 3 | CS of order 3 |
|---|---|---|---|
Table 2.
Cayley table of noncommutative semigroups of order 3.
The Mathematica code and accompanying syntax definitions are given in Figure 1. The function RBA with four arguments creates Eq. (6) for a fixed pair of elements, which are then instantiated by all generator pairs. For added clarity, we have also displayed the general form of these equations for the generic 2 × 2 Cayley table defined at the beginning. The main function for determining Rota-Baxter operators is FindRBO, which works by solving the equations created by RBA. For converting a given Cayley table to the structure constants used in Eq. (6), the function SGM is employed.
Figure 1.
The procedure for computing Rota-Baxter operators on semigroup algebras.
We illustrate these functions by considering the first semigroup of Table 1; for the detailed computation we refer to Section 4.2.1. The underlying set of CS(1) here will be simplified to {1, 2, 3}. The Mathematica code above yields the results given in Figure 2. In fact, the output gives two Rota-Baxter operators for CS(1), but the second is a special case of the first. Let , where . Then and , so we obtain the matrix
the transpose of which is given in Table 3 as .
Figure 2.
Results of the Mathematica code on CS(1).
Table 3.
RBOs on commutative semigroup algebras of order 3.
| CS of order 3 | Matrices of RBOs on semigroup algebras | CS of order 3 | Matrices of RBOs on semigroup algebras |
|---|---|---|---|
| CS(1) | CS(2) | ||
| CS(3) | CS(4) | ||
| CS(5) | CS(6) | ||
| CS(7) | CS(8) | ||
| CS(9) | CS(10) | ||
| CS(11) | CS(12) |
3. Rota-Baxter operators on semigroup algebras of order 2
In this section, we determine all Rota-Baxter operators on semigroup algebras of order 2.
As is well known [37], there are exactly five distinct nonisomorphic semigroups of order 2. We use and Z2 respectively to denote the null semigroup of order 2, the left zero semigroup, right zero semigroup, the semilattice of order 2 and the cyclic group of order 2. Since L2 and R2 are anti-isomorphic, there are exactly four distinct semigroups of order 2, up to isomorphism and anti-isomorphism, namely N2, Y2, Z2 and L2. Let denote the underlying set of each semigroup. Then the Cayley tables for these semigroups are as follows:
Theorem 3.1.
Let be a field of characteristics zero. All Rota-Baxter operators on a semigroup algebra of order 2 have their matrices CP given in Table 4, where all the parameters are in and RBO resp. SA is the abbreviation of Rota-Baxter operator resp. semigroup algebra.
Table 4.
Table of RBOs on two-dimensional semigroup algebras.
| Semigroup of order 2 | RBOs on SA | Semigroup of order 2 | RBOs on SA |
|---|---|---|---|
| N2 | Z2 | ||
| Y2 | L2 |
Proof.
We divide the proof of the theorem into four cases, one for each of the four semigroups S in Table 5. For each case, by Theorem 2.1, P is a RBO on if and only if the eight Equations (6) hold (with ). So we just need to solve these equations. It is straightforward to verify that what we obtain does satisfy all equations. Let denote the 2 × 2 zero matrix.
Case 1. Let S = N2: In Eq. (6), taking with and with , we get
(7)
(8)
(9)
(10) Assume . Then by Eqs. (7) and (8), we have , a contradiction to . Thus . Assume . Then by Eq. (10), we get , and so . Then by Eq. (9), we have , a contradiction. Thus . Therefore Eqs. (7)–(10) are equivalent to
Denoting and , we see that solutions of Eqs. (7)–(10) are of the form
It is straightforward to check that they also satisfy the other equations in Eq. (6). Hence these are all the matrices CP for Rota-Baxter operators on .
Case 2. Let S = Y2: In Eq. (6), taking with and with , we obtain
(11)
(12)
(13)
(14) From Eq. (11) we have . Then from Eq. (12) we have . Thus Eq. (14) gives . Further by Eq. (13), we have . Thus the only solution is the zero solution .
Case 3. S = Z2: In Eq. (6), taking with ; with m = 2 and with m = 1, we obtain
(15)
(16)
(17)
(18) By Eq. (16) we have . From Eq. (17) we get . Thus . Then Eqs. (15) and (18) give . Thus the only solution is the zero solution
Case 4. S = L2: In Eq. (6), taking with and with , we get
(19)
(20)
(21)
(22) By Eqs. (19) and (22), we have . By Eqs. (20) and (21), we get and . Assume . Then . So by Eq. (19), we have and then , a contradiction. Thus . Then Eqs. (19)–(22) are equivalent to the system of equations
Denoting and , then . When , then we also have . This gives the solutions
On the other hand, when b = 0, then . Denoting , we get the solutions
These solutions to Eqs. (19)–(22) also satisfy the other equations in Eq. (6). Thus they give all the Rota-Baxter operators on .
This completes the proof of Theorem 3.1. □
Table 5.
The Cayley tables of semigroups of order 2.
4. Rota-Baxter operators on commutative semigroup algebras of order 3
Up to isomorphism and anti-isomorphism, there are 18 semigroups of order 3 [12, 15, 18]. The Cayley tables of the 18 semigroups of order 3 can be found in [18]. See also [12, 29, 36]. We denote by CS and NCS the class of 12 commutative semigroups and the class of 6 noncommutative semigroups, respectively.
When a semigroup S has order 3, the equations in Eq. (6) for the matrix CP of a Rota-Baxter operator P on are given by the following 27 equations.
| (23) |
In this section, we determine the Rota-Baxter operators on the semigroup algebras for the 12 commutative semigroups of order 3 in Table 1. Rota-Baxter operators on semigroup algebras for the 6 noncommutative semigroups of order 3 will be determined in Section 5.
4.1. Statement of the classification theorem in the commutative case
A classification of the 12 commutative semigroups of order 3 is given in Table 1.
We have the following classification of Rota-Baxter operators on order 3 commutative semigroup algebras. The proof will be given in Section 4.2.
Theorem 4.1.
Let be a field of characteristic zero. The matrices of Rota-Baxter operators on 3-dimensional commutative semigroup algebras are given in Table 3, where all the parameters take values in and RBO resp. CS is the abbreviation for Rota-Baxter operator resp. commutative semigroup.
4.2. Proof of Theorem 4.1
We will prove Theorem 4.1 by considering each of the 12 commutative semigroups of order 3 in Table 1. For each semigroup, we solve some of the equations in Eq. (23) for the Cayley table of the corresponding semigroup. It is straightforward to verify that what we obtain this way indeed satisfies all the equations in Eq. (23). Let denote the 3 × 3 zero matrix.
4.2.1. The proof for
We prove that the matrices of all the Rota-Baxter operators P on the semigroup algebra are given by in Table 3.
Applying the Cayley table of CS(1) in Eq. (23) and taking with ; i = 1,j = 2, 3 with m = 1 and i = 2, 3, j = 1 with m = 1, respectively, we obtain
| (24) |
| (25) |
| (26) |
| (27) |
| (28) |
| (29) |
| (30) |
Assume Then by Eqs. (24), (25) and (26), we get
So we have . This contradicts . Thus . By Eqs. (27) and (28), we have and Then by Eqs. (29) and (30), we get and . So we have and . From these discussions, we see that Eqs. (24)–(30) are equivalent to
So we have
Denote . Thus solutions of Eqs. (24)–(30) are given by
Since they can be checked to satisfy other equations in Eq. (23), they give the matrices of all the Rota-Baxter operators on .
4.2.2. The proof for
Here we prove that the matrices of all the Rota-Baxter operators P on the semigroup algebra are given by and in Table 3.
Applying the Cayley table of CS(2) in Eq. (23) and taking with and with m = 1, 2, we obtain
| (31) |
| (32) |
| (33) |
| (34) |
| (35) |
| (36) |
| (37) |
| (38) |
| (39) |
Assume . Then by Eqs. (32) and (33), we have . By Eq. (31), we have . This contradicts . Thus we have . By Eq. (32), we have . So . Then by Eqs. (34) and (35), we get and . From Eq. (37), we obtain . Then Eq. (36) gives . Adding Eqs. (38) and (39), we get . So . By Eq. (39), we have . Thus or Denote . Then and . We consider two cases.
Case 1. Suppose : Then . Then we have . Thus we get the solutions
Case 2. Suppose : Then . Thus
So . Thus we get the solutions
They also satisfy the other equations in Eq. (23) hence give all the Rota-Baxter operators on .
4.2.3. The proof for
Here we prove that the matrices of all the Rota-Baxter operators P on the semigroup algebra are given by in Table 3.
Applying the Cayley table of CS(3) in Eq. (23) and taking with m = 2; with m = 1, 3; with and with , we obtain
| (40) |
| (41) |
| (42) |
| (43) |
| (44) |
| (45) |
| (46) |
| (47) |
| (48) |
Eq. (42) gives
Thus by Eq. (41), we have and so . Then by Eq. (40), we have . Thus Eq. (44) gives . By Eq. (45), we have , and so . Then Eq. (43) gives . By Eq. (47), we have . Then by Eqs. (46) and (48), we can obtain . Let . Thus solutions of Eqs. (40)–(48) are given by
It can be checked that they also satisfy the other equations in Eq. (23) and hence give all the Rota-Baxter operators on .
4.2.4. The proof for
We prove that the matrices of all the Rota-Baxter operators P on the semigroup algebra are given by in Table 3.
Applying the Cayley table of CS(4) in Eq. (23) and taking with ; with and with , we obtain
| (49) |
| (50) |
| (51) |
| (52) |
| (53) |
| (54) |
| (55) |
| (56) |
| (57) |
By Eqs. (50) and (51) and using Eq. (49), we have and . So and . Then Eq. (49) gives . Thus . Then we get . By Eq. (53), we have . Thus Eqs. (52) and (54) give and . Eq. (57) gives and so Eqs. (55) and (56) give . Thus the system in Eq. (23) only has the zero solution
4.2.5. The proofs for when
The proofs for the semigroups , and CS(10) are similar to the proof for CS(4). So their proofs are omitted here but could be found in the on-line version [23]. Likewise the proofs for the semigroups , and CS(11) are similar to the proof for CS(3) and hence is left in [23].
4.2.6. The proof for
We finally prove that the matrices of the Rota-Baxter operators P on the semigroup algebra are given by in Table 3.
Applying the Cayley table of CS(12) in Eq. (23) and taking with ; with m = 2, 3; with m = 2, 3; with ; with m = 2, 3 and with , we obtain
| (58) |
| (59) |
| (60) |
| (61) |
| (62) |
| (63) |
| (64) |
| (65) |
| (66) |
| (67) |
| (68) |
| (69) |
| (70) |
| (71) |
| (72) |
Denote and . By Eqs. (66) and (71), we get
So
| (73) |
By Eqs. (60) and (67), we have
Thus
Using Eq. (73), we obtain , and so . Similarly, by Eqs. (59) and (66), and Eqs. (60) and (72), we get and , respectively. This means that
| (74) |
and
| (75) |
We consider two cases.
Case 1. abc = 0: There are three subcases to consider.
Subcase 1. a = b = c = 0: Then by Eqs. (60), (68) and (61), we have and . By Eqs. (58), (65) and (70), we obtain . Thus the only solution is given by the zero matrix .
Subcase 2. Two of a, b, c are 0: Without loss of generality, we may assume and . From Eq. (72), we obtain . Then by Eq. (64), we have c = 0, a contradiction. Thus this case can not occur.
Subcase 3. One of a, b, c is 0: We may assume without loss of generality that a = 0, and . By Eq. (59), we have . Then or . If , then by Eq. (62), we have , and so . By Eq. (67), . Thus c = 0. This contradicts . If , then by Eq. (62), . By Eq. (60), we have . Thus b = 0, a contradiction. We see that this case also can not occur.
Case 2. abc : Then and If one of is 0, we may assume , and then by Eqs. (74 and (75), we obtain . So Eq. (59) gives , a contradiction. Thus c12, c22 and c32 are nonzero. Since and , we have So . Thus . Similarly, we have and So . Thus . Similarly, we have . By Eqs. (66) and (69), we get
Since , we have . So . Since , we have
| (76) |
We further divide into two subcases.
Subcase 1. : By Eq. (76), we have . From and , we obtain and . By Eq. (59), we have . So . By Eq. (72), we get . Thus we get . So by , we get bc = 0, a contradiction.
Subcase 2. : Then . Adding Eqs. (67) and (71), we obtain . So we have . By Eq. (74), we have . Since , we have . Then by , we have , and so ab = 0, again a contradiction.
In summary, the only solution for is the zero solution , as claimed.
Now the proof of Theorem 4.1 is completed.
5. Rota-Baxter operators on noncommutative semigroup algebras of order 3
In this Section, we classify all Rota-Baxter operators on noncommutative semigroup algebras of order 3.
5.1. Statement of the classification theorem in the noncommutative case
A classification of the six noncommutative semigroups of order 3, up to isomorphism and anti-isomorphism, is given in Table 2.
For Rota-Baxter operators on the corresponding semigroup algebras, we have the following classification theorem whose proof will be given in Section 5.2
Theorem 5.1.
Let be a field of characteristic zero that is closed under taking square root. The matrices of the Rota-Baxter operators on noncommutative semigroup algebras of order three are given in Table 6, where all the parameters take values in and i denotes as usual.
Table 6.
RBOs on noncomumutative semigroup algebras of order 3.
| Semigroups | Matrices of Rota-Baxter operators on semigroup algebras |
|---|---|
5.2. Proof of Theorem 5.1
We will prove Theorem 5.1 case by case for the six semigroups in Table 2.
5.2.1. The proof for
We first prove that the matrices of the Rota-Baxter operators P on the semigroup algebra are given by , in Table 6.
Applying the Cayley table of NCS(1) in Eq. (23) and then taking with ; with ; with m = 1; with and with m = 1, 3, we obtain
| (77) |
| (78) |
| (79) |
| (80) |
| (81) |
| (82) |
| (83) |
| (84) |
| (85) |
| (86) |
| (87) |
| (88) |
| (89) |
| (90) |
| (91) |
By Eq. (79) we have Then by Eq. (77) we get So we get . Then Eq. (78) gives . We divide the rest of the proof into two cases depending on whether or not .
Case 1. : Then . There are two subcases to consider.
Subcases 1. : Then by Eqs. (84) and (89), we have . So by Eq. (83), we get . Denote , where . If , then we get the solution
If , then by Eq. (90), we have . Thus we get . So . Thus we obtain the solution
Subcase 2. : Denote . Then . By Eq. (85), we have . Denote . Then . Thus Eq. (84) gives . We subdivide further into two cases.
(1) If , then by Eq. (90), we have . So we get
Note that if , then , a contradiction. Thus , and so . By Eq. (86), we have . Thus . Thus we get the solutions
(2) If then . Since . Then by Eq. (83), we have . Thus . Thus we obtain the solutions
Case 2. : Denote . Then . Since , Eq. (81) becomes . Then . So by Eq. (84), we obtain . Further, by Eq. (91), we have . Thus by Eq. (86), .
We divide into two subcases to consider.
Subcase 1. : Then . By Eq. (80), . Then we obtain . So we have . Thus we obtain the solutions
Subcase 2. : Denote . Then . Thus by , we have and by Eq. (85), , we get . Then we solutions
In summary, we get get solutions of Eqs. (77)–(91)
It can be checked that they also satisfy the other equations in Eq. (23) and hence give matrices of Rota-Baxter operators on .
5.2.2. The proof for where
The proof of these cases are similar to the one for in that the proofs are carried out by (iterated) bisecting depending on whether or not certain elements are zero. Details of the proofs are provided in [23]. So we next move on to the proof of .
5.2.3. The proof for
We next prove that the matrices of the Rota-Baxter operators on the semigroup algebra are given by in Table 6.
Applying the Cayley table of NCS(5) in Eq. (23) and then taking with ; with and with , we obtain
| (92) |
| (93) |
| (94) |
| (95) |
| (96) |
| (97) |
| (98) |
| (99) |
| (100) |
From Eq. (100), we have . Denote , and . Then . So we have . Denote . So and .
We divide the proof into five cases.
Case 1. a, b, c, and d are nonzero: Then and c23 are nonzero. By Eqs. (94) and (98), we have
Thus
| (101) |
Then by Eqs. (98) and (101), we obtain
| (102) |
Applying Eqs. (97) and (101), we have
| (103) |
In Eq. (93), by replacing c11 and c22 by and , respectively, we get
| (104) |
If , then . Thus by Eq. (104), ab = 0, a contradiction. Thus we have . So and . By Eq. (104) again, we get Thus . Since . Then by Eq. (101), . By Eqs. (102) and (103) and , we get and . Thus we obtain the solutions
Case 2. Exactly one of is 0: Then there are four subcases to consider.
Subcase 1. a = 0 and : Then , and . By Eq. (94), we have . So . Thus by Eq. (92), . Then Eq. (97) gives and Eq. (100) gives . So . By Eq. (95), we have . So . Thus we obtain the solutions
Subcase 2. b = 0 and : Then and . Then by Eq. (99), . So and then by Eq. (96), . By Eq. (94), we have Then Eq. (100) gives . Thus . By Eq. (97), we have So . Then we obtain the solutions
Subcase 3. c = 0 and : Then By Eq. (98), we have . So . By Eq. (92), we have . Thus Eq. (99) gives and Eq. (100) gives . Thus . By Eq. (94), we have . Then we obtain the solutions
Subcase 4. d = 0 and : Then by Eq. (97), we have . So . Thus by Eq. (96), we have . So Eq. (94) gives . Furthermore, by Eq. (100), we have . Thus . By Eq. (99), we get . Then we obtain the solutions
Case 3. Exactly two of are 0: There are six subcases to consider. But note that if and , i.e. and , then by Eq. (99), we have . So . Thus Eqs. (92) and (96) give and , respectively. Then by Eq. (95), we have , a contradiction. Similarly, if and , then we can obtain , a contradiction. So there are four subcases left to consider.
Subcase 1. and : Then and . Thus by Eq. (94), we have . So . Thus by Eq. (92), we have . Then Eq. (99) gives . By Eq. (100), we have . Thus we get . Then we get the solutions
Subcase 2. and : Then and . Eq. (100) gives . Then by Eq. (98), we obtain . From Eq. (99), we have .
(1) If , then . By Eq. (96) we have . So . Then we obtain the solutions
(2) If , then denote . Thus by , we have . By Eq. (95), we have . Thus . So we have . Then we obtain the solutions
In summary, we obtain the solutions
Subcase 3. and : This subcase is similar to the above Subcase 2. Denote . Then we can obtain the solutions
Subcase 4. and : By Eq. (100), . Then by Eq. (94), we have . Then we can obtain the solutions
Case 4. Exactly three of are 0: Then we divide into four subcases to consider.
Subcase 1. and : Then and . Thus by Eq. (94), we have . So and then Eqs. (92) and (96) give . By Eq. (100), we have . Denote . Then we obtain the solutions
Similarly, we obtain the following solutions for the rest of the subcases.
Subcase 2. and : Denote . Then we have
Subcase 3. and : Denote . Then we have
Subcase 4. and : Denote , where . Then we have
Case 5. : By Eq. (100), we have . Denote and . Then by Eqs. (92) and (96), we have and .
(1) If or , by Eqs. (93) and (95), we have . Then we can obtain the solutions
(2) If , then by Eqs. (92) and (96), we have . Thus we obtain the zero solution
In summary, we obtain the solutions
This completes the proof of the case for .
With the remark made in Section 5.2.2, now the proof of Theorem 5.1 is completed.
6. Conclusion
We have presented a complete and explicit classification of Rota-Baxter operators on semigroup algebras for the orders 2 and 3. With some care taken to ensure efficient calculations, the same approach could be used for classifying all semigroup algebras over semigroups of order 4. This would provide a valuable stock of “finite” exemplary objects in the Rota-Baxter category. It would also be interesting to explore Rota-Baxter structures on other classes of algebras, e.g. low-dimensional path algebras, matrix rings, and special types of group algebras. As an example for the latter, consider cyclic groups: By the results presented above we know that all Rota-Baxter operators over the cyclic group of order 2 or 3 are trivial—is this true for any (prime order) cyclic group?
Funding Statement
Shanghua Zheng acknowledges support from the National Science Foundation of US (grant no. DMS 1001855). Li Guo acknowledges support from the Engineering and Physical Sciences Research Council of UK (grant no. EP/I037474/1) and the Austrian Science Fund (grant no. P30052). Markus Rosenkranz acknowledges support from the National Natural Science Foundation of China (grant no. 11601199) and the Foundation of Jiangxi Provincial Education Department (grant no. GJJ160336).
References
- 1.An H., Bai C (2008). From Rota-Baxter algebras to pre-Lie algebras. J. Phys. A: Math. Theor. 41(1): 015201–0119. DOI: 10.1088/1751-8113/41/1/015201 [DOI] [Google Scholar]
- 2.Atkinson F. V. (1963). Some aspects of Baxter’s functional equation. J. Math. Anal. Appl. 7(1): 1–30. DOI: 10.1016/0022-247X(63)90075-1 [DOI] [Google Scholar]
- 3.Andrews G. E., Guo L., Keigher W., Ono K. (2003). Baxter algebras and Hopf algebras. Trans. Amer. Math. Soc. 355(11): 4639–4656. DOI: 10.1090/S0002-9947-03-03326-9 [DOI] [Google Scholar]
- 4.Bai C. (2007). A unified algebraic approach to the classical Yang-Baxter equations. J. Phys. A: Math. Theor. 40(36): 11073–11082. DOI: 10.1088/1751-8113/40/36/007 [DOI] [Google Scholar]
- 5.Bai C., Guo L., Ni X (2010). Nonablian generalized Lax pairs, the classical Yang-Baxter equation and postLie algebra. Commun. Math. Phys. 297(2): 553–596. DOI: 10.1007/s00220-010-0998-7 [DOI] [Google Scholar]
- 6.Bai C., Bellier O., Guo L., Ni X (2013). Splitting of operations, Manin products and Rota-Baxter operators. Int. Math. Res. Not. IMRN 2013(3): 485–524. DOI: 10.1093/imrn/rnr266 [DOI] [Google Scholar]
- 7.Baxter G. (1960). An analytic problem whose solution follows from a simple algebraic identity. Pac. J. Math. 10(3): 731–742. DOI: 10.2140/pjm.1960.10.731 [DOI] [Google Scholar]
- 8.Böhm J., Eisenbud D., Nitsche M. J (2012). Decomposition of semigroup algebras. Exp. Math. 21(4): 385–394. DOI: 10.1080/10586458.2012.688376 [DOI] [Google Scholar]
- 9.Bokut L. A., Chen Y., Qiu J (2010). Gröbner-Shirshov bases for associative algebras with multiple operators and free Rota-Baxter algebras. J. Pure Appl. Algebr. 214(1): 89–110. DOI: 10.1016/j.jpaa.2009.05.005 [DOI] [Google Scholar]
- 10.Cartier P. (1972). On the structure of free Baxter algebras. Adv. Math. 9(2): 253–265. DOI: 10.1016/0001-8708(72)90018-7 [DOI] [Google Scholar]
- 11.Connes A., Kreimer D (2000). Renormalization in quantum field theory and the Riemann-Hilbert problem. I. The Hopf algebra structure of graphs and the main theorem. Commun. Math. Phys. 210(1): 249–273. DOI: 10.1007/s002200050779 [DOI] [Google Scholar]
- 12.Crvenkovic S., Stojmenovic I (1993). An algorithm for Cayley tables of algebras, Review of research of the faculty of science. Math. Ser. 23(2): 221–231. [Google Scholar]
- 13.Dales H. G., Strauss D. E., Zelenyuk Y., Zelenyuk Y (2013). Radicals of some semigroup algebras. Semigr. Forum 87(1): 80–96. DOI: 10.1007/s00233-012-9459-2 [DOI] [Google Scholar]
- 14.Distler A., Eick B (2013). Coclass theory for nilpotent semigroups via their associated algebras. J. Algebr. 373: 491–501. DOI: 10.1016/j.jalgebra.2012.09.042 [DOI] [Google Scholar]
- 15.Edmunds C. C. (1980). Varieties generated by semigroups of order four. Semigr. Forum 21(1): 67–81. DOI: 10.1007/BF02572537 [DOI] [Google Scholar]
- 16.Ebrahimi-Fard K., Guo L (2008). Free Rota-Baxter algebras and dendriform algebras. J. Pure Appl. Algebr. 212(2): 320–339. DOI: 10.1016/j.jpaa.2007.05.025 [DOI] [Google Scholar]
- 17.Ebrahimi-Fard K., Guo L., Kreimer D (2004). Spitzer’s identity and the algebraic Birkhoff decomposition in pQFT. J. Phys. A: Math. Gen. 37(45): 11037–11052. DOI: 10.1088/0305-4470/37/45/020 [DOI] [Google Scholar]
- 18.Forsythe G. E. (1955). SWAC computes 126 distinct semigroups of order 4. Proc. Amer. Math. Soc. 6: 443–447. DOI: 10.2307/2032786 [DOI] [Google Scholar]
- 19.Gourdeau F., White M. C (2012). The cyclic and simplicial cohomology of the Cuntz semigroup algebra. J. Math. Anal. Appl. 386(2): 921–932. DOI: 10.1016/j.jmaa.2011.08.050 [DOI] [Google Scholar]
- 20.Guo L. (2012). An Introduction to Rota-Baxter Algebra. Beijing: International Press. [Google Scholar]
- 21.Guo L., Keigher W (2000). Baxter algebras and shuffle products. Adv. Math. 150(1): 117–149. DOI: 10.1006/aima.1999.1858 [DOI] [Google Scholar]
- 22.Guo L., Keigher W (2008). On differential Rota-Baxter algebras. J. Pure Appl. Algebr. 212(3): 522–540. DOI: 10.1016/j.jpaa.2007.06.008 [DOI] [Google Scholar]
- 23.Guo L., Rosenkranz M., Zheng S (2014). Classification of Rota-Baxter operators on semigroup algebras of order two and three, arXiv:1402.3702 [math.RA]. [DOI] [PMC free article] [PubMed]
- 24.Guo X., Xi C (2009). Cellularity of twisted semigroup algebras. J. Pure Appl. Algebr. 213(1): 71–86. DOI: 10.1016/j.jpaa.2008.05.004 [DOI] [Google Scholar]
- 25.Jespers E., Okniński J (2007). Noetherian Semigroup Algebras Algebra and Applications, Vol. 7 Dordrecht: Springer. [Google Scholar]
- 26.Kennedy M. (2011). Wandering vectors and the reflexivity of free semigroup algebras. J. Reine Angew. Math. 653: 47–73. [Google Scholar]
- 27.Lakshmibai V., Mukherjee H (2011). Singular loci of Hibi toric varieties. J. Ramanujan Math. Soc. 26: 1–29. [Google Scholar]
- 28.Li X., Hou D., Bai C (2007). Rota-Baxter operators on pre-Lie algebra. Jour. Nonlinear Math. Phys. 14(2): 269–289. DOI: 10.2991/jnmp.2007.14.2.10 [DOI] [Google Scholar]
- 29.Luo Y., Zhang W (2011). On the variety generated by all semigroups of order three. J. Algebr. 334(1): 1–30. DOI: 10.1016/j.jalgebra.2011.02.037 [DOI] [Google Scholar]
- 30.Manon C. (2010). Presentations of semigroup algebras of weighted trees. J. Algebr. Comb. 31(4): 467–489. DOI: 10.1007/s10801-009-0195-y [DOI] [Google Scholar]
- 31.Manon C. (2012). Gorenstein semigroup algebras of weighted trees and ordered points on the projective line. J. Algebr. 354(1): 110–120. DOI: 10.1016/j.jalgebra.2011.12.025 [DOI] [Google Scholar]
- 32.May R. (2011). Representations of certain generalized schur algebras. J. Algebra 333(1): 180–201. DOI: 10.1016/j.jalgebra.2011.01.021 [DOI] [Google Scholar]
- 33.Nasrabadi E., Pourabbas A (2010). Second module cohomology group of inverse semigroup algebras. Semigr. Forum 81(2): 269–276. DOI: 10.1007/s00233-010-9228-z [DOI] [Google Scholar]
- 34.Okniński J. (1991). Semigroup Algebras. New York: Marcel Dekker, Inc. [Google Scholar]
- 35.Pei J., Bai C., Guo L (2014). Rota-Baxter operators on and solutions of the classical Yang-Baxter equation. J. Math. Phys. 55: 021701 DOI: 10.1063/1.4863898 [DOI] [Google Scholar]
- 36.Plemmons R. J. (1965) Cayley tables for all semigroups of order less than 7, Department of Mathematics, Auburn Univ.
- 37.Petrich M. (1973). Introduction to Semigroups. Columbus: Merrill. [Google Scholar]
- 38.Rosenkranz M., Regensburger G (2008). Solving and factoring boundary problems for linear ordinary differential equations in differential algebra. J. Symb. Comput. 43(8): 515–544. DOI: 10.1016/j.jsc.2007.11.007 [DOI] [Google Scholar]
- 39.Rota G.-C. (1969). Baxter algebras and combinatorial identities I, II. Bull. Amer. Math. Soc. 75(2): 325–330. 334. DOI: 10.1090/S0002-9904-1969-12156-7 [DOI] [Google Scholar]
- 40.Rota G.-C. (1995). Baxter operators, an introduction, In: Kung Joseph P.S., ed. Gian-Carlo Rota on Combinatorics, Introductory Papers and Commentaries. Boston, MA: Birkhäuser. [Google Scholar]
- 41.Semenov-Tian-Shansky M. A. (1983). What is a classical r-matrix? Funct. Ana. Appl. 17: 259–272. [Google Scholar]
- 42.Sturmfels B., Sullivant S (2008). Toric geometry of cuts and splits. Mich. Math. J. 57: 689–709. DOI: 10.1307/mmj/1220879432 [DOI] [Google Scholar]
- 43.Tang X., Zhang Y., Sun Q (2014). Rota-Baxter operators on 4-dimensional complex simple associative algebras. Appl. Math. Comput. 229: 173–186. DOI: 10.1016/j.amc.2013.12.032 [DOI] [Google Scholar]


