Vítor Hugo Fernandes

In this paper we consider three submonoids of the dihedral inverse monoid DI_n, namely its submonoids OPDI_n, MDI_n and ODI_n of all orientation-preserving, monotone and order-preserving transformations, respectively. For each of these three monoids, we compute the cardinal, give descriptions of Green's relations and determine the rank.

Following the new description of an oriented full transformation on a finite chain given recently by Higgins and Vernitsk,
in this short note we present a refinement of this description which is extendable to partial transformations and to injective partial transformations.

In this paper, we study partial automorphisms and, more generally, injective partial endomorphisms of a finite undirected path from Semigroup Theory perspective. Our main objective is to give formulas for the ranks of the monoids IEnd(P_n) and PAut(P_n) of all injective partial endomorphisms and of all partial automorphisms of the undirected path P_n with n vertices. We also describe Green's relations of PAut(P_n) and IEnd(P_n) and calculate their cardinals.

The objective of this paper is to study the monoid of all partial
transformations of a finite set that preserve a uniform partition. In addition
to proving that this monoid is a quotient of a wreath product with respect to a
congruence relation, we show that it is generated by 5 generators, we compute
its order and determine a presentation on a minimal generating set.

In this paper, we consider the monoids of all endomorphisms, of all weak endomorphisms, of all strong endomorphisms and of all strong weak endomorphisms of a star graph with a finite number of vertices. Our main objective is to exhibit a presentation for each of them.

In this paper we give presentations for the monoid $\DP_n$ of all partial isometries on $\{1,\ldots,n\}$ and for its submonoid $\ODP_n$ of all order-preserving partial isometries.

In this paper, we consider the monoids of all partial endomorphisms, of all partial weak endomorphisms, of all injective partial endomorphisms, of all partial strong endomorphisms and of all partial strong weak endomorphisms of a star graph with a finite number of vertices. Our main objective is to exhibit a presentation for each of them.

In this paper we consider the submonoids OPDI_n, MDI_n and ODI_n of the dihedral inverse monoid DI_n of all orientation-preserving, monotone and order-preserving transformations, respectively. Our goal is to exhibit presentations for each of these three monoids.

A zig-zag (or fence) order is a special partial order on a (finite) set. In this paper, we consider the semigroup $TF_{n}$ of all
order-preserving transformations on an $n$-element zig-zag ordered set. We determine the rank of $TF_{n}$ and provide a minimal generating set for $TF_{n}$. Moreover, a formula for the number of idempotents in $TF_{n}$ is given.

In this paper we compute the rank and exhibit a presentation for the monoids
of all $P$-stable and $P$-order preserving partial permutations on a finite set
$\Omega$, with $P$ an ordered uniform partition of $\Omega$. These (inverse)
semigroups constitute a natural class of generators of the pseudovariety of
inverse semigroups ${\sf NO}$ of all normally ordered (finite) inverse
semigroups.

In this paper we consider various classes of monoids of transformations of a finite chain,
including those of transformations that preserve or reverse either the order or the orientation.
In line with Howie and McFadden (1990),
we complete the study of the ranks (and of idempotent ranks, when applicable) of all their ideals.

In this paper we study the widely considered endomorphisms and weak endomorphisms of a finite undirected path from monoid generators perspective. Our main aim is to determine the ranks of the monoids $wEnd P_n$ and $End P_n$ of all weak endomorphisms and all endomorphisms of the undirected path $P_n$ with $n$ vertices. We also consider strong and strong weak endomorphisms of $P_n$.

We introduce a class of finite semigroups obtained by considering Rees
quotients of numerical semigroups.
Several natural questions concerning this class, as well as particular
subclasses obtained by considering some special ideals, are answered while
others remain open. We exhibit nice presentations for these semigroups and
prove that the Rees quotients by ideals of N, the positive integers under
addition, constitute a set of generators for the pseudovariety of commutative
and nilpotent semigroups.

The notion of the Abelian kernel of a finite monoid is a generalization of that of the derived subgroup of a finite group. A monoid $M$ is then called solvable if its chain of Abelian kernels terminates with the submonoid of $M$ generated by its idempotents. The main result of this paper is that the finite idempotent commuting monoids bearing this property are precisely those whose subgroups are solvable. In particular any finite aperiodic monoid is Abelian-solvable in this sense. A generalization of the main result of this paper has been published [in Int. J. Algebra Comput. 14, No. 5-6, 655-665 (2004; Zbl 1081.20067)] by the authors and ıt S. Margolis and ıt B. Steinberg.

In this short note we construct an extension of the Vagner-Preston representation for block-groups and show that its kernel is the largest congruence that separates regular elements.