2000 character limit reached
On certain subsemigroups of finite oriented and order-decreasing full transformations (2507.11122v1)
Published 15 Jul 2025 in math.RA
Abstract: 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 \mathcal{ORD}_{n}\, :\, \lvert \textrm{im}(\alpha )\rvert \leq r}.$$ In this paper, we determine the cardinality of $\mathcal{ORD}(n,r)$ and the number of nilpotent elements of $\mathcal{ORD}(n,r)$, we find a minimal generating set and the rank of $\mathcal{ORD}(n,r)$, and moreover, we characterize all maximal subsemigroups of $\mathcal{ORD}(n,r)$ for each $3\leq r\leq n-1$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.