On the combinatorial and rank properties of certain subsemigroups of full contractions of a finite chain
Muhammad Mansur Zubairu, Abdullahi Umar, Muhammad Jada Aliyu

TL;DR
This paper investigates the combinatorial structures and rank properties of certain subsemigroups of full contractions on finite chains, focusing on order-preserving and reversing contractions, and their regular and idempotent elements.
Contribution
It provides new insights into the combinatorial and rank characteristics of subsemigroups of full contractions, including those of regular and idempotent elements, extending prior work.
Findings
Characterization of regular elements in subsemigroups
Determination of rank properties of these subsemigroups
Analysis of combinatorial structures within the semigroups
Abstract
Let be a finite chain and let be the semigroup of full contractions on . Denote and to be the subsemigroup of order preserving or reversing and the subsemigroup of order preserving full contractions, respectively. It was shown in [17] that the collection of all regular elements (denoted by, Reg and Reg), respectively) and the collection of all idempotent elements (denoted by E and E), respectively) of the subsemigroups and , respectively are subsemigroups. In this paper, we study some combinatorial and rank properties of these subsemigroups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Algebra and Logic
