The rank of the semigroup of all order-preserving transformations on a finite fence (Q2272621): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2786119764 / rank | |||
Normal rank |
Revision as of 00:57, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The rank of the semigroup of all order-preserving transformations on a finite fence |
scientific article |
Statements
The rank of the semigroup of all order-preserving transformations on a finite fence (English)
0 references
20 September 2019
0 references
On the set \(\bar{n}=\{1, 2, \cdots, n\}\), a special partial order \(\preceq\) called the \textit{zigzag} order is considered and the pair \((\bar{n},\preceq)\) is called a (finite) \textit{fence}. In this paper, the authors study the semigroup \(\mathscr{TF}_n\) of all order preserving transformations on a finite fence. Given an arbitrary full transformation \(\alpha\), they characterise when \(\alpha\in \mathscr{TF}_n\). Using this, they provide a formula for the number of idempotent elements in the semigroup \(\mathscr{TF}_n\). Further, the rank of the semigroup \(\mathscr{TF}_n\) is explored in detail and a minimal sized set of generators of \(\mathscr{TF}_n\) is described. Given the semigroup \(\mathscr{TF}_n\), the exact value for the rank of the semigroup is obtained in Theorem 3.7 through a series of lemmas wherein the cases when \(n\) is odd and \(n\) is even is considered separately.
0 references
transformation semigroups
0 references
rank of semigroup
0 references
idempotents
0 references
order-preserving
0 references
fence
0 references
zig-zag order
0 references