No label defined (Q3987246)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 31021
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 31021 |
Statements
28 June 1992
0 references
congruence permutable semigroups
0 references
varieties of semigroups
0 references
varieties of regular *-semigroups
0 references
generators
0 references
0.76017416
0 references
0.7363784
0 references
0.7196106
0 references
0.71940434
0 references
0 references
0.7113362
0 references
Varieties of congruence permutable semigroups were described in a previous paper by the author [Czech. Math. J. 40(115), No. 3, 441-452 (1990; Zbl 0731.20039)]. The present paper characterizes all varieties of semigroups (varieties of regular *-semigroups) in which each semigroup (regular *-semigroup) with one or two generators (with two generators, resp.) is congruence permutable. The symbol \(W(p=q)\) \((W^*(p=q))\) denotes the variety of all semigroups (variety of all regular *- semigroups, resp.) satisfying the identity \(p=q\). Results: (1) Let \(\mathcal V\) be a variety of semigroups. Then (a) each \(S\in {\mathcal V}\) with one generator is congruence permutable iff \({\mathcal V}\subseteq W(x=x.x^ n)\) or \({\mathcal V}\subseteq W(x^ n=x.x^ n)\) for a positive integer \(n\); (b) each \(S\in{\mathcal V}\) with two generators is congruence permutable iff \({\mathcal V}\subseteq W(x=x.x^ n)\cap W((x.y.x)^ n=x^ n)\) for a positive integer \(n\). (2) Let \(\mathcal V\) be a variety of regular *-semigroups. Then \(\mathcal V\) is congruence permutable iff each \(S\in {\mathcal V}\) with two generators is congruence permutable iff \({\mathcal V}\subseteq W^*(x.x^*=y.y^*)\).
0 references