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.     

On <Emphasis Type="Italic">U</Emphasis>-orthodox semigroups

As a generalization of an orthodox semigroup in the class of regular semigroups, a type W semigroup was first investigated by El-Qallali and Fountain. As an analogy of the type W semigroups in the class of abundant semigroups, we introduce the U-orthodox semigroups. It is shown that the maximum congruence μ contained in on U-orthodox semigroups can be determined. As a consequence, we show that a U-orthodox semigroup S can be expressed by the spined product of a Hall semigroup W _U and a V-ample semigroup (T,V). This theorem not only generalizes a known result of Hall-Yamada for orthodox semigroups but also generalizes another known result of El-Qallali and Fountain for type W semigroups. This work was supported by National Natural Science Foundation of China (Grant No. 10671151) and Natural Science Foundation of Shaanxi Province (Grant No. SJ08A06), and partially by UGC (HK) (Grant No. 2160123)     

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.     

Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances

Let Ω^Ω be the semigroup of all mappings of a countably infinite set Ω. If U and V are subsemigroups of Ω^Ω, then we write U≈V if there exists a finite subset F of Ω^Ω such that the subsemigroup generated by U and F equals that generated by V and F. The relative rank of U in Ω^Ω is the least cardinality of a subset A of Ω^Ω such that the union of U and A generates Ω^Ω. In this paper we study the notions of relative rank and the equivalence ≈ for semigroups of endomorphisms of binary relations on Ω.The semigroups of endomorphisms of preorders, bipartite graphs, and tolerances on Ω are shown to lie in two equivalence classes under ≈. Moreover such semigroups have relative rank 0, 1, 2, or d in Ω^Ω where d is the minimum cardinality of a dominating family for N^N. We give examples of preorders, bipartite graphs, and tolerances on Ω where the relative ranks of their endomorphism semigroups in Ω^Ω are 0, 1, 2, and d.We show that the endomorphism semigroups of graphs, in general, fall into at least four classes under ≈ and that there exist graphs where the relative rank of the endomorphism semigroup is 2^ℵ₀.     

The structure of medial weakly U-abundant semigroups

We consider the class of weakly U-abundant semigroups satisfying the congruence condition (C) containing both the class of regular semigroups and the class of abundant semigroups as its subclasses. The class of weakly U-abundant semigroups with a medial projection satisfying the congruence condition (C) will be particularly studied. This kind of semigroups will be called medial weakly U-abundant semigroups. In this paper, we establish a structure theorem for such semigroups. It is proved that every medial weakly U-abundant semigroup can be expressed by some kind of bands and quasi-Ehresmann semigroups. Our theorem generalizes and enriches the structure theorem given by M. Loganathan in 1987 for regular semigroups with a medial idempotent.     

On the decidability of the word problem for amalgamated free products of inverse semigroups

We study inverse semigroup amalgams [S ₁,S ₂;U], where S ₁ and S ₂ are finitely presented inverse semigroups with decidable word problem and U is an inverse semigroup with decidable membership problem in S ₁ and S ₂. We use a modified version of Bennett’s work on the structure of Schützenberger graphs of the ℛ-classes of S ₁* _U S ₂ to state sufficient conditions for the amalgamated free products S ₁* _U S ₂ having decidable word problem.     

A generalization of the first Malcev theorem on nilpotent semigroups and nilpotency of the wreath product of semigroups

We describe all [0-]simple semigroups that are nilpotent in the sense of Malcev. This generalizes the first Malcev theorem on nilpotent (in the sense of Malcev) semigroups. It is proved that if the extended standard wreath product of semigroups is nilpotent in the sense of Malcev and the passive semigroup is not nilpotent, then the active semigroup of the wreath product is a finite nilpotent group. In addition to that, the passive semigroup is uniform periodic. Necessary and sufficient conditions are found under which the extended standard wreath product of semigroups is nilpotent in the sense of Malcev in the case where each of the semigroups of the wreath product generates a variety of finite step.     

On ordered semigroups which are semilattices of left simple semigroups

It has been proved by Tôru Saitô that a semigroup S is a semilattice of left simple semigroups, that is, it is decomposable into left simple semigroups, if and only if the set of left ideals of S is a semilattice under the multiplication of subsets, and that this is equivalent to say that S is left regular and every left ideal of S is two-sided. Besides, S. Lajos has proved that a semigroup S is left regular and the left ideals of S are two-sided if and only if for any two left ideals L ₁, L ₂ of S, we have L ₁ ∩ L ₂ = L ₁ L ₂. The present paper generalizes these results in case of ordered semigroups. Some additional information concerning the semigroups (without order) are also obtained.     

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.     

Semigroups with the Congruence Extension Property

ρT on a semigroup of T of S extends to the semigroup S, if there exists a congruence _ρ on s such that _{ρ|T= ρT}. A semigroup S has the congruence extension property, CEP, if each congruence on each semigroup extends to S. In this paper we characterize the semigroups with CEP by a set of conditions on their structure (by this we answer a problem put forward in [1]). In particular, every such semigroup is a semilattice of nil extensions of rectangular groups.     

On left C-U-liberal semigroups

In this paper the equivalence on a semigroup S in terms of a set U of idempotents in S is defined. A semigroup S is called a U-liberal semigroup with U as the set of projections and denoted by S(U) if every -class in it contains an element in U. A class of U-liberal semigroups is characterized and some special cases are considered.     

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.     

Constructing numerical semigroups of a given genus

Let n _g denote the number of numerical semigroups of genus g. Bras-Amorós conjectured that n _g possesses certain Fibonacci-like properties. Almost all previous attempts at proving this conjecture were based on analyzing the semigroup tree. We offer a new, simpler approach to counting numerical semigroups of a given genus. Our method gives direct constructions of families of numerical semigroups, without referring to the generators or the semigroup tree. In particular, we give an improved asymptotic lower bound for n _g .     

Guarded and Banded Semigroups

The variety of guarded semigroups consists of all (S,·, ˉ) where (S,·) is a semigroup and x ↦ \overline{x} is a unary operation subject to four additional equations relating it to multiplication. The semigroup Pfn(X) of all partial transformations on X is a guarded semigroup if x \overline{f} = x when xf is defined and is undefined otherwise. Every guarded semigroup is a subalgebra of Pfn(X) for some X. A covering theorem of McAlister type is obtained. Free guarded semigroups are constructed paralleling Scheiblich's construction of free inverse semigroups. The variety of banded semigroups has the same signature but different equations. There is a canonical forgetful functor from guarded semigroups to banded semigroups. A semigroup underlies a banded semigroup if and only if it is a split strong semilattice of right zero semigroups. Each banded semigroup S contains a canonical subsemilattice g_⋆(S). For any given semilattice L, a construction to synthesize the general banded semigroup S with g_⋆ ≅ L is obtained.     

Semigroup Properties and the Crandall Liggett Approximation for a Class of Differential Equations with State-Dependent Delays

We present an approach for the resolution of a class of differential equations with state-dependent delays by the theory of strongly continuous nonlinear semigroups. We show that this class determines a strongly continuous semigroup in a closed subset of C^0, 1. We characterize the infinitesimal generator of this semigroup through its domain. Finally, an approximation of the Crandall-Liggett type for the semigroup is obtained in a dense subset of (C, ‖·‖_∞). As far as we know this approach is new in the context of state-dependent delay equations while it is classical in the case of constant delay differential equations.     

Largest subsemigroups of the full transformation monoid

In this paper we are concerned with the following question: for a semigroup S, what is the largest size of a subsemigroup T?S where T has a given property? The semigroups S that we consider are the full transformation semigroups; all mappings from a finite set to itself under composition of mappings. The subsemigroups T that we consider are of one of the following types: left zero, right zero, completely simple, or inverse. Furthermore, we find the largest size of such subsemigroups U where the least rank of an element in U is specified. Numerous examples are given.