Related papers: Oriented transformations on a finite chain: anothe…
In this paper, we characterize the monoid of endomorphisms of the semigroup of all oriented full transformations of a finite chain, as well as the monoid of endomorphisms of the semigroup of all oriented partial transformations and the…
We characterise the respective semigroups of mappings that preserve, or that preserve or reverse orientation of a finite cycle, in terms of their actions on oriented triples and oriented quadruples. This leads to a proof that the latter…
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.
Recent results on finite open group transformations are reviewed.
We characterize the respective semigroups of mappings that preserve, or that preserve or reverse orientation of a finite cycle, in terms of their actions on oriented triples and oriented quadruples. This leads to a proof that the latter…
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]$,…
In this paper we introduce the definition of transitivity for oriented 3-hypergraphs in order to study partial and complete cyclic orders. This definition allow us to give sufficient conditions on a partial cyclic order to be totally…
We continue the study of permutations of a finite regular semigroup that map each element to one of its inverses, providing a complete description in the case of semigroups whose idempotent generated subsemigroup is a union of groups. We…
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…
In this article, we present a new characterization of the completeness of a partial metric space--which we call \textit{orbital characterization}-- using fixed point results.
We describe a new notation for finite transformations. This attractor-cycle notation extends the orbit-cycle notation for permutations and builds upon existing transformation notations. How the basins of attraction of a finite…
A new characterization of conformal transformations is given. By use of this, the general form of conformal transformation on two-dimensional Minkowski space is given and its conformal structure is analyzed.
Let $X$ be an infinite linearly ordered set and let $Y$ be a nonempty subset of $X$. We calculate the relative rank of the semigroup $OP(X,Y)$ of all orientation-preserving transformations on $X$ with restricted range $Y$ modulo the…
An oriented hypergraph is an oriented incidence structure that extends the concept of a signed graph. We introduce hypergraphic structures and techniques central to the extension of the circuit classification of signed graphs to oriented…
In this paper we describe the Greens relations on the semigroup of bi-ideals of ordered full transformation semigroup in terms of Greens relations of ordered full transformation semigroup on a set.
Let $\Omega_n$ be a finite chain with $n$ elements $(n\in\mathbb{N})$, and let $\mathcal{POPI}_{n}$ be the semigroup of all injective orientation-preserving partial transformations of $\Omega_n$. In this paper, for any nonempty subset $Y$…
Let ${\cal PO}_n$ be the semigroup of all order-preserving partial transformations of a finite chain. It is shown that there exist bijections between the set of certain lattice paths in the Cartesian plane that start at $(0,0)$, end at…
We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…
It is known that the set of permutations, under the pattern containment ordering, is not a partial well-order. Characterizing the partially well-ordered closed sets (equivalently: down sets or ideals) in this poset remains a wide-open…
We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between…