Vítor Hugo Fernandes

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.

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.

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 paper we consider endomorphisms of an undirected cycle graph from Semigroup Theory perspective. Our main aim is to present a process to determine sets of generators with minimal cardinality for the monoids $wEnd(C_n)$ and $End(C_n)$ of all weak endomorphisms and all endomorphisms of an undirected
cycle graph $C_n$ with $n$ vertices. We also describe Green's relations and regularity of these monoids and calculate their cardinalities.

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.

In this note, we consider the semigroup $O(X)$ of all order endomorphisms of an infinite chain $X$ and the subset $J$ of $O(X)$ of all transformations $\alpha$ such that $|Im(\alpha)|=|X|$. For an infinite countable chain $X$, we give a necessary and sufficient condition on $X$ for $O(X) = < J >$ to hold. We also present a sufficient condition on $X$ for $O(X) = < J >$ to hold, for an arbitrary infinite chain $X$.

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.

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.

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$.

In this paper we characterize the monoids of endomorphisms of the semigroups PO_n and POI_n of all order-preserving partial transformations and of all order-preserving partial permutations, respectively, of a finite n-chain.

In this note we consider the monoid $PODI_n$ of all monotone partial permutations on $\{1,\ldots,n\}$ and its submonoids $DP_n$, $POI_n$ and $ODP_n$ of all partial isometries, of all order-preserving partial permutations and of all order-preserving partial isometries, respectively. We prove that both the monoids $POI_n$ and $ODP_n$ are quotients of bilateral semidirect products of two of their remarkable submonoids, namely of extensive and of co-extensive transformations. Moreover, we show that $PODI_n$ is a quotient of a semidirect product of $POI_n$ and the group $\mathcal{C}_2$ of order two and, analogously, $DP_n$ is a quotient of a semidirect product of $ODP_n$ and $\mathcal{C}_2$.