Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 87 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 17 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 102 tok/s Pro
Kimi K2 166 tok/s Pro
GPT OSS 120B 436 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
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$.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.