Comparing Semigroup and Monoid Presentations for Finite Monoids

 It is known that for any finite group G given by a finite group presentation there exists a finite semigroup presentation for G of the same deficiency, i.e. satisfying . It is also known that the analogous statement does not hold for all finite monoids. In this paper we give a necessary and sufficient condition for a finite monoid M, given by a finite monoid presentation, to have a finite semigroup presentation of the same deficiency. (Received 17 April 2001; in revised form 15 September 2001)     

On Finite Complete Presentations and Exact Decompositions of Semigroups

We prove that given a finite (zero) exact right decomposition (M, T) of a semigroup S, if M is defined by a finite complete presentation, then S is also defined by a finite complete presentation. Exact right decompositions are natural generalizations to semigroups of coset decompositions in groups. As a consequence, we deduce that any Zappa–Szép extension of a monoid defined by a finite complete presentation, by a finite monoid, is also defined by such a presentation.

It is also proved that a semigroup M ⁰[A; I, J; P], where A and P satisfy some very general conditions, is also defined by a finite complete presentation.     

On Semigroup Presentations and Efficiency

The purpose of this paper is twofold. First we determine some forms of the relations in a finite semigroup presentation with zero deficiency which does or does not define a group. Moreover, we conclude that a finite Rees matrix semigroup M [G; I, Λ; P] is efficient when G is efficient and the index sets I, Λ are finite.     

Endomorphism monoids and topological subgraphs of graphs

We prove, that, given a finite graph Y there exists a finite monoid (semigroup with unity) M such that any graph X whose endomorphism monoid is isomorphic to M contains a subdivision of Y. This contrasts with several known results on the simultaneous prescribability of the endomorphism monoid and various graph theoretical properties of a graph. It is also related to the analogous problems on graphs having a given permutation group as a restriction of their automorphism group to an invariant subset.     

Every finite semigroup is embeddable in a finite relatively free semigroup

The title result is proved by a Murskii-type embedding.Results on some related questions are also obtained. For instance, it is shown that every finitely generated semigroup satisfying an identity ξ^d=ξ^2d is embeddable in a relatively free semigroup satisfying such an identity, generally with a larger d; but that an uncountable semigroup may satisfy such an identity without being embeddable in any relatively free semigroup.It follows from known results that every finite group is embeddable in a finite relatively free group. It is deduced from this and the proof of the title result that a finite monoid S is embeddable by a monoid homomorphism in a finite (or arbitrary) relatively free monoid if and only if its group of invertible elements is either {e} or all of S.     

On semigroup presentations and efficiency

The purpose of this paper is twofold. First we determine some forms of the relations in a finite semigroup presentation with zero deficiency which does or does not define a group. Moreover, we conclude that a finite Rees matrix semigroup M [G; I, Λ; P] is efficient when G is efficient and the index sets I, Λ are finite.     

Periodic Endomorphisms of Polycyclic Groups

Let G be a polycyclic group. As a consequence of known results, any periodic group of automorphisms of G is finite and there is an upper bound (depending only on G) for its order. On the other hand, a periodic semigroup of endomorphisms of G need not be finite but we prove that it is locally finite. Also we show that the order of periodic endomorphisms of G is bounded.     

Membership of A ∨ G for classes of finite weakly abundant semigroups

We consider the question of membership of A ∨ G, where A and G are the pseudovarieties of finite aperiodic semigroups, and finite groups, respectively. We find a straightforward criterion for a semigroup S lying in a class of finite semigroups that are weakly abundant, to be in A ∨ G. The class of weakly abundant semigroups contains the class of regular semigroups, but is much more extensive; we remark that any finite monoid with semilattice of idempotents is weakly abundant. To study such semigroups we develop a number of techniques that may be of interest in their own right.     

Howson's Property for Semidirect Products of Semilattices by Groups

An inverse semigroup S is a Howson inverse semigroup if the intersection of finitely generated inverse subsemigroups of S is finitely generated. Given a locally finite action θ of a group G on a semilattice E, it is proved that E*_θG is a Howson inverse semigroup if and only if G is a Howson group. It is also shown that this equivalence fails for arbitrary actions.     

Structure of Quantum Doubles of Finite Clifford Monoids

Abstract

In this paper, over a field k, we give the structure theorem of the quantum double of a finite Clifford monoid through bicrossed products and quantum doubles of groups. By this result, it is shown that the quantum double of a finite Clifford monoid is semisimple (resp. von Neumann regular) if and only if the semigroup is a finite group and the characteristic p of k does not divide the order of this group.     

Fundamental groups,inverse schützenberger automata,and monoid presentations

This paper gives decidable conditions for when a finitely generated subgroup of a free group is the fundamental group of a Schützenberger automaton corresponding to a monoid presentation of an inverse monoid. Also, generalizations are given to specific types of inverse monoids as well as to monoids which are "nearly inverse." This result has applications to computing membership for inverse monoids in a Mal'cev product of the pseudovariety of semilattices with a pseudovariety of groups.

This paper also shows that there is a bijection between strongly connected inverse automata and subgroups of a free group, generated by positive words. Hence, we also obtain that it is decidable whether a finite strongly connected inverse automaton is a Schützenberger automaton corresponding to a monoid presentation of an inverse monoid. Again, we have generalizations to other types of inverse monoids and to "nearly inverse" monoids. We show that it is undecidable whether a finite strongly connected inverse automaton is a Schützenberger automaton of a monoid presentation of anE-unitary inverse monoid.     

On F-inverse covers of inverse monoids

It is shown that each finite inverse monoid admits a finite F-inverse cover if and only if the same is true for each finite combinatorial strict inverse semigroup with an identity adjoined if and only if the same is true for the Margolis-Meakin expansion M(H) of each finite elementary abelian p-group H for some prime p. Additional equivalent conditions are given in terms of the existence of locally finite varieties of groups having certain properties. Ultimately, the problem of whether each finite inverse monoid admits a finite F-inverse cover, is reduced to a question concerning the Kostrikin-Zelmanov varieties K_n of all locally finite groups of exponent dividing n.     

Endomorphisms of relatively free algebras with weak exchange properties

The structure of the endomorphism monoid of a stable basis algebra A is described. It is shown to be an abundant monoid; the subsemigroup of endomorphisms of finite rank has a regular semigroup of left quotients.     

Finite groups are big as semigroups

We prove that a finite group G occurs as a maximal proper subsemigroup of an infinite semigroup (in the terminology of Freese, Ježek, and Nation, G is a big semigroup) if and only if |G| ≥ 3. In fact, any finite semigroup whose minimal ideal contains a subgroup with at least three elements is big.     

On Identity Bases of Exclusion Varieties for Monoids

An exclusion variety is a variety that is maximal with respect to not containing some semigroup. It is shown that if the bases of all exclusion varieties for some periodic semigroup S are known, then the bases of exclusion varieties for the monoid S ¹ can be computed.     

Semigroup Rings as Weakly Factorial Domains

Let D be an integral domain, Γ be a torsion-free grading monoid with quotient group G, and D[Γ] be the semigroup ring of Γ over D. We show that if G is of type (0, 0, 0,…), then D[Γ] is a weakly factorial domain if and only if D is a weakly factorial GCD-domain and Γ is a weakly factorial GCD-semigroup. Let ? be the field of real numbers and Γ be the additive semigroup of nonnegative rational numbers. We also show that Γ is a weakly factorial GCD-semigroup, but ?[Γ] is not a weakly factorial domain.     

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.     

Structure of a finite commutative inverse semigroup and a finite bundle for which the inverse monoid of local automorphisms is permutable

For a semigroup S, the set of all isomorphisms between the subsemigroups of the semigroup S with respect to composition is an inverse monoid denoted by PA(S) and called the monoid of local automorphisms of the semigroup S. The semigroup S is called permutable if, for any couple of congruences ρ and σ on S, we have ρ ∘ σ = σ ∘ ρ. We describe the structures of a finite commutative inverse semigroup and a finite bundle whose monoids of local automorphisms are permutable.     

Finite basis problem for 2-testable monoids

A monoid S ¹ obtained by adjoining a unit element to a 2-testable semigroup S is said to be 2-testable. It is shown that a 2-testable monoid S ¹ is either inherently non-finitely based or hereditarily finitely based, depending on whether or not the variety generated by the semigroup S contains the Brandt semigroup of order five. Consequently, it is decidable in quadratic time if a finite 2-testable monoid is finitely based.