Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the combinatorial and rank properties of certain subsemigroups of full contractions of a finite chain

Published 1 May 2022 in math.GR and math.CO | (2205.00438v1)

Abstract: Let $[n]={1,2,\ldots,n}$ be a finite chain and let $\mathcal{CT}{n}$ be the semigroup of full contractions on $[n]$. Denote $\mathcal{ORCT}{n}$ and $\mathcal{OCT}{n}$ 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$(\mathcal{ORCT}{n})$ and Reg$(\mathcal{OCT}{n}$), respectively) and the collection of all idempotent elements (denoted by E$(\mathcal{ORCT}{n})$ and E$(\mathcal{OCT}{n}$), respectively) of the subsemigroups $\mathcal{ORCT}{n}$ and $\mathcal{OCT}_{n}$, respectively are subsemigroups. In this paper, we study some combinatorial and rank properties of these subsemigroups.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

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

Collections

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