
342 L. N. Shevrin
Let us mention, finally, some questions that can be posed about free epigroups in various
varieties, including E
n
. Among such questions is that of the basis rank of E
n
for n>1(is
it equal to 2?) and the related question on the embeddability of the E
n
-free epigroup of
countable rank in an E
n
-free epigroup of finite rank. (For n = 1 the answers are known: it is
easy to show that the free completely regular semigroup of countable rank is not embeddable
in any finitely generated completely regular semigroup; also, as is shown in [64], the basis rank
of E
1
is infinite.) It is natural to ask about the decidability of the word problem in E
n
-free
epigroups (for n = 1 the decidability was established in [24,36,117]), about a description, for
n>1, of Green’s relations and, in particular, the maximal subgroups, and about a description
of the partially ordered set of idempotents. By the way, one may regard the E
n
-free epigroups
as looking to some extent like the free Burnside semigroups, i.e., the free semigroups of the
variety defined by the identity x
n
= x
n+m
for some m. Both certain structural properties
of such semigroups and the corresponding algorithmic aspects were considered in [43], and
perhaps some ideas of that work could be applied to the examination of the E
n
-free epigroups.
3 Certain decomp ositions
3.0 Introductory remarks
A common trend in a structural theory of the algebraic systems under examination is to find
conditions under which these systems can be constructed in some way from more specific
ones, in particular, those having a more simple, or more rigid, or more clear structure. In
our case, the role of such “building blocks” will be played by completely simple semigroups
(including certain particular types of them, up to groups) as well as nilsemigroups (in par-
ticular, nilpotent semigroups). As to the ways of “assemblage”, we will deal mostly with
ideal extensions and decompositions into bands (including certain particular types of such
constructions, for instance, the semilattice decompositions).
Recall that a semigroup is said to be a band of subsemigroups S
α
, α ∈ A,ifS
α
form a
partition of S,andforanyα, β ∈ A,thereexistsγ ∈ A such that S
α
S
β
⊆ S
γ
. This means, in
other words, that these subsemigroups (the components of the band under consideration) are
the classes of some congruence, ρ,say,onS, and the quotient semigroup S/ρ is a semigroup
of idempotents. If S/ρ is commutative, and hence is a semilattice, then S is said to be a
semilattice of semigroups S
α
; if the semilattice S/ρ is a chain, we say that S is a chain of the
corresponding semigroups.IfS/ρ is rectangular, i.e., it satisfies the identity xyx = x,thenS
is a rectangular band of the corresponding semigroups. A particular case of a rectangular band
is given by a left [right] bands of semigroups; in this case, for any two components S
α
, S
β
of a
given band, the inclusion S
α
S
β
⊆ S
α
[S
α
S
β
⊆ S
β
] holds, that is all the components are right
[left] ideals. A decomposition of a semigroup into a semilattice of some subsemigroups is called
a semilattice decomposition. Similarly, we obtain the notion of a rectangular, left and right
decomposition as well. A rectangular decomposition is also called a matrix decomposition.
[110]. In the former, one of the egregious errors uses “arbitrary” instead of “derivative” (Russian equivalents
are “proizvol’nyj” and “proizvodnyj”, respectively, so there is no need to comment what were tranlator’s
attention and understanding). In the latter, “manifold” is used instead of “variety” (Russian equivalents of
these words are the same, namely, “mnogoobrazie”, so the translator of [110] was not aware of the subject
of this survey). The reader of these translations should be vigilant in order to be able to detect probable
incorrectness not due to the authors but introduced by the translator.