Some special congruences on completely regular semigroups
Li-Min Wang, Ying-Ying Feng, Hong-Hua Chen

TL;DR
This paper investigates specific congruence sequences in completely regular semigroups, identifying least congruences that produce quotient semigroups with particular properties, thus addressing open problems in the field.
Contribution
It introduces new properties of congruence sequences and characterizes least congruences for classes of completely regular semigroups, solving three open problems.
Findings
Identifies least congruences for semigroups with cryptogroup kernels.
Characterizes least congruences for semigroups over rectangular bands.
Provides solutions to three open problems in the literature.
Abstract
This paper enriches the list of properties of the congruence sequences starting from the universal relation and successively performing the operations of lower and lower . Three classes of completely regular semigroups, namely semigroups for which is a cryptogroup, semigroups for which is a cryptogroup and semigroups for which is over rectangular bands, are studied. , and are found to be the least congruences on such that the quotient semigroups are semigroups for which is a cryptogroup, is a cryptogroup and is over rectangular bands, respectively. The results obtained present a response to three problems in Petrich and Reilly's textbook \textquoteleft\textquoteleft Completely Regular Semigroups\textquoteright\textquoteright.
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.
Some special congruences on completely regular semigroups
Li-Min Wang
School of Mathematics, South China Normal University,
Guangzhou 510631, P. R. China
Ying-Ying Feng Corresponding author. Email: [email protected] Department of Mathematics, Foshan University,
Foshan 528000, P. R. China
Hong-Hua Chen
School of Mathematics, South China Normal University,
Guangzhou 510631, P. R. China
Abstract
This paper enriches the list of properties of the congruence sequences starting from the universal relation and successively performing the operations of lower and lower . Three classes of completely regular semigroups, namely semigroups for which is a cryptogroup, semigroups for which is a cryptogroup and semigroups for which is over rectangular bands, are studied. , and are found to be the least congruences on such that the quotient semigroups are semigroups for which is a cryptogroup, is a cryptogroup and is over rectangular bands, respectively. The results obtained present a response to three problems in Petrich and Reillyβs textbook βCompletely Regular Semigroupsβ.
Keywords: completely regular semigroup, congruence, semigroup for which is a cryptogroup, semigroup for which is a cryptogroup, semigroup for which is over rectangular bands.
2010 MR Subject Classification: 20M17
Congruences play a central role in many of the structure theorems and other important considerations in semigroup theory. The kernel-trace approach to congruences on regular semigroups is specialized to completely regular semigroups. In the attempt to gain insight into the structure of the congruence lattice of a completely regular semigroup , a key role is played by the decomposition of which is induced by the complete -congruence and the complete congruence , induced by the kernels and the traces of congruences. For the above decomposition, we obtain two operators, lower and , on . We denote by the least congruence on having the same kernel as , and by the least congruence on having the same trace as . Fixing an arbitrary congruence on a completely regular semigroup , we may apply to the operators of lower and , thereby obtaining some new congruences. Iterating this procedure, one arrives at the min-network of congruences on based on . This procedure becomes quite interesting if we start with the universal relation and in this way construct new congruences that can be characterized in an independent way. Some of these congruences are well known. Indeed, , , and are, respectively, the least group, band, -unitary and cryptogroup congruences on completely regular semigroups. Also, , and are, respectively, the least semilattice, Clifford and orthodox congruences on completely regular semigroups. These congruences are depicted in Figure 1 together with the types of semigroups to which the quotient semigroups belong. Notice that there are corresponding results for regular semigroups (see [2], [3], [4]) and inverse semigroups (see [5]).
Recall that is over groups on Clifford semigroups, and that is also over groups on cryptogroups. Again, notice that is over rectangular bands on -unitary completely regular semigroups, and is also over rectangular bands on orthogroups. Motivated by the symmetry observed in [7], we may ask: Is a congruence such that is over groups and a congruence such that is over groups? Symmetrically, is a congruence such that is over rectangular bands?
Coincidentally, the first question is equivalent to a problem in [6, Problems VII.3.13]:
(iii) For which is , or , cryptic?
This problem could be reached as soon as the other two problems, especially the first one, in [6, Problems VII.3.13] are solved:
(i) Characterize orthodox congruences for which is cryptic.
(ii) If is orthodox, is cryptic?
Our objective here is to present a solution to these three problems. Meanwhile, we obtain properties of the congruences , and which highlight three new classes of completely regular semigroups and lead to characterizations of these classes.
In Section 1, we summarize the notation and terminology to be used in the paper. In Section 2, we study semigroups for which (respectively, ) is a cryptogroup and related congruences. A similar analysis can be found in Section 3 for semigroups for which is over rectangular bands and related congruences. The results obtained lead to new characterizations for orthogroups.
1 Preliminaries
Throughout this paper, unless otherwise stated, stands for a completely regular semigroup.
We will adopt the notation and terminology of Petrich β Reilly [6] and Howie [1], to which the reader is referred for basic information and results on completely regular semigroups. A completely regular semigroup is a union of its (maximal) subgroups. In , we have the operation of inversion; we will write . For an arbitrary completely regular semigroup , we denote by the set of its idempotents and the set of all inverses of an element . The complete lattice of congruences on is denoted by . If consists solely of idempotents, then it is a band. A commutative band is a semilattice. A semigroup satisfying the identity is a rectangular band. A regular semigroup is orthodox if its idempotents form a subsemigroup. An orthodox completely regular semigroup is an orthogroup. A semigroup is cryptic if is a congruence. A cryptic completely regular semigroup is a cryptogroup. A semigroup isomorphic to the direct product of a rectangular band and a group is a rectangular group.
For a regular semigroup ,
[TABLE]
It is easy to see that the restriction of to is given by
[TABLE]
A binary relation on a set is denoted by . For an equivalence relation on a semigroup , we will write for the smallest congruence on containing and the greatest congruence contained in . For , we will write for restriction of to . Let be an equivalence relation on a set . If , then saturates if is a union of -classes. For a subset of a semigroup , define by
[TABLE]
Then is the greatest congruence that saturates .
As weβve seen in the classic [6], other than Greenβs relations, the relations below play an important role in the discussion of completely regular semigroups. On any completely regular semigroup , relations , and are defined by
[TABLE]
Let be a class of semigroups and . Then is over if each -class which is a subsemigroup of belongs to . Also is an -congruence if . We say that is a semilattice of semigroups of type if there exists a semilattice congruence on over . One can similarly speak of -bands of semigroups of type if is any class of bands or simply a band of semigroups of type if is the class of all bands. A congruence is idempotent separating if , and imply that . Equivalently, is idempotent separating if and only if . On the other hand, is idempotent pure if saturates ; that is, with and implies that . Equivalently, is idempotent pure if and only if . We denote by and the greatest idempotent separating and greatest idempotent pure congruences on , respectively. The equality and the universal relations on are denoted by and respectively.
Some properties of completely regular semigroups are contained in the next three lemmas.
Lemma 1.1**.**
([6, Lemma II.3.5]) Let be a regular subsemigroup of a semigroup . For , we have .
Lemma 1.2**.**
([6, Lemma II.3.8]) Let be a regular subsemigroup of a completely regular semigroup . Then .
Lemma 1.3**.**
([6, Lemma II.3.9]) Let be a completely regular semigroup, and . Then , , and are completely regular subsemigroups of .
The following characterizations of cryptogroups, rectangular groups and orthogroups will be of use later.
Lemma 1.4**.**
*([6, Theorem II.8.1, Exercise II.8.8(i)]) The following conditions on a completely regular semigroup are equivalent.
(1) is cryptic;
(2) is a band of groups;
(3) satisfies the identity ;
(4) For any , , implies that .*
Lemma 1.5**.**
*([6, Corollary III.5.3]) The following conditions on a completely regular semigroup are equivalent.
(1) is a rectangular group;
(2) is a rectangular band;
(3) is an orthodox completely simple semigroup;
(4) is over rectangular bands.*
Lemma 1.6**.**
*([6, Theorem II.5.3]) The following conditions on a completely regular semigroup are equivalent.
(1) is orthodox;
(2) is a semilattice of rectangular groups;
(3) For all , is orthodox.*
Proof.
The equivalence of (1)and (3) follows from [6, Theorem II.5.3].
. Let be an orthogroup. Then is a rectangular band by [6, Lemma II.5.2]. It follows from Lemma 1.5 that is a rectangular group, and is a semilattice of rectangular groups.
. If is a semilattice of rectangular groups, then is trivially a semilattice of completely simple semigroups so that is completely regular. For all , is a rectangular group whence is orthodox. That is orthodox is an immediate consequence of the equivalence of (1) and (3). β
We now turn to results on congruences on completely regular semigroups.
For , is the trace of , and is the kernel of . A congruence on a completely regular semigroup is determined uniquely by its trace and kernel.
Lemma 1.7**.**
([6, Lemma VI.3.1]) For any and , we have
[TABLE]
For any , the relations and are defined as follows,
[TABLE]
The relation is a complete congruence on the lattice , while is an equivalence relation on . The equivalence class [resp. ] is an interval of with greatest and least element to be denoted by [resp. ] and [resp. ], respectively.
Lemma 1.8**.**
([6, Theorem VII.1.2, Theorem VII.2.2]) For any , we have
[TABLE]
The following lemma will be used frequently later.
Lemma 1.9**.**
.
Proof.
Let and . Then and so that . Hence . β
2 Congruences for which of the quotient semigroup is a cryptogroup and congruences for which of the quotient semigroup is a cryptogroup
We first characterize orthodox congruences for which is cryptic. Then we define semigroups for which (respectively, ) is a cryptogroup. Characterizations for congruences for which (respectively, ) of the quotient semigroup is a cryptogroup are considered. The least congruence for which is a cryptogroup and the least congruence for which is a cryptogroup on a completely regular semigroup are proved to be and , respectively.
Lemma 2.1**.**
*The following statements concerning an orthodox congruence on a completely regular semigroup are equivalent.
(1) is cryptic;
(2) ;
(3) ;
(4) ;
(5) ;
(6) ;
(7) ;
(8) is over groups.*
Proof.
. Let be cryptic. By Lemma 1.4, for , , implies , and therefore by [6, Corollary VI.2.9], . Hence .
. Let with . Then and whence by Lemma 1.7. Hence . The opposite conclusion is trivial whence equality prevails.
. Obvious.
. From Lemma 1.8 and the assumption we see that . Consequently is idempotent separating so that .
. Since , it follows that , i.e. that .
. Indeed so that is idempotent separating whence . Thus and . The reverse containment is obvious. Therefore we have . By Lemma 1.9 we can deduce that .
. Suppose that with . Since any two idempotents are -related, we have which yields . Therefore . Since is a completely regular subsemigroup of by Lemma 1.3, it follows that is a subgroup of .
. Notice first that is a subsemigroup of because is an orthodox congruence. By [6, Lemma VI.2.6], the hypothesis implies that . It follows that from the proof of and , and so, . For any , if , then and . Hence and . Therefore . Note that is a congruence on . Hence is a congruence on which implies that is cryptic. β
Remark 2.2*.*
It is worth noticing that the assumption that is orthodox is only used in part (1) β otherwise might not be a subsemigroup β and proving the implication .
Corollary 2.3**.**
If is orthodox, then is cryptic.
Proof.
If is orthodox, then from the equivalence of (1) and (2) in Lemma 2.1 we infer that is cryptic. β
Remark 2.4*.*
Lemma 2.1 and Corollary 2.3 are exactly the responses to Problems VII.3.13 (i) and (ii) in [6].
We next proceed to answer the question in [6, Problems VII.3.13(iii)].
Theorem 2.5**.**
*The following conditions on a completely regular semigroup are equivalent.
(1) is cryptic;
(2) ;
(3) ;
(4) ;
(5) ;
(6) ;
(7) there exists an idempotent separating -unitary congruence on ;
(8) ;
(9) is over groups.*
Proof.
Notice that we have used no assumption of orthodoxy within the proof of in Lemma 2.1. So we now have . It suffices to show , and the equivalence of (6) and (7).
. Notice that the assumption that is orthodox is a guarantee for being a subsemigroup in Lemma 2.1. Here we have being a cryptogroup. And the argument goes along the same lines as in of Lemma 2.1.
. First it follows from [6, Theorem VII.3.6] that is a subsemigroup of . A similar argument to that for in Lemma 2.1 establishes that is a congruence on and so the proof is complete.
. It is clear from the hypothesis that , and that the -unitary congruence is idempotent separating.
. Let be an idempotent separating -unitary congruence. Then and which gives . β
We now set out to set up characterizations for congruences for which of the quotient semigroup is a cryptogroup. We shall need an auxiliary result.
For a congruence on a completely regular semigroup , notice that there exists at least one cryptogroup congruence on containing , namely the universal relation , and that the intersection of cryptogroup congruences is still a cryptogroup congruence, we have a least cryptogroup congruence containing , to be denoted by . Similarly, we have a least -unitary and a least orthodox congruence on containing , to be denoted by and , respectively.
Proposition 2.6**.**
*Let be a completely regular semigroup and . Then
(1) , and ;
(2) , and ;
(3) , and .*
Proof.
(1) First let . Recalling Lemma 1.4, we have which implies that . Further, implies that and thus also that . It now follows from Lemma 1.4 that is a cryptogroup congruence.
Next let be a cryptogroup congruence containing . Then and . Therefore proving the minimality of .
Now . Thus is a cryptogroup congruence on . If is a cryptogroup congruence on with , then which implies that is a cryptogroup congruence on . Hence and . Consequently is the least cryptogroup congruence on whence . Notice that similar arguments give that and .
(2) The remark above shows that for any ,
[TABLE]
By Lemma 1.8 we have an expression for , hence it suffices to prove
[TABLE]
and for this, it is enough to show
[TABLE]
It is further enough to show the equivalences
[TABLE]
The first equivalence follows immediately from the fact that is the least group congruence containing . By [6, Theorem VI.5.1], the second equivalence holds. We consequently have .
(3) The proof is closely similar to that for (2) and is omitted. β
We are now ready for characterizations for congruences for which of the quotient semigroup is a cryptogroup.
Proposition 2.7**.**
*The following statements concerning are equivalent.
(1) is cryptic;
(2) ;
(3) .*
Proof.
. Since is a cryptogroup, we have by Theorem 2.5 that . It is known by Proposition 2.6 that and by [6, Proposition VII.2.5] that . Hence so that .
. gives . But , and then . Consequently, .
. The hypothesis and give that the -unitary congruence is idempotent separating on . By Theorem 2.5, we get that is a cryptogroup. β
Corollary 2.8**.**
* is the least congruence for which is a cryptogroup on a completely regular semigroup.*
Proof.
Since , we have by Proposition 2.7 that is a cryptogroup. If is a congruence for which is a cryptogroup, then and . This proves the assertion. β
We conclude this section with observations concerning semigroups for which is a cryptogroup.
Theorem 2.9**.**
*The following conditions on a completely regular semigroup are equivalent.
(1) is cryptic;
(2) ;
(3) ;
(4) ;
(5) ;
(6) ;
(7) there exists an idempotent separating orthodox congruence on ;
(8) ;
(9) is over groups.*
Proof.
First notice that is orthodox from and [6, Exercises VII.3.11(i)]. So the equivalence of (1) β (6), (8) and (9) is an immediate consequence of Lemma 2.1. It remains to show the equivalence of (6) and (7).
. It is clear from the hypothesis that , and that the orthodox congruence is idempotent separating.
. Let be an idempotent separating orthodox congruence. Then and which establishes . β
The next result characterizes congruences for which of the quotient semigroup is a cryptogroup in several ways.
Proposition 2.10**.**
*The following statements concerning are equivalent.
(1) is cryptic;
(2) ;
(3) .*
Proof.
The proof is closely similar to that for Proposition 2.7 and is omitted. β
Corollary 2.11**.**
* is the least congruence for which is a cryptogroup on a completely regular semigroup.*
Proof.
The argument here goes along the same lines as in Corollary 2.8. β
Remark 2.12*.*
Theorem 2.5 and Theorem 2.9 are the responses to Problem VII.3.13(iii) in [6].
3 Congruences for which of the quotient semigroup is over rectangular bands
After defining semigroups for which is over rectangular bands, we provide some equivalent conditions in terms of congruences. We then characterize congruences for which of the quotient semigroup is over rectangular bands on a completely regular semigroup and prove that the least such congruence on is . These results lead naturally to congruence characterizations for orthogroups.
Definition 3.1**.**
A completely regular semigroup is called a semigroup for which is over rectangular bands if is a rectangular band for each .
The next proposition illustrates this class of completely regular semigroups.
Proposition 3.2**.**
Let be a semigroup for which is over rectangular bands. Then is a band of rectangular groups.
Proof.
By [6, Lemma VI.1.9], , and therefore, is idempotent pure, i.e., . Since , we must have for all whence is a completely regular subsemigroup of by Lemma 1.3. From and the hypothesis that is a rectangular band, we now infer that is a rectangular group by Lemma 1.5. Thus is a band of rectangular groups. β
In fact, if is a band of rectangular groups and a band congruence on such that is a rectangular group for all , then and is a completely regular subsemigroup of by Lemma 1.3. It follows by Lemma 1.5 that is a rectangular group. For convenience, we write or for , where is a band and is a rectangular group.
The next lemma provides useful information concerning bands of rectangular groups.
Lemma 3.3**.**
Let be a band of rectangular groups. Then .
Proof.
Let with . Then and for some . It is clear that whence . It follows that so that . Hence and . On the other hand, if , then which implies . Thus and . Therefore we have . β
It is worth remarking that orthogroups are semigroups for which is over rectangular bands. First, if is an orthogroup, then and , which yields that is a band for . Next recall that an orthodox completely regular semigroup is a semilattice of rectangular groups. For , since . But is a rectangular group and and hence is a rectangular band.
The class of semigroups for which is over rectangular bands can be characterized in many ways, of which we now give a sample.
Theorem 3.4**.**
*The following conditions on a completely regular semigroup are equivalent.
(1) is over rectangular bands;
(2) ;
(3) ;
(4) ;
(5) ;
(6) ;
(7) there exists an idempotent pure cryptogroup congruence on ;
(8) ;
(9) is a band of rectangular groups with ;
(10) .*
Proof.
. Let be over rectangular groups. By Proposition 3.2, is a band of rectangular groups and so we can apply Proposition 3.3 to conclude that . Since is over rectangular bands, we have . Moreover, yields and . Conversely, gives . And the required equality holds.
. Obvious.
. It follows from and Lemma 1.9 that .
. It follows directly from [6, Lemma VI.1.8].
. If , then whence .
. If , then which implies that the cryptogroup congruence is idempotent pure.
. Let be an idempotent pure cryptogroup congruence. Then . If and , then . From the foregoing we have , that is, , and .
. Again notice that is a completely regular subsemigroup of by Lemma 1.3. Let , and . Then . By the hypothesis this implies that whence . Therefore is a band. Further, implies that is completely simple. We conclude that is a rectangular band.
. Let be over rectangular bands. It follows from Proposition 3.2 that is a band of rectangular groups and from the previous proof of that whence .
. Let with . Then . But , and hence . It follows from Lemma 1.7 that since . Thus . Conversely, if , then which implies that , i.e., . Therefore whence . Again, by Proposition 3.3, we have .
. It follows immediately from [6, Lemma VI.1.9]. β
We now turn to characterizations of congruences for which of the quotient semigroup is over rectangular bands on a completely regular semigroup.
Proposition 3.5**.**
*The following statements concerning are equivalent.
(1) is over rectangular bands;
(2) is a cryptogroup congruence;
(3) .*
Proof.
. Since is over rectangular bands, we have by Theorem 3.4 that . It is known by Proposition 2.6 that so that . Therefore and is a cryptogroup congruence since cryptogroups are closed under homomorphic images.
. It follows from that whence and .
. Since , is an idempotent pure congruence on , and this together with Proposition 2.6 gives that is over rectangular bands by Theorem 3.4. β
Corollary 3.6**.**
In any completely regular semigroup , is the least congruence for which is over rectangular bands.
Proof.
The argument here goes along the same lines as in Corollary 2.10. β
Proposition 3.7**.**
For any completely regular semigroup , is the least congruence on for which is a cryptogroup and is over rectangular bands.
Proof.
By [6, Proposition VII.2.10], we have . Note that . Hence , and so is a cryptogroup, by Proposition 2.7. Also, , which implies that is over rectangular bands. Let be a congruence such that is a cryptogroup and that is over rectangular bands. By Proposition 3.5 and Proposition 2.7, we obtain and , which yields . This completes the proof of the proposition. β
The congruences , and are depicted in Figure 2 together with some well-known congruences, enlarging the list of properties of the congruence network in Figure 1.
The next proposition explores an interesting property of semigroups for which is over rectangular bands.
Proposition 3.8**.**
Let be a semigroup for which is over rectangular bands and the least group congruence on for any . Then .
Proof.
First since and since , we have . Thus is a group congruence on and . Conversely, suppose that and . Then . By the hypothesis that is over rectangular bands, and therefore . Consequently so that .
Next, it is clear that for all . Then . Conversely, if and , then so that , lies in some . Thus . We conclude that . β
Recall that orthogroups are examples of semigroups for which is over rectangular bands. The remainder of this section is devoted to new characterizations for orthogroups.
Lemma 3.9**.**
Let be an orthogroup. Then .
Proof.
Since , and thereby . On the other hand, for any , since is orthodox. Therefore so that .
Let and . If and , then and . It follows that while . But and hence , by Lemma 1.7. Therefore whence . We conclude that . β
Compare the following result with Theorem 3.4 and Proposition 3.2.
Theorem 3.10**.**
*The following conditions on a completely regular semigroup are equivalent.
(1) is orthodox;
(2) is a semilattice of rectangular groups;
(3) ;
(4) ;
(5) ;
(6) ;
(7) ;
(8) ;
(9) ;
(10) there exists an idempotent pure Clifford congruence;
(11) ;
(12) is over rectangular bands;
(13) .*
Proof.
. See Lemma 1.6.
. Assume that and . Then . From the equivalence of (1) and (2), we know that is a rectangular band. Therefore by [6, Exercises II.5.9(i)], if and , then . Again, by [6, Exercises II.5.9(i)], , i.e., . Similarly, if , then . Therefore . Furthermore, yields . By Lemma 1.7, we can deduce that whence . Conversely if , then which implies that , i.e., . Thus and the required equality holds.
, . Obvious.
. Suppose that is a congruence. Then gives , by [6, Lemma VI.1.8]. Hence . It is clear that . Thus and the equality takes place. From the foregoing and Lemma 3.9 we infer that .
. As a first step we show that . Let and . Then , lies in some rectangular group and . Thus , while . It follows that , i.e., , and so . Conversely, if , then and . Thus and . Therefore .
From the fact that and the equivalence of (1) and (2), we have .
. It follows from and Lemma 1.9 that .
, . It follows immediately from Lemma VI.1.8 and Lemma VI.1.9 in [6].
. From we infer that .
. Indeed so that the Clifford congruence is idempotent pure.
. Let be an idempotent pure Clifford congruence. Then , which by [6, Lemma VI.1.8] gives .
. Suppose that is over rectangular bands. Since , this implies, in view of Lemma 1.5, that is a rectangular group for any . Therefore, is a semilattice of rectangular groups. β
Acknowledgements This work is supported by the National Natural Science Foundation of China (Grant No. 11871150). The authors would like to thank the referee for the careful reading and valuable suggestions. The authors would also like to thank Professor Marianne Johnson for providing the efficient communications.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Howie, J. M. (1995). Fundamentals of Semigroup Theory, London Mathematical Society Monographs . New Series, Vol.12. New York: The Clarendon Press.
- 2[2] Howie, J. M., Lallement, G. (1966). Certain fundamental congruences on a regular semigroup. Proc. Glasgow Math. Assoc. 7: 145β159.
- 3[3] Pastijn, F., Petrich, M. (1986). Congruences on regular semigroups. Trans. Amer. Math. Soc. 295: 607β633 .
- 4[4] Pastijn, F., Petrich, M. (1988). The congruence lattice of a regular semigroup. J. Pure and Appl. Algebra 53: 93β123.
- 5[5] Petrich, M. (1984). Inverse Semigroups . New York: Wiley.
- 6[6] Petrich, M., Reilly, N. R. (1999). Completely Regular Semigroups . New York: Wiley.
- 7[7] Wang, L. M., Feng, Y. Y. (2011). E β Ο πΈ π E\omega -Clifford congruences and E β Ο πΈ π E\omega - E πΈ E -reflexive congruences on an inverse semigroup. Semigroup Forum 82: 354β366. DOI: 10.1007/s 00233-011-9293-y.
