×

On varieties of completely regular semigroups. I. (English) Zbl 0564.20034

Completely regular semigroups are semigroups that are unions of their subgroups. They may be regarded as universal algebras with an associative binary multiplication and unary inversion. In this language they form a variety \({\mathcal C}{\mathcal R}\). We present subvarieties of \({\mathcal C}{\mathcal R}\) by the corresponding fully invariant congruences on the free unary semigroup U. We give some constructions of how to obtain new f.i. congruences from the given ones.
The basic construction is the following: given an f.i. congruence \(\sim\) on U, put a\({\bar \sim}b\) iff \(E(a)=E(b)\), \(a\sim b\), O(a)\({\bar \sim}O(b)\), \(\ell (a){\bar \sim}\ell (b)\) (E(a) denotes the set of all variables of a, O(a) is the longest initial segment of a in all but one variable with removed non-matched ”(”, \(\ell (a)\) is defined dually).
For \({\mathcal V},{\mathcal W}\in {\mathcal L}({\mathcal C}{\mathcal R})\) (the lattice of all varieties of c.r. semigroups), put \({\mathcal V}\rho {\mathcal W}\) iff \(\overline{\sim_{{\mathcal V}}}=\overline{\sim_{{\mathcal W}}}\) for the corresponding f.i. congruences \(\sim_{{\mathcal V}}\) and \(\sim_{{\mathcal W}}\). The relation is a complete lattice congruence on \({\mathcal L}({\mathcal C}{\mathcal R})\). (The smallest \(\rho\)-class is formed by all varieties of bands, another \(\rho\)-class is the interval [the class of all groups, the class of all orthodox c.r. semigroups].) We characterize a certain part of \({\mathcal L}({\mathcal C}{\mathcal R})/\rho\). The following aim is partially reached: a reduction of the description of \({\mathcal L}({\mathcal C}{\mathcal R})\) to the description of \({\mathcal L}({\mathcal C}{\mathcal R})/\rho\).

MSC:

20M07 Varieties and pseudovarieties of semigroups
08B15 Lattices of varieties
20M15 Mappings of semigroups
PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] Clifford, A.H.,The free completely regular semigroup on a set, J. Algebra, 59 (1979), 434–451 · Zbl 0412.20049 · doi:10.1016/0021-8693(79)90139-X
[2] Gerhard, J.A.,Free completely regular semigroups, I, II, J. Algebra, 82 (1983), 135–142, 143–156 · Zbl 1227.20047 · doi:10.1016/0021-8693(83)90177-1
[3] Gerhard, J.A. and M. Petrich,The word problem for orthogroups, Canad. J. Math., 33 (1981), 893–900 · Zbl 0472.20021 · doi:10.4153/CJM-1981-070-4
[4] Gerhard, J.A. and M. Petrich,Word problems for free objects in certain varieties of completely regular semigroups, Pacific J. Math., 104 (1983), 351–359 · Zbl 0477.20038
[5] Green, J.A. and D. Rees,On semigroups in which x r =x, Proc. Cambridge Philos. Soc., 48 (1952), 35–40 · Zbl 0046.01903 · doi:10.1017/S0305004100027341
[6] Jones, P.R.,Mal’cev products of varieties of completely regular semigroups, to appear in J. Australian Math. Soc.
[7] Kaďourek, J. and L. Polák,On the word problem for free completely regular semigroups, preprint 1984
[8] Pastijn, F.J. and P.G. Trotter,Lattices of completely regular semigroup varieties, to appear in Pacific J. Math. · Zbl 0578.20055
[9] Petrich, M.,On the varieties of completely regular semigroups, Semigroup Forum, 25 (1982), 153–169 · Zbl 0502.20034 · doi:10.1007/BF02573595
[10] Rasin, V.V.,Free completely simple semigroups, Matem. Zapiski (Sverdlovsk), (1979), 140–151 (Russian) · Zbl 0424.20052
[11] Rasin, V.V.,Varieties of orthodox Clifford semigroups, Izv. Vyssh. Uchebn. Zaved. Mat., 1982, no. 11, 82–85 (Russian) · Zbl 0515.20045
[12] Reilly, N.R.,Varieties of completely regular semigroups, to appear in J. Australian Math. Soc.
[13] Trotter, P.G.,Free completely regular semigroups, Glasgow Math. J., 25 (1984), 241–254 · Zbl 0539.20032 · doi:10.1017/S0017089500005668
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.