On the combinatorial and rank properties of certain subsemigroups of full contractions of a finite chain
Abstract
Let [n]=\1,2,…,n\ be a finite chain and let CTn be the semigroup of full contractions on [n]. Denote ORCTn and OCTn 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(ORCTn) and Reg(OCTn), respectively) and the collection of all idempotent elements (denoted by E(ORCTn) and E(OCTn), respectively) of the subsemigroups ORCTn and OCTn, respectively are subsemigroups. In this paper, we study some combinatorial and rank properties of these subsemigroups.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.