Finite state wreath powers of transformation semigroups

The finite state wreath power of a transformation semigroup is introduced. It is proved that the finite state wreath power of nontrivial semigroup is not finitely generated and in some cases even does not contain irreducible generating systems. The free product of two monogenic semigroups of index 1 and period m is constructed in the finite state wreath power of corresponding monogenic monoid.     

The structure of L*-inverse semigroups

The concepts of L*-inverse semigroups and left wreath products of semigroups are introduced. It is shown that the L*-inverse semigroup can be described as the left wreath product of a type A semigroupΓand a left regular band B together with a mapping which maps the semigroupΓinto the endomorphism semigroup End(B). This result generalizes the structure theorem of Yamada for the left inverse semigroups in the class of regular semigroups. We shall also provide a constructed example for the L*-inverse semigroups by using the left wreath products.     

Malcev presentations for subsemigroups of direct products of coherent groups

The direct product of a free group and a polycyclic group is known to be coherent. This paper shows that every finitely generated subsemigroup of the direct product of a virtually free group and an abelian group admits a finite Malcev presentation. (A Malcev presentation is a presentation of a special type for a semigroup that embeds into a group. A group is virtually free if it contains a free subgroup of finite index.) By considering the direct product of two free semigroups, it is also shown that polycyclic groups, unlike nilpotent groups, can contain finitely generated subsemigroups that do not admit finite Malcev presentations.     

The structure of ?*-inverse semigroups

The concepts of ℒ*-inverse semigroups and left wreath products of semigroups are introduced. It is shown that the ℒ*-inverse semigroup can be described as the left wreath product of a type A semigroup Γ and a left regular band B together with a mapping which maps the semigroup Γ into the endomorphism semigroup End(B). This result generalizes the structure theorem of Yamada for the left inverse semigroups in the class of regular semigroups. We shall also provide a constructed example for the ℒ*-inverse semigroups by using the left wreath products.     

The rank of the endomorphism monoid of a uniform partition

The rank of a semigroup is the cardinality of a smallest generating set. In this paper we compute the rank of the endomorphism monoid of a non-trivial uniform partition of a finite set, that is, the semigroup of those transformations of a finite set that leave a non-trivial uniform partition invariant. That involves proving that the rank of a wreath product of two symmetric groups is two and then use the fact that the endomorphism monoid of a partition is isomorphic to a wreath product of two full transformation semigroups. The calculation of the rank of these semigroups solves an open question.     

Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups

We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with respect to a universal relation, this result can be extended to infinite representations of ordered complemented semigroups.     

On left C-wrpp semigroups

It is known that a C–rpp semigroup can be described as a strong semilattice of left cancellative monoids. In this paper, we introduce the class of left C–wrpp semigroups which includes the class of left C–rpp semigroups as a subclass. We shall particularly show that the semi-spined product of a left regular band and a C–wrpp semigroup forms a curler which is a left C–wrpp semigroup and vice versa. Results obtained by Fountain and Tang on C–rpp semigroups are extended and strengthened.     

Gauss laws in the sense of Bernstein and uniqueness of embedding into convolution semigroups on quantum groups and braided groups

Summary. The goal of this paper is to characterise certain probability laws on a class of quantum groups or braided groups that we will call nilpotent. First we introduce a braided analogue of the Heisenberg–Weyl group, which shall serve as standard example. We introduce Gaussian functionals on quantum groups or braided groups as functionals that satisfy an analogue of the Bernstein property, i.e. that the sum and difference of independent random variables are also independent. The corresponding functionals on the braided line, braided plane and a braided q-Heisenberg–Weyl group are determined. Section 5 deals with continuous convolution semigroups on nilpotent quantum groups and braided groups. We extend recent results proving the uniqueness of the embedding of an infinitely divisible probability law into a continuous convolution semigroup for simply connected nilpotent Lie groups to nilpotent quantum groups and braided groups. Finally, in Section 6 we give some indications how the semigroup approach of Heyer and Hazod to the Bernstein theorem on groups can be extended to quantum groups and braided groups. Received: 30 October 1996 / In revised form: 1 April 1997     

Finite degree: algebras in general and semigroups in particular

An algebra A has finite degree if its term functions are determined by some finite set of finitary relations on A. We study this concept for finite algebras in general and for finite semigroups in particular. For example, we show that every finite nilpotent semigroup has finite degree (more generally, every finite algebra with bounded p _n -sequence), and every finite commutative semigroup has finite degree. We give an example of a five-element unary semigroup that has infinite degree. We also give examples to show that finite degree is not preserved in general under taking subalgebras, homomorphic images, direct products or subdirect factors.     

Finite aperiodic semigroups with commuting idempotents and generalizations

It is proved that any pseudovariety of finite semigroups generated by inverse semigroups, the subgroups of which lie in some proper pseudovariety of groups, does not contain all aperiodic semigroups with commuting idempotents. In contrast we show that every finite semigroup with commuting idempotents divides a semigroup of partial bijections that shares the same subgroups. Finally, we answer in the negative a question of Almeida as to whether a result of Stiffler characterizing the semidirect product of the pseudovarieties ofR-trivial semigroups and groups applies to any proper pseudovariety of groups.     

On free spectra of finite completely regular semigroups and monoids

We show that a finite completely regular semigroup has a sub-log-exponential free spectrum if and only if it is locally orthodox and has nilpotent subgroups. As a corollary, it follows that the Seif Conjecture holds true for completely regular monoids. In the process, we derive solutions of word problems of free objects in a sequence of varieties of locally orthodox completely regular semigroups from solutions of word problems in relatively free bands.     

Centralizers in symmetric inverse semigroups: Structure and order

The representation [5] of the centralizerC(x) of a permutationx in (a symmetric inverse semigroup)C _n involves direct products of wreath products. Indeed, this semigroup case extends its group theory counterpart. Here, the last case (forx nilpotent) is addressed: A quotient of a wreath product is introduced and used to obtain a representation of the correspondingC(x). It follows that, for anyx∈C _n ,C(x) can be imbedded in a direct product of wreath products with a quotient of a wreath product. A formula for calculating the order ofC(x) is given. The independent parameters in the formula are precisely those that define the path structure ofx∈C _n . Part of this research was supported by a Mary Washington College faculty development grant.     

Compact totally disconnected k-divisible semigroups

One of the early results [5] regarding divisibility in semigroups states that no finite non-degenerate group is divisible. A sequel to this (which in view of well-known results on compact semigroups is a generalization) is that a compact semigroup is divisible if and only if each component is a divisible subsemigroup [2]. Consequently, a finite semigroup is divisible if and only if it is an idempotent semigroup. However, it is of some interest to know which finite semigroups are k-divisible for a given positive integerk≥2. In this note we present a complete characterization of finitek-divisible semigroups, and use this along with a result of K. Numakura [8], to characterize compact totally disconnected k-divisible semigroups     

Gauss laws in the sense of Bernstein and uniqueness of embedding into convolution semigroups on quantum groups and braided groups

The aim of this note is to characterize certain probability laws on a class of quantum groups or braided groups that will be called nilpotent. First, we introduce a braided analogue of the Heisenberg-Weyl group, which shall serve as a standard example. We determine functional on the braided line and on this group satisfying an analogue of the Bernstein property (see [3]). i.e. that the sum and difference of independent Gaussian random variables are also independent. We also study continuous convolution semigroups on nilpotent quantum groups and braided groups. We extend to nilpotent quantum groups and braided groups recent results proving the uniqueness of the embedding of an infinitely divisible probability law in a continuous convolution semigroup for simply connected nilpotent Lie groups.     

Varieties generated by unstable involution semigroups with continuum many subvarieties

Over the years, several finite semigroups have been found to generate varieties with continuum many subvarieties. However, finite involution semigroups that generate varieties with continuum many subvarieties seem much rarer; in fact, only one example—an inverse semigroup of order 165—has so far been published. Nevertheless, it is shown in the present article that there are many smaller examples among involution semigroups that are unstable in the sense that the varieties they generate contain some involution semilattice with nontrivial unary operation. The most prominent examples are the unstable finite involution semigroups that are inherently non-finitely based, the smallest ones of which are of order six. It follows that the join of two finitely generated varieties of involution semigroups with finitely many subvarieties can contain continuum many subvarieties.     

Chapter 1. Extension of the fundamental theorem of finite semigroups

This paper proves that some useful commutivity relations exist among semigroup wreath product factors that are either groups or combinatorial “units” U₁, U₂, or U₃. Using these results it then obtains some characterizations of each of the classes of semigroups buildable from U₁'s, U₂'s, and groups (“buildable” meaning “dividing a wreath product of”).We show that up to division U₁'s can be moved to the right and U₂'s, and groups to the left over other units and groups, if it is allowed that the factors involved be replaced by their direct products, or in the case of U₂, even by a wreath product. From this it is deduced that U₁'s and U₂'s do not affect group complexity, that any semigroup buildable from U₁'s, U₂'s, and groups has group complexity 0 or 1, and that all such semigroups can be represented, up to division, in a canonical form—namely, as a wreath product with all U₁'s on the right, all U₂'s on the left, and a group in the middle. This last fact is handy for developing charactérizations.An embedding theorem for semigroups with a unique 0-minimal ideal is introduced, and from this and the commutivity results and some constructions proved for RLM semigroups, there is obtained an algebraic characterization for each class of semigroups that is a wreath product-division closure of some combination of U₁'s, U₂'s, and the groups. In addition it is shown, for i = 1,2,3, that if the unit U_i does not divide a semigroup S, then S can be built using only groups and units not containing U_i. Thus, it can be deduced that any semigroup which does not contain U₃ must have group complexity either 0 or 1. This then establishes that indeed U₃ is the determinant of group complexity, since it is already proved that both U₁ and U₂ are transparent with regard to the group complexity function, and it is known that with U₃ (and groups) one can build semigroups with complexities arbitrarily large. Another conclusion is a combinatorial counterpart for the Krohn-Rhodes prime decomposition theorem, saying that any semigroups can be built from the set of units which divide it together with the set of those semigroups not having unit divisors. Further, one can now characterize those semigroups which commute over groups, showing a semigroup commutes to the left over groups iff it is “R₁” (i.e., does not contain U₁, i.e., is buildable form U₂'s and groups), and commutes to the right over groups iff it does not contain U₂ (i.e., is buildable from groups and U₁'s). Finally, from the characterizations and their proofs one sees some ways in which groups can do the work of combinatorials in building combinatorial semigroups.     

Decidability of complexity one-half for finite semigroups

Resume All semigroups considered are finite. The semigroup C is by definition combinatorial (or group free or aperiodic) iff the maximal subgroups of C are singletons. Let S₂oS₁ denote the wreath product of S₁ by S₂, so P₁: S₂oS₁ → S₁ with P₁ the projection surmorphism. S<T, read S divides T, iff S is a homomorphic image of a subsemigroup of T. In this paper we give necessary and sufficient conditions in terms of a homomorphic image of S (resp. a subsemigroup of S) so that S<GoC (resp. S<CoG), with C a combinatorial semigroup and G a group. This requires an earlier results by Bret Tilson and John Rhodes in [8]. This research was partially supported by a grant from the National Science Foundation.     

Inverse semigroups determined by their lattices of convex inverse subsemigroups I

Every inverse semigroup possesses a natural partial order and therefore convexity with respect to this order is of interest. We study the extent to which an inverse semigroup is determined by its lattice of convex inverse subsemigroups; that is, if the lattices of two inverse semigroups are isomorphic, how are the semigroups related? We solve this problem completely for semilattices and for inverse semigroups in general reduce it to the case where the lattice isomorphism induces an isomorphism between the semilattices of idempotents of the semigroups. For many inverse semigroups, such as the monogenic ones, this case is the only one that can occur. In Part II, a study of the reduced case enables us to prove that many inverse semigroups, such as the free ones, are strictly determined by their lattices of convex inverse subsemigroups, and to show that the answer obtained here for semilattices can be extended to a broad class of inverse semigroups, including all finite, aperiodic ones. Received September 24, 2002; accepted in final form December 15, 2002.     

The kernel of the wreath product of semigroups

All wreath products, in the general sense, of two semigroups with completely simple kernels have completely simple kernels. Presented here are computational characterizations of the primitive idempotents of such a wreath and of the identities and inverses in subgroups of its kernel. Research sponsored by the Air Force Office of Scientific Research, Office of Aerospace Research, United States Air Force, under Grant AF AFOSR 924-67.