Vítor Hugo Fernandes

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.

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.

Let $X_n$ be a chain with n elements ($n\in\N$) and let $\OP_n$ be the monoid of all orientation-preserving transformations of $X_n$. In this paper, for any nonempty subset $Y$ of $X_n$, we consider the subsemigroup $\OP_n(Y)$ of $\OP_n$ of all transformations with range contained in $Y$: we describe the largest regular subsemigroup of $\OP_n(Y)$, which actually coincides with its subset of all regular elements, and Green's relations on $\OP_n(Y)$. Also, we determine when two semigroups of the type $\OP_n(Y)$ are isomorphic and calculate their ranks. Moreover, a parallel study is presented for the correspondent subsemigroups of the monoid $\OR_n$ of all either orientation-preserving or orientation-reversing transformations of $X_n$.

In this note, we aim to correct some of the results presented in [1]. Namely, the statements of Proposition 2.1, Corollary 2.2, Corollary 2.3, Theorem 2.4 and Theorem 2.6, concerning only the monoids OP_n and POP_n, have to exclude transformations of rank two. All other results of [1], as well as those mentioned above but for the monoids OR_n and POR_n, do not require correction.

[1] V.H. Fernandes, Oriented transformations on a finite chain: another description, Commun. Korean Math. Soc. 38 (2023), 725-731.

Summary: In this paper we consider the monoid $\mathcal {OR}_{n}$ of all full transformations on a chain with $n$ elements that preserve or reverse the orientation, as well as its submonoids $\mathcal {OD}_{n}$ of all order-preserving or order-reversing elements, $\mathcal {OP}_{n}$ of all orientation-preserving elements and $\mathcal {O}_{n}$ of all order-preserving elements. By making use of some well known presentations, we show that each of these four monoids is a quotient of a bilateral semidirect product of two of its remarkable submonoids.

In this paper we consider the monoid DPC_n of all partial isometries of a n-cycle graph C_n. We show that DPC_n is the submonoid of the monoid of all oriented partial permutations on a n-chain whose elements are precisely all restrictions of a dihedral group of order 2n. Our main aim is to exhibit a presentation of DPC_n. We also describe Green's relations of DPC_n and calculate its cardinality and rank.

In this paper we consider the monoid DPSn of all partial isometries of a star graph Sn with n vertices. Our main objectives are to determine the rank and to exhibit a presentation of DPSn. We also describe Green’s relations of DPSn and calculate its cardinal.

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 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 note we give a presentation for the monoid IO_n of all order-preserving transformations of a n-chain whose ranges are intervals. We also consider the submonoid IO_n^- of IO_n consisting of order-decreasing transformations, for which we determine the cardinality, the rank and a presentation.

In this paper we study the cyclic inverse monoid CI_n on a set Ω_n with n elements, i.e. the inverse submonoid of the symmetric inverse monoid on Ω_n consisting of all restrictions of the elements of a cyclic subgroup of order n acting cyclically on Ω_n. We show that CI_n has rank 2 (for n⩾2) and n⋅2^n−n+1 elements. Moreover, we give presentations of CI_n on n+1 generators and (n^2+3n+4)/2 relations and on 2 generators and (n^2−n+6)/2 relations. We also consider the remarkable inverse submonoid OCI_n of CI_n constituted by all its order-preserving transformations. We show that OCI_n has rank n and 3⋅2^n−2n−1 elements. Furthermore, we exhibit presentations of OCI_n on n+2 generators and (n^2+3n+8)/2 relations and on n generators and (n^2+3n)/2 relations.

In this paper we consider endomorphisms of a finite directed path from monoid generators perspective. Our main aim is to determine the rank of the monoid wEndP_n of all weak endomorphisms of a directed path with n vertices, which is a submonoid of the widely studied monoid O_n of all order-preserving transformations of a n-chain. Also, we describe the regular elements of wEndP_n and calculate its size and number of idempotents.