Skip to main content
Taylor & Francis Open Select logoLink to Taylor & Francis Open Select
. 2019 Mar 4;47(8):3094–3116. doi: 10.1080/00927872.2018.1552278

Classification of Rota-Baxter operators on semigroup algebras of order two and three

Shanghua Zheng a, Li Guo b, Markus Rosenkranz c,
PMCID: PMC7083595  PMID: 32256224

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

P(x)P(y)=P(xP(y))+P(P(x)y)+λP(xy), (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 S={e1,,en}. Let k be a commutative unitary ring and let

k[S]:=m=1nkem={m=1namem|amk,1mn} (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 k[S].

Let P:k[S]k[S] be a Rota-Baxter operator of weight zero. Since P is k-linear, we have

(P(e1)P(e2)P(en))=(c11c1nc21c2ncn1cnn)(e1e2en)(cijk,1i,jn). (3)

The matrix C:=CP:=(cij)1i,jn is called the matrix of P. Further, P is a Rota-Baxter operator if and only if

P(ei)P(ej)=P(P(ei)ej+eiP(ej))(1i,jn). (4)

Let the Cayley (multiplication) table of the semigroup S be given by

ek·e=m=1nrkmem(1k,n), (5)

where rkm{0,1}. Then we have

P(ei)P(ej)=k=1n=1ncikcjeke=m=1nk=1n=1nrkmcikcjem

and

P(P(ei)ej+eiP(ej))=k=1ncikP(ekej)+=1ncjP(eie)=k=1nm=1nrkjmcikP(em)+=1nm=1nrimcjP(em)=k=1nm=1nrkjmcik(=1ncme)+k=1nm=1nrikmcjk(=1ncme)=m=1n=1nk=1n(rkjcik+rikcjk)cmem.

Thus we obtain

Theorem 2.1.

Let S={e1,,en} be a semigroup with its Cayley table given by Eq. (5). Let k be a commutative unitary ring and let P:k[S]k[S] be a linear operator with matrix C:=CP=(cij)1i,jn. Then P is a Rota-Baxter operator of weight zero on k[S] if and only if the following equations hold.

=1nk=1nrkmcikcj==1nk=1n(rkjcik+rikcjk)cm(1i,j,mn). (6)

We will determine the matrices CP for all Rota-Baxter operators P on k[S] 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
CS(1):=·e1e2e3e1e1e1e1e2e1e1e1e3e1e1e1 CS(2):=·e1e2e3e1e1e1e1e2e1e1e1e3e1e1e2 CS(3):=·e1e2e3e1e1e1e1e2e1e2e1e3e1e1e1 CS(4):=·e1e2e3e1e1e1e1e2e1e2e1e3e1e1e3
CS(5):=·e1e2e3e1e1e1e1e2e1e2e2e3e1e2e2 CS(6):=·e1e2e3e1e1e1e1e2e1e2e2e3e1e2e3 CS(7):=·e1e2e3e1e1e1e1e2e1e2e3e3e1e3e1 CS(8):=·e1e2e3e1e1e1e1e2e1e2e3e3e1e3e2
CS(9):=·e1e2e3e1e1e1e3e2e1e1e3e3e3e3e1 CS(10):=·e1e2e3e1e1e1e3e2e1e2e3e3e3e3e1 CS(11):=·e1e2e3e1e1e2e2e2e2e1e1e3e2e1e1 CS(12):=·e1e2e3e1e1e2e3e2e2e3e1e3e3e1e2

Table 2.

Cayley table of noncommutative semigroups of order 3.

NCS(1):=·e1e2e3e1e1e1e1e2e1e2e1e3e1e3e1 NCS(2):=·e1e2e3e1e1e1e1e2e1e2e1e3e3e3e3 NCS(3):=·e1e2e3e1e1e1e1e2e1e2e2e3e1e3e3
NCS(4):=·e1e2e3e1e1e1e1e2e2e2e2e3e1e1e1 NCS(5):=·e1e2e3e1e1e1e1e2e2e2e2e3e3e3e3 NCS(6):=·e1e2e3e1e1e1e1e2e1e2e3e3e3e3e3

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 rklm used in Eq. (6), the function SGM is employed.

Figure 1.

Figure 1.

The procedure for computing Rota-Baxter operators on semigroup algebras.

We illustrate these functions by considering the first semigroup t=CS(1) of Table 1; for the detailed computation we refer to Section 4.2.1. The underlying set {e1,e2,e3} 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 p(1,1)=a,p(2,1)=b,p(1,2)=c,p(2,2)=d,p(1,3)=e,p(2,3)=f, where a,b,c,d,e,fk. Then p(3,1)=ab,p(3,2)=cd and p(3,3)=ef, so we obtain the matrix

(acebdfabcdef)(a,b,c,d,e,fk),

the transpose of which is given in Table 3 as C1,1.

Figure 2.

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) C1,1:=(ababcdcdefef) CS(2) C2,1:=(aa0bb0cc0),C2,2:=(aa0bb0c2(ba)c2(ab))(ab)
CS(3) C3,1:=(a0ab0bc0c) CS(4) C4,1:=(000000000)
CS(5) C5,1:=(0aa0bb0cc) CS(6) C6,1:=(000000000)
CS(7) C7,1:=(a0ab0ba0a) CS(8) C8,1:=(000000000)
CS(9) C9,1:=(aa0bb0cc0) CS(10) C10,1:=(000000000)
CS(11) C11,1:=(0aa0bb0cc) CS(12) C12,1:=(000000000)

3. Rota-Baxter operators on semigroup algebras of order 2

In this section, we determine all Rota-Baxter operators on semigroup algebras k[S] of order 2.

As is well known [37], there are exactly five distinct nonisomorphic semigroups of order 2. We use N2,L2,R2,Y2 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 {e1,e2} denote the underlying set of each semigroup. Then the Cayley tables for these semigroups are as follows:

Theorem 3.1.

Let k be a field of characteristics zero. All Rota-Baxter operators on a semigroup algebra k[S] of order 2 have their matrices CP given in Table 4, where all the parameters are in k 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 (aabb) Z2 (0000)
Y2 (0000) L2 (aa2bba)(b0),(0a00)

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 k[S] if and only if the eight Equations (6) hold (with 1i,j,m2). So we just need to solve these equations. It is straightforward to verify that what we obtain does satisfy all equations. Let 02×2 denote the 2 × 2 zero matrix.

Case 1. Let S = N2: In Eq. (6), taking i=j=1 with 1m2 and i=j=2 with 1m2, we get

(c11+c12)2=2c11(c11+c12), (7)
c12(c11+c12)=0, (8)
(c21+c22)2=2c11(c21+c22), (9)
c12(c21+c22)=0. (10)

Assume c11+c120. Then by Eqs. (7) and (8), we have c11=c12=0, a contradiction to c11+c120. Thus c11+c12=0. Assume c21+c220. Then by Eq. (10), we get c12=0, and so c11=0. Then by Eq. (9), we have c21+c22=0, a contradiction. Thus c21+c22=0. Therefore Eqs. (7)–(10) are equivalent to

{c11+c12=0,c21+c22=0.

Denoting a=c11 and b=c21, we see that solutions (cij)1i,j2 of Eqs. (7)–(10) are of the form

(aabb)(a,bk).

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 k[S].

Case 2. Let S = Y2: In Eq. (6), taking i=j=1 with 1m2 and i=j=2 with 1m2, we obtain

c112+2c11c12=2c11(c11+c12), (11)
c122=2c12(c11+c12), (12)
c212+2c21c22=2c21(c11+c22), (13)
c222=2(c12c21+c222). (14)

From Eq. (11) we have c11=0. Then from Eq. (12) we have c12=0. Thus Eq. (14) gives c22=0. Further by Eq. (13), we have c21=0. Thus the only solution is the zero solution 02×2.

Case 3. S = Z2: In Eq. (6), taking i=j=1 with 1m2; i=1,j=2 with m = 2 and i=j=2 with m = 1, we obtain

c112+c122=2c112+2c12c21, (15)
c11c12=c12(c11+c22), (16)
c11c22+c12c21=c22(c11+c22)+c12(c12+c21), (17)
c212+c222=2(c212+c11c22). (18)

By Eq. (16) we have c12c22=0. From Eq. (17) we get c122+c222=0. Thus c12=c22=0. Then Eqs. (15) and (18) give c11=c21=0. Thus the only solution is the zero solution 02×2.

Case 4. S = L2: In Eq. (6), taking i=j=1 with 1m2 and i=2,j=1 with 1m2, we get

c11(c11+c12)=c11(2c11+c12)+c12c21, (19)
c12(c11+c12)=c12(2c11+c12+c22), (20)
c21(c11+c12)=c21(2c11+c12+c22), (21)
c22(c11+c12)=c21c12+c22(c11+c12+c22). (22)

By Eqs. (19) and (22), we have c112=c222. By Eqs. (20) and (21), we get c12(c11+c22)=0 and c21(c11+c22)=0. Assume c11+c220. Then c12=c21=0. So by Eq. (19), we have c11=0 and then c22=0, a contradiction. Thus c11+c22=0. Then Eqs. (19)–(22) are equivalent to the system of equations

{c11+c22=0,c112+c12c21=0.

Denoting a=c11 and b=c21, then c22=a. When b0, then we also have c12=a2b. This gives the solutions

(aa2bba)(b0,ak).

On the other hand, when b = 0, then c11=c22=0. Denoting a=c12, we get the solutions

(0a00)(ak).

These solutions to Eqs. (19)–(22) also satisfy the other equations in Eq. (6). Thus they give all the Rota-Baxter operators on k[S].

This completes the proof of Theorem 3.1. □

Table 5.

The Cayley tables of semigroups of order 2.

N2:=·e1e2e1e1e1e2e1e1 Y2:=·e1e2e1e1e1e2e1e2 Z2:=·e1e2e1e1e2e2e2e1 L2:=·e1e2e1e1e1e2e2e2

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 k[S] are given by the following 27 equations.

k=13=13rkmcikcj=k=13=13(rkjcik+rikcjk)cm(1i,j,m3). (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 k 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 k 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 CS(i),1i12, 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 03×3 denote the 3 × 3 zero matrix.

4.2.1. The proof for k[CS(1)]

We prove that the matrices CP=(cij)1i,j3 of all the Rota-Baxter operators P on the semigroup algebra k[CS(1)] are given by C1,1 in Table 3.

Applying the Cayley table of CS(1) in Eq. (23) and taking i=j=1 with 1m3; i = 1,j = 2, 3 with m = 1 and i = 2, 3, j = 1 with m = 1, respectively, we obtain

(c11+c12+c13)2=2c11(c11+c12+c13), (24)
c12(c11+c12+c13)=0, (25)
c13(c11+c12+c13)=0, (26)
(c11+c12+c13)(c21+c22+c23)=c11(c11+c12+c13+c21+c22+c23), (27)
(c11+c12+c13)(c31+c32+c33)=c11(c11+c12+c13+c31+c32+c33), (28)
(c21+c22+c23)2=2c11(c21+c22+c23), (29)
(c31+c32+c33)2=2c11(c31+c32+c33). (30)

Assume c11+c12+c130. Then by Eqs. (24), (25) and (26), we get

2c11=c11+c12+c13andc12=c13=0.

So we have c11=c12=c13=0. This contradicts c11+c12+c130. Thus c11+c12+c13=0. By Eqs. (27) and (28), we have c11(c21+c22+c23)=0 and c11(c31+c32+c33)=0. Then by Eqs. (29) and (30), we get (c21+c22+c23)2=0 and (c31+c32+c33)2=0. So we have c21+c22+c23=0 and c31+c32+c33=0. From these discussions, we see that Eqs. (24)–(30) are equivalent to

{c11+c12+c13=0,c21+c22+c23=0,c31+c32+c33=0.

So we have

{c13=c11c12,c23=c21c22,c33=c31c32.

Denote a=c11,b=c12,c=c21,d=c22,e=c31,f=c32. Thus solutions (cij)1i,j3 of Eqs. (24)–(30) are given by

C11=(ababcdcdefef)(a,b,c,d,e,fk).

Since they can be checked to satisfy other equations in Eq. (23), they give the matrices of all the Rota-Baxter operators on k[CS(1)].

4.2.2. The proof for k[CS(2)]

Here we prove that the matrices CP=(cij)1i,j3 of all the Rota-Baxter operators P on the semigroup algebra k[CS(2)] are given by C2,1 and C2,2 in Table 3.

Applying the Cayley table of CS(2) in Eq. (23) and taking i=j=1 with 1m3 and 1i3,j=2 with m = 1, 2, we obtain

(c11+c12)(c11+c12+c13)+c13(c11+c12)=2c11(c11+c12+c13), (31)
c132=2c12(c11+c12+c13), (32)
c13(c11+c12+c13)=0, (33)
(c11+c12)(c21+c22+c23)+c13(c21+c22)=c11(c11+c12+c13+c21+c22+c23), (34)
c12(c11+c12+c13+c21+c22+c23)=0, (35)
(c21+c22)(c21+c22+c23)+c23(c21+c22)=2c11(c21+c22+c23), (36)
c232=2c12(c21+c22+c23), (37)
(c31+c32)(c31+c32+c33)+c33(c31+c32)=2c11(c31+c32)+2c33c21, (38)
c332=2c12(c31+c32)+2c33c22. (39)

Assume c11+c12+c130. Then by Eqs. (32) and (33), we have c13=c12=0. By Eq. (31), we have c11=0. This contradicts c11+c12+c130. Thus we have c11+c12+c13=0. By Eq. (32), we have c13=0. So c11+c12=0. Then by Eqs. (34) and (35), we get c11(c21+c22+c23)=0 and c12(c21+c22+c23)=0. From Eq. (37), we obtain c23=0. Then Eq. (36) gives c21+c22=0. Adding Eqs. (38) and (39), we get (c31+c32+c33)2=0. So c31+c32+c33=0. By Eq. (39), we have c332=2c33(c22c12). Thus c33=0 or c33=2(c22c12). Denote a=c11,b=c21,c=c31. Then c12=a and c22=b. We consider two cases.

Case 1. Suppose c33=0: Then c31+c32=0. Then we have c32=c. Thus we get the solutions

C21=(aa0bb0cc0)(a,bk).

Case 2. Suppose c330: Then c33=2(c22c12). Thus

c33=2(ab)andc31+c32=c33=2(c12c22)=2(ba).

So c32=2(ba)c. Thus we get the solutions

C22=(aa0bb0c2(ba)c2(ab))(a,bk,ab).

They also satisfy the other equations in Eq. (23) hence give all the Rota-Baxter operators on k[CS(2)].

4.2.3. The proof for k[CS(3)]

Here we prove that the matrices CP=(cij)1i,j3 of all the Rota-Baxter operators P on the semigroup algebra k[CS(3)] are given by C3,1 in Table 3.

Applying the Cayley table of CS(3) in Eq. (23) and taking i=1,j=1 with m = 2; i=1,j=2 with m = 1, 3; i=2,j=2 with 1m3 and i=3,j=3 with 1m3, we obtain

c122=2c12(c11+c12+c13), (40)
c13(c21+c22+c23)+c12c23=c11(c11+c13), (41)
c13(c11+c13+c21+c22+c23)+c12c23=0, (42)
(c21+c23)(c21+2c22+c23)=2(c11(c21+c23)+c22c21), (43)
c222=2(c12(c21+c23)+c222), (44)
c13(c21+c23)+c22c23=0, (45)
(c31+c33)(c31+c32+c33)+c32(c31+c33)=2c11(c31+c32+c33), (46)
c322=2c12(c31+c32+c33), (47)
c13(c31+c32+c33)=0. (48)

Eq. (42) gives

c13(c21+c22+c23)+c12c23=c13(c11+c13).

Thus by Eq. (41), we have (c11+c13)2=0, and so c11+c13=0. Then by Eq. (40), we have c12=0. Thus Eq. (44) gives c22=0. By Eq. (45), we have c13(c21+c23)=0, and so c11(c21+c23)=0. Then Eq. (43) gives c21+c23=0. By Eq. (47), we have c32=0. Then by Eqs. (46) and (48), we can obtain c31+c33=0. Let a=c11,b=c21,c=c31. Thus solutions of Eqs. (40)–(48) are given by

C3,1=(a0ab0bc0c)(a,b,ck).

It can be checked that they also satisfy the other equations in Eq. (23) and hence give all the Rota-Baxter operators on k[CS(3)].

4.2.4. The proof for k[CS(4)]

We prove that the matrices CP=(cij)1i,j3 of all the Rota-Baxter operators P on the semigroup algebra k[CS(4)] are given by C4,1 in Table 3.

Applying the Cayley table of CS(4) in Eq. (23) and taking i=j=1 with 1m3; i=j=2 with 1m3 and i=j=3 with 1m3, we obtain

c112=2c12c13, (49)
c122+2c12(c11+c13)=0, (50)
c132+2c13(c11+c12)=0, (51)
c21(c21+c23)+c22c23+c23(c21+c22)=2c11(c21+c23), (52)
c222+2c12(c21+c23)=0, (53)
c232=2c13(c21+c23)+2c22c23, (54)
c31(c31+c32)+c32(c31+c32)+c32c33=2c11(c31+c32), (55)
c322=2c12(c31+c32)+2c33c32, (56)
c332+2c13(c31+c32)=0. (57)

By Eqs. (50) and (51) and using Eq. (49), we have (c11+c12)2=0 and (c11+c13)2=0. So c11+c12=0 and c11+c13=0. Then Eq. (49) gives c112=2c112. Thus c11=0. Then we get c11=c12=c13=0. By Eq. (53), we have c22=0. Thus Eqs. (52) and (54) give c23=0 and c21=0. Eq. (57) gives c33=0 and so Eqs. (55) and (56) give c31=c32=0. Thus the system in Eq. (23) only has the zero solution C4,1=03×3.

4.2.5. The proofs for k[CS(i)] when 5i11

The proofs for the semigroups CS(6),CS(8), 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 CS(5),CS(7),CS(9), and CS(11) are similar to the proof for CS(3) and hence is left in [23].

4.2.6. The proof for k[CS(12)]

We finally prove that the matrices CP=(cij)1i,j3 of the Rota-Baxter operators P on the semigroup algebra k[CS(12)] are given by C12,1 in Table 3.

Applying the Cayley table of CS(12) in Eq. (23) and taking i=j=1 with 1m3; i=1,j=2 with m = 2, 3; i=1,j=3 with m = 2, 3; i=j=2 with 1m3; i=2,j=3 with m = 2, 3 and i=j=3 with 1m3, we obtain

2c12c13=c112+2c12c21+2c13c31, (58)
c132=2c12c22+2c13c32, (59)
c122=2c12c23+2c13c33, (60)
c13c23=c12c13+c222+c32(c12+c23), (61)
c12c22=c132+c23c22+c33(c12+c23), (62)
c13c33=c122+c22(c13+c32)+c32c33, (63)
c12c32=c12c13+c23(c13+c32)+c332, (64)
2c22c23=2c23c11+c212+2c22c31, (65)
c232=2c23c12+2c22c32, (66)
c222=2c23c13+2c22c33, (67)
c23c33=c12(c22+c33)+c22c23+c322, (68)
c22c32=c13(c22+c33)+c232+c33c32, (69)
2c32c33=2c11c32+2c33c21+c312, (70)
c332=2c12c32+2c33c22, (71)
c322=2c13c32+2c33c23. (72)

Denote a=c13,b=c23 and c=c33. By Eqs. (66) and (71), we get

{2c12c22c32=b2c122bc122,2c12c22c32=c2c222cc222.

So

2bc122b2c12=2cc222c2c22. (73)

By Eqs. (60) and (67), we have

{4abc=2bc1224b2c122,4abc=2cc2224c2c22.

Thus

{2bc122b2c12=4abc+3b2c12,2cc222c2c22=4abc+3c2c22.

Using Eq. (73), we obtain b2c12=c2c22, and so bc122=cc222. Similarly, by Eqs. (59) and (66), and Eqs. (60) and (72), we get b2c12=a2c32 and bc122=ac322, respectively. This means that

b2c12=c2c22=a2c32 (74)

and

bc122=cc222=ac322. (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 c12=0,c32=0 and c22=0. By Eqs. (58), (65) and (70), we obtain c11=c21=c31=0. Thus the only solution is given by the zero matrix C12,1:=03×3.

Subcase 2. Two of a, b, c are 0: Without loss of generality, we may assume a=b=0 and c0. From Eq. (72), we obtain c32=0. 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, b0 and c0. By Eq. (59), we have c12c22=0. Then c12=0 or c22=0. If c12=0, then by Eq. (62), we have c33+c22=0, and so c22=c0. By Eq. (67), 3c2=0. Thus c = 0. This contradicts c0. If c22=0, then by Eq. (62), b=c12. By Eq. (60), we have 3b2=0. Thus b = 0, a contradiction. We see that this case also can not occur.

Case 2. abc 0: Then a0,b0 and c0. If one of c12,c22,c32 is 0, we may assume c12=0, and then by Eqs. (74 and (75), we obtain c22=c32=0. So Eq. (59) gives a2=0, a contradiction. Thus c12, c22 and c32 are nonzero. Since b2c12=c2c22 and bc122=cc222, we have b2c122=bcc222. So c2c22c12=bcc222. Thus cc12=bc22. Similarly, we have ac12=bc32 and ac22=cc32. So b3c12=c2bc22=c3c12. Thus a3=c3. Similarly, we have a3=b3. By Eqs. (66) and (69), we get

b2+2bc12+2ac22+2cc32+2ac=0.

Since ac22=cc32, we have b2+2bc12+4ac22+2ac=0. So b3+2b2c12+4abc22+2abc=0. Since b2c12=c2c22, we have

2(c2+2ab)c22=b32abc=c32abc. (76)

We further divide into two subcases.

Subcase 1. c2+2ab0: By Eq. (76), we have c22=c2. From cc12=bc22 and ac22=cr32, we obtain c12=b2 and c32=a2. By Eq. (59), we have a2=bc2a2. So a2=bc4. By Eq. (72), we get 54a2=2bc. Thus we get a2=85bc. So by a2=bc4, we get bc = 0, a contradiction.

Subcase 2. c2+2ab=0: Then c4=4a2b2. Adding Eqs. (67) and (71), we obtain c222+2c12c32=0. So we have a2b2c222+2a2b2c12c32=0. By Eq. (74), we have (a2b2+2c4)c222=0. Since c220, we have a2b2+2c4=0. Then by c4=4a2b2, we have 9(ab)2=0, and so ab = 0, again a contradiction.

In summary, the only solution for k[CS(12)] is the zero solution 03×3, 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 k 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 k and i denotes 1 as usual.

Table 6.

RBOs on noncomumutative semigroup algebras of order 3.

Semigroups Matrices of Rota-Baxter operators on semigroup algebras
NCS(1) N1,1=(0000000a0),N1,2=(000000aa0)(a0),N1,3=(000b+ccbc2bcbc2bc)(a0,b0),N1,4=(000ababb2ab)(a0),N1,5=(a0ab0ba0a)(a0)
NCS(2) N2,1=(000c0c000)(a0),N2,2=(000000a00),N2,3=(0000000b0),N2,4=(b00b00b2a0b)(a0,b0,a+b0),N2,5=(00a000000)(a0),N2,6=(00a00a000)(a0),N2,7=(a0ac0ca0a)(a0),N2,8=(abaababab(ab)aab)(a0,b0),N2,9=(0b0000000)(b0)
NCS(3) N3,1=(0aa0bb0bb)(a0),N3,2=(0000abib0aabi)(a0,b0),N3,3=(0000abib0aabi)(a0,b0),N3,4=(0000000a0)(a0),N3,5=(000000aa0)(a0),N3,6=(000c(b+c)bc(b+c)b(b+c)2bb+c)(a0,b0,b+c0),N3,7=(00000b000),N3,8=(000b0b000)(b0)
NCS(4) N4,1=(a0ab0bc0c)(a0,a+b0),N4,2=(a0aa0acdcd)(a0),N4,3=(000a0ab0b)(a0),N4,4=(000000bc(b+c))(c0),N4,5=(000a00b0b),N4,6=(a(a+b)ba(a+b)bcd(c+d))(b0,a+b0),N4,7=(ab0a2ba0cbac)(a+b0,b0),N4,8=(bb0bb0cdcd)(b0)
NCS(5) N5,1=(acFabFacdFbdFdcbF),N5,2=(acFabFacdFbdFdcbF)(a,b,c,dk{0}),F:=(ac+bd),N5,3=(000cdbibdidcbbdi),N5,4=(000cdbibdidcbbdi)(b,c,dk{0}),N5,5=(aci0acdai0dc0aci),N5,6=(aci0acdai0dc0aci)(a,c,dk{0}),N5,7=(0abida0bdid0bbdi),N5,8=(0abida0bdid0bbdi)(a,b,c,dk{0}),N5,9=(aciabica000cbaci),N5,10=(aciabica000cbaci)(a,b,ck{0}),N5,11=(0000dbid0bdbi),N5,12=(0000dbid0bdbi)(b0,d0),N5,13=(ebceb2c20eebc0cb0)(b0,c0),N5,14=(aeda2ed2aeaedd000)(a0,d0),N5,15=(aci0a000c0aci),N5,16=(aci0a000c0aci)(a0,c0),N5,17=(000e0d000)(d0),N5,18=(000e00c00)(c0),N5,19=(0e00000b0)(b0),N5,20=(0ea000000)(a0),N5,21=(efie0fefi0000),N5,22=(efie0fefi0000)
NCS(6) N6,1=(a0a000a0a)(a0),N6,2=(a0ac0ca0a)(a0),N6,3=(abi0a000b0abi)(a0,b0),N6,4=(abi0a000b0abi)(a0,b0),N6,5=(00a000000)(a0),N6,6=(000a0a000),N6,7=(000000a00)(a0),N6,8=(000000aa0)(a0),N6,9=(abab0a2ba000b2abbabba)(a0)

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 k[NCS(1)]

We first prove that the matrices (cij)1i,j3 of the Rota-Baxter operators P on the semigroup algebra k[NCS(1)] are given by N1,i,1i5, in Table 6.

Applying the Cayley table of NCS(1) in Eq. (23) and then taking i=1,j=1,2 with 1m3; i=j=2 with 1m3; i=2,j=3 with m = 1; i=3,j=2 with 1m3 and i=j=3 with m = 1, 3, we obtain

c112=c132+c12c13, (77)
c122=2c12(c11+c12+c13), (78)
2c132+c13(2c11+c12)=0, (79)
c12c23+c13(c21+c23)=c112+c13c31, (80)
c12(c11+c21+c22+c23)+c13c32=0, (81)
c13(c11+c21+c23)+c12c23+c13c33=0, (82)
c21(c21+c23)+c23(c21+c22+c23)=c11(2c21+c23)+c23c31, (83)
c222+c23c32+c12(2c21+c23)=0, (84)
c23(c22+c33)+c13(2c21+c23)=0, (85)
(c21+c22+c23)(c31+c33)=c11(c21+c22+c23+c31+c33), (86)
(c31+c32+c33)(c21+c23)=c11(c31+c21+c23)+c32c21+c31c33, (87)
c12(c31+c21+c23)+c32(c33+c22)=0, (88)
c332+c23c32+c13(c31+c21+c23)=0, (89)
(c31+c33)(c31+c32+c33)=c11(2c31+c32+2c33), (90)
c13(2c31+c32+2c33)=0. (91)

By Eq. (79) we have c12c13=2c1322c11c13. Then by Eq. (77) we get (c11+c13)2=0. So we get c11+c13=0. Then Eq. (78) gives c12=0. We divide the rest of the proof into two cases depending on whether or not c11=0.

Case 1. c11=0: Then c13=0. There are two subcases to consider.

Subcases 1. c23=0: Then by Eqs. (84) and (89), we have c22=c33=0. So by Eq. (83), we get c21=0. Denote a=c32, where ak. If c31=0, then we get the solution

N1,1=(0000000a0)(ak).

If c310, then by Eq. (90), we have c31+c32=0. Thus we get c31=c32=a. So a0. Thus we obtain the solution

N1,2=(000000aa0)(ak,a0).

Subcase 2. c230: Denote a=c23. Then a0. By Eq. (85), we have c22+c33=0. Denote b=c33. Then c22=b. Thus Eq. (84) gives c32=b2a. We subdivide further into two cases.

(1) If c31+c330, then by Eq. (90), we have c31+c32+c33=0. So we get

c31=c32c33=b2baa.

Note that if c33=b=0, then c31=0, a contradiction. Thus b0, and so c320. By Eq. (86), we have c21+c22+c23=0. Thus c21=ba. Thus we get the solutions

N1,3=(000babab(ba)ab2ab)(a,bk{0}).

(2) If c31+c33=0, then c31=b. Since c22=b,c31c22=0. Then by Eq. (83), we have (c21+c23)2=c23(c31c22)=0. Thus c21=a. Thus we obtain the solutions

N1,4=(000ababb2ab)(a,bk,a0).

Case 2. c110: Denote a=c11. Then c13=a0. Since c12=0, Eq. (81) becomes c13c32=0. Then c32=0. So by Eq. (84), we obtain c22=0. Further, by Eq. (91), we have c31+c33=0. Thus by Eq. (86), c21+c23=0.

We divide into two subcases to consider.

Subcase 1. c23=0: Then c21=0. By Eq. (80), c112+c13c31=0. Then we obtain c31=a. So we have c33=a. Thus we obtain the solutions

N1,51:=(a0a000a0a)(ak,a0).

Subcase 2. c230: Denote b=c23. Then b0. Thus by c21+c23=0, we have c21=b and by Eq. (85), c13c21+c23c33=0, we get c33=a. Then we solutions

N1,52:=(a0ab0ba0a)(a,bk{0}).

In summary, we get get solutions of Eqs. (77)–(91)

N1,5=(a0ab0ba0a)(a,bk,a0).

It can be checked that they also satisfy the other equations in Eq. (23) and hence give matrices of Rota-Baxter operators on k[NCS(1)].

5.2.2. The proof for k[NCS(i)] where i=2,3,4,6

The proof of these cases are similar to the one for k[NCS(1)] 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 k[NCS(5)].

5.2.3. The proof for k[NCS(5)]

We next prove that the matrices of the Rota-Baxter operators on the semigroup algebra k[NCS(5)] are given by N5,i,1i22, in Table 6.

Applying the Cayley table of NCS(5) in Eq. (23) and then taking i=j=1 with 1m3; i=2,j=1 with 1m3 and i=3,j=1 with 1m3, we obtain

c112+c12c21+c13c31=0, (92)
c11c12+c12c22+c13c32=0, (93)
c11c13+c12c23+c13c33=0, (94)
c21c11+c21c22+c23c31=0, (95)
c21c12+c222+c23c32=0, (96)
c21c13+c22c23+c23c33=0, (97)
c11c31+c21c32+c31c33=0, (98)
c12c31+c22c32+c32c33=0, (99)
c13c31+c23c32+c332=0. (100)

From Eq. (100), we have c332=(c13c31+c23c32). Denote a=c13,b=c32,c=c31, and d=c23. Then c332=acbd. So we have c33=±acbd. Denote F:=acbd. So F2=acbd and c33=±F.

We divide the proof into five cases.

Case 1. a, b, c, and d are nonzero: Then c13,c32,c31 and c23 are nonzero. By Eqs. (94) and (98), we have

c31c23c12=c31(c11c13+c13c33)=c13(c11c31+c31c33)=c13c32c21.

Thus

c21=cdabc12. (101)

Then by Eqs. (98) and (101), we obtain

c11=c33c32c31c21=c33bcc21=c33dac12. (102)

Applying Eqs. (97) and (101), we have

c22=c33c13c23c21=c33adc21=c33cbc12. (103)

In Eq. (93), by replacing c11 and c22 by c33dac12 and c33cbc12, respectively, we get

c332c1222abc33c12+(ab)2=0. (104)

If ac+bd=0, then c33=0. Thus by Eq. (104), ab = 0, a contradiction. Thus we have ac+bd0. So c330 and F0. By Eq. (104) again, we get (c33c12ab)2=0. Thus c12=abc33. Since c33=±F,c12=±abF. Then by Eq. (101), c21=±cdF. By Eqs. (102) and (103) and F2=acbd, we get c11=±acF and c22=±bdF. Thus we obtain the solutions

N5,1=(acFabFacdFbdFdcbF)andN5,2=(acFabFacdFbdFdcbF)(a,b,c,dk{0}).

Case 2. Exactly one of a,b,c,d is 0: Then there are four subcases to consider.

Subcase 1. a = 0 and b,c,d0: Then c13=0,c320,c310, and c230. By Eq. (94), we have c12c23=0. So c12=0. Thus by Eq. (92), c11=0. Then Eq. (97) gives c22+c33=0 and Eq. (100) gives c33=±bdi. So c22=bdi. By Eq. (95), we have c21=c23c31c22. So c21=cdib. Thus we obtain the solutions

N5,3=(000cdibbdidcbbdi)andN5,4=(000cdibbdidcbbdi)(a,b,c,dk,b,c,d0).

Subcase 2. b = 0 and a,c,d0: Then c32=0,c130,c310 and c230. Then by Eq. (99), c12c31=0. So c12=0 and then by Eq. (96), c22=0. By Eq. (94), we have c11+c33=0. Then Eq. (100) gives c33=±aci. Thus c11=aci. By Eq. (97), we have c21=c23c33c13. So c21=dcia. Then we obtain the solutions

N5,5=(aci0adcia0dc0aci)andN5,6=(aci0adcia0dc0aci)(a,b,c,dk,a,c,d0).

Subcase 3. c = 0 and a,b,d0: Then By Eq. (98), we have c32c21=0. So c21=0. By Eq. (92), we have c11=0. Thus Eq. (99) gives c22+c33=0 and Eq. (100) gives c33=±bdi. Thus c22=bdi. By Eq. (94), we have c12=c13c33c23=abid. Then we obtain the solutions

N5,7=(0abida0bdid0bbdi)andN5,8=(0abida0bdid0bbdi)(a,b,c,dk,a,b,d0).

Subcase 4. d = 0 and a,b,c0: Then by Eq. (97), we have c21c13=0. So c21=0. Thus by Eq. (96), we have c22=0. So Eq. (94) gives c11+c33=0. Furthermore, by Eq. (100), we have c33=±aci. Thus c11=aci. By Eq. (99), we get c12=c32c33c31=baic. Then we obtain the solutions

N5,9=(acibaica000cbaci)andN5,10=(acibaica000cbaci)(a,b,c,dk,a,b,c0).

Case 3. Exactly two of a,b,c,d are 0: There are six subcases to consider. But note that if a=b=0,c0 and d0, i.e. c13=c32=0,c310 and c230, then by Eq. (99), we have c12c31=0. So c12=0. Thus Eqs. (92) and (96) give c11=0 and c22=0, respectively. Then by Eq. (95), we have c23c31=cd=0, a contradiction. Similarly, if c=d=0 and a,b0, then we can obtain c13c32=ab=0, a contradiction. So there are four subcases left to consider.

Subcase 1. a=c=0 and b,d0: Then c13=c31=0,c320 and c230. Thus by Eq. (94), we have c12c23=dc12=0. So c12=0. Thus by Eq. (92), we have c11=0. Then Eq. (99) gives c22+c33=0. By Eq. (100), we have c33=±bdi. Thus we get c22=bdi. Then we get the solutions

N5,11=(0000bdid0bbdi)andN5,12=(0000bdid0bbdi)(b,dk{0}).

Subcase 2. a=d=0 and b,c0: Then c13=c23=0,c320 and c310. Eq. (100) gives c33=0. Then by Eq. (98), we obtain c11=c32c31c21=bcc21. From Eq. (99), we have c12=c32c31c22=bcc22.

(1) If c21=0, then c11=0. By Eq. (96) we have c22=0. So c12=0. Then we obtain the solutions

N5,131=(000000cb0)(b,ck{0}).

(2) If c210, then denote e=c21. Thus by c11=bcc21, we have c11=bec. By Eq. (95), we have c11+c22=0. Thus c22=bec. So we have c12=bcc22=b2ec2. Then we obtain the solutions

N5,132=(becb2ec20ebec0cb0)(b,c,ek{0}).

In summary, we obtain the solutions

N5,13=(becb2ec20ebec0cb0)(b,ck{0},ek).

Subcase 3. b=c=0 and a,d0: This subcase is similar to the above Subcase 2. Denote e=c21. Then we can obtain the solutions

N5,14=(aeda2ed2aeaedd000)(a,d,ek,a,d0).

Subcase 4. b=d=0 and a,c0: By Eq. (100), c33=±aci. Then by Eq. (94), we have c11=aci. Then we can obtain the solutions

N5,15=(aci0a000c0aci)andN5,16=(aci0a000c0aci)(a,ck{0}).

Case 4. Exactly three of a,b,c,d are 0: Then we divide into four subcases to consider.

Subcase 1. a=b=c=0 and d0: Then c13=c32=c31=0 and c230. Thus by Eq. (94), we have c12c23=0. So c12=0 and then Eqs. (92) and (96) give c11=c22=0. By Eq. (100), we have c33=0. Denote e=c21. Then we obtain the solutions

N5,17=(000e0d000)(d,ek,d0).

Similarly, we obtain the following solutions for the rest of the subcases.

Subcase 2. a=b=d=0 and c0: Denote e=c21. Then we have

N5,18=(000e00c00)(c,ek,c0).

Subcase 3. a=c=d=0 and b0: Denote e=c12. Then we have

N5,19=(0e00000b0)(b,ek,b0).

Subcase 4. b=c=d=0 and a0: Denote e=c12, where ek. Then we have

N5,20=(0ea000000)(a,ek,a0).

Case 5. a=b=c=d=0: By Eq. (100), we have c33=0. Denote e=c12 and f=c21. Then by Eqs. (92) and (96), we have c11=±efi and c22=efi.

(1) If c120 or c210, by Eqs. (93) and (95), we have c11+c22=0. Then we can obtain the solutions

N5,211=(efie0fefi0000)andN5,212=(efie0fefi0000)(e0orf0)

(2) If c12=c21=0, then by Eqs. (92) and (96), we have c11=c12=0. Thus we obtain the zero solution N5,213=03×3.

In summary, we obtain the solutions

N5,21=(efie0fefi0000)andN5,22=(efie0fefi0000)(e,fk).

This completes the proof of the case for k[NCS(5)].

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 sl(2,C) 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]

Articles from Communications in Algebra are provided here courtesy of Taylor & Francis

RESOURCES