Vítor Hugo Fernandes

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 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 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 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 determine their ranks. We also describe their Green's relations, calculate their cardinalities and study their regularity.

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

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