Epimorphisms, dominions and H-commutative semigroups
Peter M. Higgins, Noor Alam, Noor Mohammad Khan

TL;DR
This paper investigates the structural properties of H-commutative semigroups, generalizes key results from commutative semigroup theory, and extends the concept of saturation to this broader class of semigroups.
Contribution
It generalizes Isbell's result on dominions and extends the saturation property to H-commutative semigroups satisfying the minimum condition.
Findings
The dominion of an H-commutative semigroup is H-commutative.
H-commutative semigroups satisfying the minimum condition are saturated.
Provides new examples and structural insights into H-commutative semigroups.
Abstract
In the present paper, a series of results and examples that explore the structural features of H-commutative semigroups are provided. We also generalise a result of Isbell from commutative semigroups to H-commutative semigroups by showing that the dominion of an H-commutative semigroup is H-commutative. We then use this to generalise Howie and Isbell's result that any H-commutative semigroup satisfying the minimum condition on principal ideals is saturated.
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.
Taxonomy
TopicsRings, Modules, and Algebras · semigroups and automata theory · Fuzzy and Soft Set Theory
**EPIMORPHISMS, DOMINIONS AND -COMMUTATIVE SEMIGROUPS
**
**Noor Alam
***Department of Mathematics
College of Preparatory Year, University of Hail, Hail-2440, K.S.A.
email: [email protected]*
**Peter M. Higgins
***Dept. of Mathematical Sciences
University of Essex, Colchester, U.K. CO1 4SQ
email: peteh essex.ac.uk
**Noor Mohammad Khan
***Department of Mathematics
Aligarh Muslim University, Aligarh-202002, India
email: [email protected]
Abstract In the present paper, a series of results and examples that explore the structural features of -commutative semigroups are provided. We also generalize a result of Isbell from commutative semigroups to -commutative semigroups by showing that the dominion of an -commutative semigroup is -commutative. We then use this to generalize Howie and Isbell’s result that any -commutative semigroup satisfying the minimum condition on principal ideals is saturated.
AMS Subject Classification (2000): 20M07
Key words: Semigroup, -commutative semigroups, epimorphism, dominion, saturated semigroups.
1. Introduction and Preliminaries
In this article, we are concerned with a series of results and examples that explore the class of semigroups for which Green’s relation is commutative: for all in . This definition of -commutativity was introduced by Tully in [13]. In ([11], Theorem 5.1), Nagy proposed a second definition of -commutativity: [Def. 1.1]. He then proved that the two characterizations coincide.
Definition 1.1 ([11, Chapter V]) A semigroup is called -commutative if for all , there exists such that .
Since such equations are always solvable in any group, we see at once that the collection of all -commutative semigroups represents an umbrella class for the classes of Groups and Commutative semigroups.
Result 1.2 ([11, Theorem 5.2, Chapter V]) A semigroup is -commutative if and only if Green’s equivalence on is a commutative congruence on .
Result 1.3 ([11, Theorem 5.3, Chapter V]) Every -commutative semigroup is decomposable into a semilattice of archimedean semigroups.
We now introduce dominions of semigroups. Dominions of permutative semigroups were studied in [8] by Khan and Shah. We restate here the presentation given in [8], adapted to the present context. Let be any semigroup with a subsemigroup . An element is said to be dominated by if for every semigroup and for all homomorphisms , for all implies that . The set of all elements of dominated by is called the dominion of in and will be denoted by Dom. It may be easily checked that Dom is a subsemigroup of containing . Any subsemigroup of a semigroup is said to be closed in if Dom = and absolutely closed if it is closed in every containing semigroup . Further a semigroup is said to be saturated if Dom for every properly containing semigroup and epimorphically embedded or dense in if Dom.
A (semigroup) morphism is said to be an epimorphism (epi for short) if for all morphisms with domain , implies (where the composition of morphisms is written from left to right). One may easily check that a morphism is epi if and only if is epi and the inclusion map is epi if and only if Dom. Every onto morphism is easily seen to be an epimorphism, but the converse is not true in general.
Semigroup dominions have been characterized by Isbell’s zigzag theorem, which is as follows.
Result 1.4 ([6, Theorem 2.3] or [4, Theorem VIII. 8.3.5]) Let be a subsemigroup of a semigroup . Then if and only if or there exists a series of factorizations of as follows:
where and
Such a series of factorizations is called a zigzag in over with value , length and spine
A semigroup is said to be permutative if it satisfies a permutation identity
[TABLE]
for some non-trivial permutation of the set . Further is called semicommutative if and and left (resp. right) semicommutative if (resp. ). Permutative semigroups are not saturated in general because commutative semigroups are not saturated. The infinite monogenic semigroup generated by is not saturated since it is epimorphically embedded in the infinite cyclic group generated by [4, Chapter VII Exercise 2(i)]. In [5], Howie and Isbell showed that commutative semigroups satisfying the minimum condition on principal ideals were saturated. In [7] Khan extended this result to semicommutative semigroups and in [8], Khan and Shah extended the theorem to right semicommutative semigroups (see [8, Theorem 2.1]).
The class of -commutative semigroups had been studied by several authors in one way or the other (see [9], [10], [11], [12] and [13] for example). The class of -commutative semigroups was first investigated by Tully [13]. He studied -commutative semigroups with the additional property that each congruence is uniquely determined by its kernel relative to a given element and claimed that -commutative semigroups were precisely those semigroups with Green’s relation a commutative congruence. Nagy [11] described archimedean properties of -commutative semigroups and showed that every -commutative semigroup is a semilattice of archimedean semigroups. Strecker [12], then, studied -commutative semigroups whose lattice of congruences was a chain. He also proved that a semigroup was an -commutative archimedean semigroup with an idempotent if and only if it was the ideal extension of a group by a commutative nilsemigroup. In [9], Mary studied semigroups whose set of completely regular elements was an -commutative set. Mary also gave equivalent characterizations of the condition that element-wise (for given ) without assuming the whole semigroup to be -commutative [10, Theorem 2.4] and of -commutative regular semigroups [10, Theorem 2.7]. For most of the principal results on -commutative semigroups, readers are referred to Nagy’s book [11].
Our results naturally fall into three parts, which are presented as Sections 2, 3 and 4 respectively. In Section 2, we show that the structural features of commutative semigroups are mirrored in the class in that, for any , all five Green’s relations are equal and correspond to the mutual divisibility of elements. Moreover is a semilattice of archimedean components. As a consequence of this, it may be easily deduced that the regular members of comprise the class of semilattices of groups. We also show that the condition on is equivalent to the requirement that is a congruence on and is commutative. Section 3 is devoted to the class of -commutative monoids and provides some examples and remarks showing the distinction between the classes and .
In the last section, we prove that the dominion of a -commutative semigroup is -commutative; this generalizes Isbell’s result, from commutative semigroups to -commutative semigroups (see [6, Corollary 2.5]). Finally we show that any -commutative semigroup satisfying the minimum condition on principal right ideals is saturated which extends Howie and Isbell’s result (see [5, Theorem 3.1]) from commutative semigroups to -commutative semigroups.
Throughout the remainder of the paper will denote an -commutative semigroup unless otherwise indicated. Background material and facts on semigroups that are assumed in what follows can be found in Clifford and Preston [2], Higgins [3] and Howie [4] and will be used throughout without explicit mention. For a comprehensive survey on the topic of semilattice decompositions of semigroups, there is the text [1].
2. Structure of -commutative semigroups
First we examine the general character of -commutative semigroups.
Proposition 2.1. The idempotents of any -commutative semigroup are central.
Proof. Let and . Then, for some , we have , whence Similarly, for some , we have , whence . Therefore . Hence each idempotent commutes with every member of .
Proposition 2.2. Let be an -commutative semigroup. Then .
Proof. Take any . Then . As is -commutative, for some , we have . Thus . By symmetry we also have the reverse inclusion whence it follows that for all , as required.
Theorem 2.3. All five Green’s relations coincide on an -commutative semigroup .
Proof. For any , by Proposition 2.2, we have whence it follows that for all . Hence, for any ,
[TABLE]
So we infer that in . What is more we have , whence it follows that also and, therefore, all five of Green’s relations coincide on .
Remark 2.4. In writing , therefore, we have a symbol that may denote any one of the five Green’s relations on , noting that if and only if each of and are mutually divisible, meaning that each is a factor of the other. In this context there is no need to distinguish between left factors, right factors, or interior factors.
Since is a right congruence and is a left congruence in any semigroup , it follows that in a -commutative semigroup, is a congruence.
It is the case that if we take any surjective homomorphism from an -commutative semigroup , then is also -commutative since for any either , in which case , or there exists an such that , in which case .
We generalize this result in our last section to epimorphisms of -commutative semigroups where we show that dominion of any -commutative semigroup is -commutative i.e. If is any -commutative subsemigroup of a semigroup , then Dom is also -commutative.
Theorem 2.5.
- (a)
([11, Theorem 5.2, Chapter V]) A semigroup is -commutative if and only if is a congruence and is commutative. 2. (b)
If is -commutative, then is the greatest combinatorial (meaning -trivial) image of .
**Proof **(a) By Theorem 2.3 and Remark 2.4, given that is -commutative, then is a congruence on . Moreover, for any , there exist such that , thus showing that ; by symmetry we have likewise so that , whence in , we have , so that is commutative.
Conversely suppose that is a congruence on and that is commutative. Then, for any , we have in that , and .
(b) Suppose that in the quotient semigroup . Then, since is also -commutative, we have in so that, for some , we have . Hence so that in and, by symmetry, also so that in , which is to say that . Therefore is trivial in . Hence is combinatorial, as required.
Conversely let be any congruence on such that is combinatorial. Take any such that . Then, since homomorphisms preserve Green’s relations, we have is . Since is combinatorial, it then follows that , whence we infer that Therefore in the least combinatorial congruence on (which is equivalent to saying that is the maximum combinatorial image of ), as required.
Theorem 2.6.
- (a)
For a semigroup , the following are equivalent:
- (i)
satisfies the equations . 2. (ii)
is -commutative and regular. 3. (iii)
is -commutative and is regular. 4. (iv)
is a semilattice of groups. 5. (v)
where is the least semilattice congruence on . 2. (b)
If is an -commutative semigroup, then, Reg, the set of all regular elements of , if non-empty, is an -commutative subsemigroup of which is itself a semilattice of groups.
Proof (a) (i) (ii). The first equation ensures that is regular, for then , while the second ensures that is -commutative.
(ii) (iii). By Theorem 2.5, is a congruence and, so, is also regular.
(iii) (iv). By Theorem 2.5, is commutative and combinatorial and, since is also regular, consists entirely of idempotents and so is a semilattice. Again, for each , we have . Thus is a group and is, therefore, a semilattice of groups.
(iv) (i). Since is regular, any is a solution to the first equation. Take any , whence we may write , where is the identity element of the group . Hence . Put , where inversion is in the group , noting also that . Then
[TABLE]
thereby proving that is an -commutative semigroup.
(iv) (v). In any semigroup, we have so that is always true. (Indeed, since is regular, we have , the least congruence containing ). Conversely, since each -class is a group, it follows that , a group -class, so that and we conclude that
(v) (iv). Since , it follows that, for any -class of and , we have , whence is a group. Since , we have that each -class is a group, and so is a semilattice of groups.
(b) By Proposition 2.1, idempotents commute with each other whence it follows that Reg is a subsemigroup as for any , we have . Again by Proposition 2.1 it now follows that Reg is a semilattice of groups, whence from (a) it follows that Reg is an -commutative subsemigroup of S.
Definition 2.7. A semigroup is called *archimedean *if for each , there exists such that , both as a left divisor and a right divisor.
Remark 2.8. There is no loss of generality in taking the same value of for the left and right divisors, for suppose that and . Then , so that is both a left and right divisor of a common power of .
Lemma 2.9. Let be an -commutative semigroup with and . Then
- (a)
the relation of divisibility is compatible with multiplication, meaning that if and , then . 2. (b)
if , then ; 3. (c)
if , then ; 4. (d)
; 5. (e)
if and only if .
**Proof. **(a) Since , we may write for some that . Then we have, for some , that
[TABLE]
so that , as required.
(b) Follows by induction on upon taking and .
(c) Follows as, by Theorem 2.5, is a congruence on .
(d) Follows as, by Theorem 2.5, is a commutative semigroup.
(e) This follows from (d) and the transitivity of the relation of divisibility.
Consider the *archimedean division relation * on whereby if for some . Clearly is reflexive. To see that is transitive, suppose further that for some . Then, by Lemma 2.9(b), we have , so that , showing that is transitive. Hence is a quasi-order on , which then induces an equivalence relation on defined by if and only if and . Indeed is a congruence on ; for suppose that so that say, and take any . Then, for some , we have so that whence, by Lemma 2.9(e), we infer that . Exchanging the roles of and in the argument gives that divides some power of and so Hence is a right congruence and by the left-right symmetry of the relation of division, it follows that is also a left congruence and, therefore, is a congruence on .
Recall that for any relation , denotes the least congruence on that contains the relation . A particular case of this is that , where , is the least semilattice congruence on any semigroup . Our discussion has led to the following result, which directly generalizes the well-known theorem for commutative semigroups [2, p136].
Theorem 2.10. Let be an -commutative semigroup. Then
- (a)
the relation on defined by if and only if each of and divides a power of the other is the least semilattice congruence on ; 2. (b)
each subsemigroup of is archimedean; 3. (c)
is a union of -classes of and contains at most one idempotent.
Proof (a) From the fact that and , we may conclude that for all . Next for some so that . By symmetry and, so, for all . Since is the least congruence containing all pairs of the form and , it follows that and is itself a semilattice congruence on .
Conversely, suppose that so that and say. Then, for some , we have and , which yields:
[TABLE]
whence it follows that Therefore as claimed.
(b) Since is a band (indeed a semilattice), each class is a subsemigroup of . Take any such that and such that .
We have for some and that . Then , whence is such that . By symmetry we conclude that each of and divides a power of the other, on the left and on the right, in the semigroup . Therefore each -class is an archimedean semigroup.
(c) For any , we have if and only if and , whence so that . Therefore each -class is a union of Green’s classes of . Finally, if for two idempotents , we have , then it follows by idempotency that , which implies that (and that is the unique maximal subgroup of contained in ).
3. More Results and Examples
The fact that the -commutative condition on a semigroup is defined by the first order sentence or allows us to produce further examples. For the moment, we first confine ourselves to the class of Monoids.
Theorem 3.1. The class of -commutative monoids is closed under the taking of homomorphic images, direct products, and regular submonoids.
Proof. That is closed under the taking of homomorphic images and direct products follows from being defined by the first order sentence .
Next let be a regular submonoid of . Then, by Theorem 2.6(b), Reg is itself a semilattice of groups, whence the same is true of Reg, and, so, by Theorem 2.6(b), is an -commutative submonoid of .
The distinction between monoids and semigroups is important. Moreover does not constitute a variety of monoids. Both these conclusions follow from the following examples. First another closure lemma is proved.
Lemma 3.2. The [math]-direct union of two -commutative semigroups and * *is -commutative.
Proof. Let . If or if , then there exists or as the case may be such that . Otherwise . So it follows that satisfies the condition to be -commutative.
Example 3.3. The class is not closed under the taking of direct products or even under the taking of direct powers of one of its members. What follows is an example of an -commutative semigroup with ten elements such that is not -commutative. Let , where denotes the zero element of this monogenic semigroup. Let be the symmetric group on and let be the [math]-direct union . Then and are each -commutative (as is commutative and is a group) and, so, by Lemma 3.2, is their [math]-direct union . We note that . Take the transpositions 3) and of , noting that . Consider the product in and suppose that were such that
[TABLE]
If we had then, since for all , equation (2) takes the form:
[TABLE]
[TABLE]
which is a contradiction as . On the other hand if we put , then (2) becomes , which is also false as . Therefore, although is a finite -commutative semigroup, is not -commutative. In particular this shows that the -commutative property cannot be defined by the condition that satisfies some set of equations with solutions in (as opposed to solutions in ).
Example 3.4. Although is closed under the taking of regular subsemigroups, this is not the case for arbitrary subsemigroups, even if the initial -commutative semigroup happens to be a monoid or indeed a group. To see this, we need look no further than the free group on , as contains the free monoid on the same pair of generators and is clearly not -commutative.
Example 3.5. We produce an example of a finite -commutative semigroup with a subsemigroup that is not -commutative. Let be the [math]-disjoint union , so that , where is as in Example 3.3. Then is not -commutative and is a subsemigroup of the finite semigroup . What is more, is -commutative: for take any . We have . Let where, if we put and otherwise put ; similarly put unless in which case we put . Then we obtain as and , thereby verifying the -commutative property.
Example 3.6. The archimedean components of the maximum semilattice image of an -commutative semigroup are not necessarily themselves -commutative, as we may verify for the case of the -commutative semigroup of Example 3.5 as follows.
For , take any . Then
[TABLE]
from which we conclude that every member divides some power of every member in the semigroup .
Next consider any factorization of over of the form . Then and . Hence if for some , then . Suppose however that . Then for any , we have as . Therefore we conclude that is an -class of .
As in Example 3.3, we now take . However, since and, as shown in Example 3.3, there is no such that , it follows that is not itself an -commutative semigroup.
4. Epimorphisms and Dominions
We now generalize Isbell’s result [6, Corollay 2.5] from commutative semigroups to -commutative semigroups.
Theorem 4.1. Let be an -commutative subsemigroup of a semigroup . Then Dom is -commutative.
Proof. Let be any -commutative subsemigroup of a semigroup . Then we have to show that Dom is also -commutative; i.e., for all there exists some such that .
Case (i): If both , then, trivially for some .
Case (ii): Let and . Then, by the zigzag theorem, there exists a series of factorizations of as follows:
where and
Now
[TABLE]
[TABLE]
as required.
Case (iii): Let and .
The proof in this case is the left-right dual to that of Case (ii).
Case (iv): Let .
Let (3) be a zigzag for in over . Now
[TABLE]
as required. Thus Dom is -commutative.
Corollary 4.2. Let be epi. If is -commutative, then is -commutative.
Proof. As be epi, the inclusion morphism is epi. Thus Dom. As is -commutative, by Remark 2.4, is -commutative. Therefore, by Theorem 4.1, is -commutative, as required.
In Propositions 4.3 through 4.7, we assume that is an -commutative semigroup and is a semigroup containing such that Dom. We also assume that is a right ideal of satisfying the minimum condition on principal right ideals and such that , if , then .
Proposition 4.3. For any , there exists and a positive integer such that is idempotent and .
Proof. Consider the descending sequence of principal right ideals etc generated by . By the hypothesis, the above descending sequence must stabilize. Therefore,
[TABLE]
for some . Then
[TABLE]
Hence .
Now put . We obtain
[TABLE]
[TABLE]
[TABLE]
Therefore, is an idempotent. Now we show that . As
[TABLE]
[TABLE]
[TABLE]
and , we have . Since, by Theorem 2.3, all Green’s relations are equal on -commutative semigroups, we have , as required.
Proposition 4.4. For each , there exists an idempotent such that .
Proof. As Dom, by the zigzag theorem, , for some . As , by hypothesis, . Hence has a left divisor . Let be the set of all left divisors of in . Then . Let be the set of all principal right ideals of generated by the elements of . Let be such that the principal right ideal of generated by is minimal in . Then for some . By the same argument used in the factorization of , it follows that for some and . As the principal right ideal of generated by is contained in the principal right ideal generated by , we have () for all . Now, consider the descending sequence of principal right ideals etc generated by . As satisfies the minimum condition on principal right ideals, for some and some positive integer . Thus, as in the proof of Proposition 4.3, is a multiple of an idempotent .
Hence
[TABLE]
Now
[TABLE]
[TABLE]
For take as in Proposition 4.4. Then . However and so that . Hence is properly contained in .
Proposition 4.5. For any idempotent , Dom.
Proof. Take any for any . Since , by the zigzag theorem, has a zigzag in over . Hence we may write
[TABLE]
[TABLE]
[TABLE]
[TABLE]
which is clearly a zigzag over with value . Therefore, Dom.
Recall the natural partial order of the idempotents of a semigroup whereby . An idempotent is said to be a right (left) divisor of if for some . Then necessarily as , and is a subsemigroup of , and since is an idempotent, we can take . By Proposition 2.1, if is -commutative, then and is a right divisor of is a left divisor of .
Proposition 4.6. For each , there exists a smallest idempotent such that .
Proof. By Proposition 4.4, there exist such that . Suppose that is such that . Then and it follows that the set of all idempotent divisors of in is a subsemilattice of the semilattice of all idempotents in . As satisfies the minimum condition on principal right ideals and idempotents are central, cannot have an infinite descending chain and so there must be a least element in .
Now consider any principal right ideal of , for any idempotent , generated by any element . Then . Therefore is equal to the principal right ideal of generated by whence , as does , satisfies the minimum condition on principal right ideals. This allows us to apply the argument of Proposition 4.4 to in the the following proposition.
Moreover , such that , then we have , and . Therefore . Now . Thus the conditions that we assumed throughout as regards to factorizations also apply to in as well.
Proposition 4.7. Let and let be a smallest idempotent such that , as provided through Proposition 4.6. If is properly contained in , then there exist an element whose only divisors in are the elements of , the -class of the element .
Proof. As , . Since Dom, by the zigzag theorem, , for some and . As in Proposition 4.4, let be the set of all divisors of in and let be the set of all principal right ideals of generated by the elements of . Let be such that the principal right ideal of generated by is minimal in . Then , where . Let be an arbitrary factor of in so that for some . Now, as in the proof of Proposition 4.4, there exists such that , which is an idempotent in . This is an idempotent factor of , and thus also of . Thus . Hence . As and , we have . Since, by Theorem 2.3, all Green’s relations are equal on -commutative semigroups, we have . Thus . Hence is the required element.
Theorem 4.8. Let be any -commutative semigroup and let be any semigroup containing such that Dom. Let be any right ideal of satisfying the minimum condition on principal right ideals and such that , if , then . Then is saturated.
Proof. Suppose on the contrary that is not saturated. Then there exists a semigroup containing properly and such that Dom. Then, by Propositions 4.5, Dom for each idempotent . By Proposition 4.7, let be such that the only divisors of in are members of . Since (and not just S) is -commutative, the spine factors of (for any zigzag of over ) are also left(and right) factors of . Therefore the zigzag of over is in fact a zigzag over , a contradiction as , being a group, is absolutely closed [5, Theorem 2.3].
Now, if we take , then the assumption “, if , then ” is trivially satisfied. Thus we get the following theorem as a corollary to Theorem 4.8.
Theorem 4.9. Any -commutative semigroup satisfying the minimum condition on principal right ideals is saturated.
We provide a class of examples of a saturated -commutative semigroup as an application of Theorem 4.9.
Theorem 4.10. Every -commutative archimedean semigroup containing an idempotent element is saturated.
Proof. Let be any -commutative archimedean semigroup containing an idempotent element. By Theorem 4.9, it is sufficient to show that satisfies the minimal condition on principal right ideals. By [12, Theorem 4], is an ideal extension of a group by a commutative nilsemigroup. Now, for any , consider a descending chain of principal right ideals of . Then for some , we have whence for all . In particular the descending chain stabilizes and the result follows by Theorem 4.9.
Acknowledgement. We sincerely thank the learned referee for his useful and constructive suggestions, including that of Theorem 4.10, that helped considerably to improve the presentation of the paper.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Bogdanovic, Ciric, S.M. D. and Z.L. Popovic, Semilattice decompositions of semigroups , Faculty of Economics, University of Niˇs (2011).
- 2[2] Clifford, A.H. and G.B. Preston, The Algebraic Theory of Semigroups , Math. Surveys No.7 (Amer. Math. Soc., Providence, R.I., Vol. I, 1961; Vol II, 1967).
- 3[3] Higgins, P.M., Techniques of semigroup theory , OUP, (1992).
- 4[4] Howie, J.M., Fundamentals of Semigroup Theory , London Math. Soc. Monograph (1995), Clarendon Press, Oxford.
- 5[5] Howie, J.M. and J.R. Isbell, Epimorphisms and dominions II , J. Algebra, 6 (1967), 7-21.
- 6[6] Isbell, J.R., Epimorphisms and dominions , Proc. of the confrence on Categorical Algebra, La Jolla, (1966), 232-246, Lange and Springer, Berlin.
- 7[7] Khan, N.M., On permutative saturated semigroups , J. Rajasthan Acad. Phy. Sci., Vol. 5, No. 2, (2006), 167-174.
- 8[8] Khan, N.M. and A.H. Shah, Epimorphisms, dominions and permutative semigroups, Semigroup Forum, Vol. 80 (2010), 181-190.
