Related papers: Combinatorial results for order-preserving partial…
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.
Let $\mathbb{N}^{2}_{\leqslant}$ be the set $\mathbb{N}^{2}$ with the partial order defined as the product of usual order $\leq$ on the set of positive integers $\mathbb{N}$. We study the semigroup…
A fence is a particular partial order on a (finite) set, close to the linear order. In this paper, we calculate the rank of the semigroup $\mathcal{FI}_{n}$ of all order-preserving partial injections on an $n$-element fence. In particular,…
We present a construction for the holomorph of an inverse semigroup, derived from the cartesian closed structure of the category of ordered groupoids. We compare the holomorph with the monoid of mappings that preserve the ternary heap…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
Let $\mathcal{ORD}_{n}$ be the semigroup consisting of all oriented and order-decreasing full transformations on the finite chain $X_{n}=\{ 1<\cdots<n \}$, and for $1\leq r\leq n-1$, let $$\mathcal{ORD}(n,r) =\{\alpha \in…
A semigroup together with compatible partial order is called an odered semigroup. In this paper we discuss the ordered matrix semigroups.
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…
A permutation $\pi$ contains a pattern $\sigma$ if and only if there is a subsequence in $\pi$ with its letters are in the same relative order as those in $\sigma$. Partially ordered patterns (POPs) provide a convenient way to denote…
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…
(Induced) Subgraph Isomorphism and Maximum Common (Induced) Subgraph are fundamental problems in graph pattern matching and similarity computation. In graphs derived from time-series data or protein structures, a natural total ordering of…
For any positive integer $n$, let $\mathcal{O}_{n}$ be the semigroup of all order-preserving full transformations on $X_{n}=\{1<\cdots <n\}$. For any $1\leq k\leq n$, let $\pi_{k}\in \mathcal{O}_{n}$ be the constant map defined by…
In this note we consider the monoid $\mathcal{PODI}_n$ of all monotone partial permutations on $\{1,\ldots,n\}$ and its submonoids $\mathcal{DP}_n$, $\mathcal{POI}_n$ and $\mathcal{ODP}_n$ of all partial isometries, of all order-preserving…
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.…
In this paper, we consider the inverse submonoids $AOR_n$ of oriented transformations and $AOP_n$ of orientation-preserving transformations of the alternating inverse monoid $AI_n$ on a chain with $n$ elements. We compute the cardinalities,…
In the paper we study inverse semigroups $\mathscr{B}(G)$, $\mathscr{B}^+(G)$, $\bar{\mathscr{B}}(G)$ and $\bar{\mathscr{B}}\,^+(G)$ which are generated by partial monotone injective translations of a positive cone of a linearly ordered…
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
We study relatively uniformly continuous operator semigroups on ordered vector spaces and extend several recent results obtained by M. Kramar Fijavz, M. Kandic, M. Kaplin, and J. Gluck in the vector lattice setting to ordered vector spaces…
The notion of containment and avoidance provides a natural partial ordering on set partitions. Work of Sagan and of Goyt has led to enumerative results in avoidance classes of set partitions, which were refined by Dahlberg et al. through…
We study the semigroup $\mathscr{I}^{\mathrm{cf}}_\lambda$ of injective partial cofinite selfmaps of an infinite cardinal $\lambda$. We show that $\mathscr{I}^{\mathrm{cf}}_\lambda$ is a bisimple inverse semigroup and each chain of…