Related papers: Endomorphisms of semigroups of oriented transforma…
In this paper, we characterize the monoid of endomorphisms of the semigroup of all monotone full transformations of a finite chain, as well as the monoids of endomorphisms of the semigroup of all monotone partial transformations and of the…
We describe and count the maximal subsemigroups of many well-known monoids of transformations and monoids of partitions. More precisely, we find the maximal subsemigroups of the full spectrum of monoids of order- or orientation-preserving…
We introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner…
We establish new results concerning endomorphisms of a finite chain if the cardinality of the image of such endomorphism is no more than some fixed number. The semiring of all such endomorphisms can be seen as a simplex whose vertices are…
Let $[n]=\{1,\ldots,n\}$ be the $n$-chain. We give presentations for the following transformation semigroups: the semigroup of full order-decreasing mappings of $[n]$, the semigroup of partial one-to-one order-decreasing mappings of $[n]$,…
We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such as the full transformation semigroups, the general linear semigroups, and the semigroups of order-preserving transformations of finite…
We study permutations on n elements preserving orientation (parity) of every subset of size k. We describe all groups of these permutations. Unexpectedly, these groups (except for some special cases) are either trivial, cyclic or dihedral.…
We establish new results concerning endomorphisms of a finite chain if the cardinality of the image of such endomorphism is no more than some fixed number k. The semiring of all such endomorphisms can be seen as a k - simplex whose vertices…
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…
Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…
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 $\wEnd\vec{P}_n$ of all weak endomorphisms of a directed path with $n$ vertices, which…
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…
In this paper, we determine the relative rank of the semigroup OP(X) of all orientation-preserving transformations on infinite chains modulo the semigroup O(X) of all order-preserving transformations.
The left and right diameters of a monoid are topological invariants defined in terms of suprema of lengths of derivation sequences with respect to finite generating sets for the universal left or right congruences. We compute these…
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…
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…
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…
Let $X$ be a finite or infinite chain and let $O(X)$ be the monoid of all endomorphisms of $X$. In this paper, we describe the largest regular subsemigroup of $O(X)$ and Green's relations on $O(X)$. In fact, more generally, if $Y$ is a…
A partial automorphism of a finite graph is an isomorphism between its vertex induced subgraphs. The set of all partial automorphisms of a given finite graph forms an inverse monoid under composition (of partial maps). We describe the…
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,…