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 chief factors of parabolic maximal subgroups of the group <Superscript>2</Superscript><Emphasis Type="Italic">E</Emphasis><Subscript>6</Subscript>(<Emphasis Type="Italic">q</Emphasis><Superscript>2</Superscript>)

We consider the pseudovariety generated by all finite monoids on which Green’s relations R and H coincide. We find a new algorithm that determines if a given finite monoid belongs to this pseudovariety.     

The structure of finite monoids satisfying the relation ℛ = ℋ

It is shown that any finite monoid S on which Green’s relations R and H coincide divides the monoid of all upper triangular row-monomial matrices over a finite group. The proof is constructive; given the monoid S, the corresponding group and the order of matrices can be effectively found. The obtained result is used to identify the pseudovariety generated by all finite monoids satisfying R = H with the semidirect product of the pseudovariety of all finite groups and the pseudovariety of all finite R-trivial monoids.     

On the hyperdecidability of semidirect products of pseudovarieties

The notion of hyperdecidability has been introduced as a tool which is particularly suited for granting decidability of semidirect products. It is shown in this paper that the semidirect product of an hyperdecidable pseudovariety with a pseudovariety whose finitely generated free objects are finite and effectively computable is again hyperdecidable. As instances of this result, one obtains, for example, the hyperdecidability of the pseudovarieties of ail finite completely simple semigroups and of all finite bands of left groups.     

Normally Ordered Inverse Semigroups

NO of all normally ordered inverse semigroups. We show that the pseudovariety of inverse semigroups PCS generated by all semigroups of injective and order partial transformations on a finite chain consists of all aperiodic elements of NO . Also, we prove that NO is the join pseudovariety of inverse semigroups. PCS V G , where G is the pseudovariety of all finite groups.     

Semigroups of order preserving mappings on a finite chain: A new class of divisors

In this paper we aim to prove that every semigroup of the pseudovariety generated by all semigroups of partial, injective and order preserving transformations on a finite chain belongs to the pseudovariety generated by all semigroups of order preserving mappings on a finite chain. This research was done within the project SAL (JNICT, PBIC/C/CEN/1021/92), and the activities of the “Centro de álgebra da Universidade de Lisboa”.     

Irreducibility of certain pseudovarieties 1

We prove that the pseudovarieties of all finite semigroups, and of all aperiodic finii e semigroups are irreducible for join, for semidirect product and for Mal’cev product. In particular, these pseudovarieties do not admit maximal proper subpseudovarieties. More generally, analogous results are proved for the pseudovariety of all finite semigroups all of whose subgroups are in a fixed pseudovariety of groups H, provided th.it H is closed under semidirect product.     

On free spectra of finite monoids from the pseudovariety DA

The pseudovariety DA consists of all aperiodic finite monoids all of whose regular -classes are subsemigroups (that is, rectangular subbands); this pseudovariety appears quite frequently in various contexts in finite semigroup theory. In this note we prove that all its members have a log-polynomial free spectrum, thereby making a new step towards proving the Seif conjecture on the dichotomy of free spectra of finite monoids.     

An algebraic proof that pseudovarieties are defined by pseudoidentities

An algebraic proof is given which shows that any pseudovariety of finite algebras is determined by a set of pseudoidentities.Presented by Boris M. Schein.     

E-local pseudovarieties

Generalizing a property of the pseudovariety of all aperiodic semigroups observed by Tilson, we call E -local a pseudovariety V which satisfies the following property: for a finite semigroup, the subsemigroup generated by its idempotents belongs to V if and only if so do the subsemigroups generated by the idempotents in each of its regular $\mathcal{D}$ -classes. In this paper, we present several sufficient or necessary conditions for a pseudovariety to be E-local or for a pseudoidentity to define an E-local pseudovariety. We also determine several examples of the smallest E-local pseudovariety containing a given pseudovariety.     

On lattices embeddable into subsemigroup lattices. V. Trees

We prove that the class of finite lattices embeddable into the subsemilattice lattices of semilattices which are (n-ary) trees can be axiomatized by identities within the class of finite lattices, whence it forms a pseudovariety.     

Reducibility of pointlike problems

We show that the pointlike and the idempotent pointlike problems are reducible with respect to natural signatures in the following cases: the pseudovariety of all finite semigroups in which the order of every subgroup is a product of elements of a fixed set \(\pi \) of primes; the pseudovariety of all finite semigroups in which every regular \(\mathcal J\)-class is the product of a rectangular band by a group from a fixed pseudovariety of groups that is reducible for the pointlike problem, respectively graph reducible. Allowing only trivial groups, we obtain \(\omega \)-reducibility of the pointlike and idempotent pointlike problems, respectively for the pseudovarieties of all finite aperiodic semigroups (\(\mathsf{A}\)) and of all finite semigroups in which all regular elements are idempotents (\(\mathsf{DA}\)).     

Abelian Kernels of Some Monoids of Injective Partial Transformations and an Application

In this paper we compute the abelian kernels of the monoids POI_n and POPI_n of all injective order preserving and respectively, orientation preserving, partial transformations on a chain with n elements. As an application, we show that the pseudovariety POPI generated by the monoids POPI_n (n epsilon N) is not contained in the Mal'cev product of the pseudovariety POI generated by the monoids POI_n (n epsilon N) with the pseudovariety Ab of all finite abelian groups.     

Power Exponents of Aperiodic Pseudovarieties

n such that the iterated power P ⁿV is the pseudovariety of all finite semigroups.     

A note on the power semigroup of a completely simple semigroup

We prove the pseudovariety generated by power semigroups of completely simple semigroups is the semidirect product of the pseudovariety of block groups with the pseudovariety of right zero semigroups, and hence is decidable. This answers a question of Almeida from over 15 years ago. The author was supported in part by NSERC.     

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.     

Small inherently nonfinitely based finite semigroups

We show how to construct all ``forbidden divisors' for the pseudovariety of not inherently nonfinitely based finite semigroups. Several other results concerning finite semigroups that generate an inherently nonfinitely based variety that is miminal amongst those generated by finite semigroups are obtained along the way. For example, aside from the variety generated by the well known six element Brandt monoid \tb , a variety of this type is necessarily generated by a semigroup with at least 56 elements (all such semigroups with 56 elements are described by the main result). September 23, 1999     

Filters in (Quasiordered) Semigroups and Lattices of Filters

A filter in a semigroup is a subsemigroup whose complement is an ideal. (Alternatively, in a quasiordered semigroup, a slightly more general definition can be given.) We prove a number of results related to filters in a semigroup and the lattice of filters of a semigroup. For instance, we prove that every complete algebraic lattice can be the lattice of filters of a semigroup. We prove that every finite semigroup is a homomorphic image of a finite semigroup whose lattice of filters is boolean and which belongs to the pseudovariety generated by the original semigroup. We describe filter lattices of some well-known semigroups such as full transformation semigroups of finite sets (which are three-element chains) and free semigroups (which are boolean).