The monoid of all orientation-preserving and extensive full transformations on a finite chain

Let [Formula: see text] be the monoid of all orientation-preserving and extensive full transformations on [Formula: see text] ordered in the standard way. In this paper, we determine the minimum generating set and the minimum idempotent generating set of [Formula: see text], and so the rank and the idempotent rank of [Formula: see text] are obtained. Moreover, we describe maximal subsemigroups and maximal idempotent generated subsemigroups of [Formula: see text] and completely obtain their classifications.

Twisted Brauer monoids

We investigate the structure of the twisted Brauer monoid , comparing and contrasting it with the structure of the (untwisted) Brauer monoid . We characterize Green's relations and pre-orders on , describe the lattice of ideals and give necessary and sufficient conditions for an ideal to be idempotent generated. We obtain formulae for the rank (smallest size of a generating set) and (where applicable) the idempotent rank (smallest size of an idempotent generating set) of each principal ideal; in particular, when an ideal is idempotent generated, its rank and idempotent rank are equal. As an application of our results, we describe the idempotent generated subsemigroup of (which is not an ideal), as well as the singular ideal of (which is neither principal nor idempotent generated), and we deduce that the singular part of the Brauer monoid is idempotent generated, a result previously proved by Maltcev and Mazorchuk.

On the ranks of the semigroup of A-decreasing finite transformations

For [Formula: see text], let [Formula: see text] be the semigroup of all singular mappings on [Formula: see text]. For each nonempty subset [Formula: see text] of [Formula: see text], let [Formula: see text] be the semigroup of all [Formula: see text]-decreasing mappings on [Formula: see text]. In this paper we determine the rank and idempotent rank of the semigroup [Formula: see text].

THE REGULAR PART OF A SEMIGROUP OF LINEAR TRANSFORMATIONS WITH RESTRICTED RANGE

Let$V$be a vector space and let$T(V)$denote the semigroup (under composition) of all linear transformations from$V$into$V$. For a fixed subspace$W$of$V$, let$T(V,W)$be the semigroup consisting of all linear transformations from$V$into$W$. In 2008, Sullivan [‘Semigroups of linear transformations with restricted range’,Bull. Aust. Math. Soc.77(3) (2008), 441–453] proved that$$\begin{eqnarray}\displaystyle Q=\{\unicode[STIX]{x1D6FC}\in T(V,W):V\unicode[STIX]{x1D6FC}\subseteq W\unicode[STIX]{x1D6FC}\} & & \displaystyle \nonumber\end{eqnarray}$$is the largest regular subsemigroup of$T(V,W)$and characterized Green’s relations on$T(V,W)$. In this paper, we determine all the maximal regular subsemigroups of$Q$when$W$is a finite-dimensional subspace of$V$over a finite field. Moreover, we compute the rank and idempotent rank of$Q$when$W$is an$n$-dimensional subspace of an$m$-dimensional vector space$V$over a finite field$F$.

On the semigroups of order-preserving transformations generated by idempotents of rank n −1

Let [Formula: see text] be the semigroup of all singular order-preserving mappings on the finite set [Formula: see text]. It is known that [Formula: see text] is generated by its set of idempotents of rank [Formula: see text], and its rank and idempotent rank are [Formula: see text] and [Formula: see text], respectively. In this paper, we study the structure of the semigroup generated by any nonempty subset of idempotents of rank [Formula: see text] in [Formula: see text]. We also calculate its rank and idempotent rank.

The (p,q)-potent ranks of certain semigroups of transformations

Let [Formula: see text] and [Formula: see text] be the partial transformation and the strictly partial transformation semigroups on the finite set [Formula: see text]. It is well known that the ranks of the semigroups [Formula: see text] and [Formula: see text] are [Formula: see text], for [Formula: see text], and [Formula: see text], for [Formula: see text], respectively. The idempotent rank, defined as the smallest number of idempotents generating set, of the semigroup [Formula: see text] has the same value as the rank. Idempotent can be seen as a special case (with [Formula: see text]) of [Formula: see text]-potent. In this paper, we determine the [Formula: see text]-potent ranks, defined as the smallest number of [Formula: see text]-potents generating set, of the semigroups [Formula: see text], for [Formula: see text], and [Formula: see text], for [Formula: see text].

Variants of finite full transformation semigroups

The variant of a semigroup [Formula: see text] with respect to an element [Formula: see text], denoted [Formula: see text], is the semigroup with underlying set [Formula: see text] and operation ⋆ defined by [Formula: see text] for [Formula: see text]. In this paper, we study variants [Formula: see text] of the full transformation semigroup [Formula: see text] on a finite set [Formula: see text]. We explore the structure of [Formula: see text] as well as its subsemigroups [Formula: see text] (consisting of all regular elements) and [Formula: see text] (consisting of all products of idempotents), and the ideals of [Formula: see text]. Among other results, we calculate the rank and idempotent rank (if applicable) of each semigroup, and (where possible) the number of (idempotent) generating sets of the minimal possible size.

IDEMPOTENT RANK IN THE ENDOMORPHISM MONOID OF A NONUNIFORM PARTITION

We calculate the rank and idempotent rank of the semigroup ${\mathcal{E}}(X,{\mathcal{P}})$ generated by the idempotents of the semigroup ${\mathcal{T}}(X,{\mathcal{P}})$ which consists of all transformations of the finite set $X$ preserving a nonuniform partition ${\mathcal{P}}$. We also classify and enumerate the idempotent generating sets of minimal possible size. This extends results of the first two authors in the uniform case.

On the Semigroups of Order-preserving and A-Decreasing Finite Transformations

For n ∈ ℕ, let On be the semigroup of all singular order-preserving mappings on [n]= {1,2,…,n}. For each nonempty subset A of [n], let On(A) = {α ∈ On: (∀ k ∈A) kα ≤ k} be the semigroup of all order-preserving and A-decreasing mappings on [n]. In this paper it is shown that On(A) is an abundant semigroup with n-1𝒟*-classes. Moreover, On(A) is idempotent-generated and its idempotent rank is 2n-2- |A\ {n}|. Further, it is shown that the rank of On(A) is equal to n-1 if 1 ∈ A, and it is equal to n otherwise.