The monoid of orientation-preserving \(k\)-extensive transformations (Q2143181)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The monoid of orientation-preserving \(k\)-extensive transformations
scientific article

    Statements

    The monoid of orientation-preserving \(k\)-extensive transformations (English)
    0 references
    0 references
    0 references
    0 references
    31 May 2022
    0 references
    Let \(X_{n}=\{1,2,\ldots,n\}\) be an \(n\)-element set of the first \(n\geq2\) natural numbers under the natural ordering and let \(\mathcal{PT}_n\) denote the monoid of all partial transformations of \(X_{n}\). Let \(\alpha \in \mathcal{PT}_n\) and let \(\text{dom } \alpha = \{a_1 < a_2 < \cdots < a_m\}\), with \(0 \leq m \leq n\). Then \(\alpha\) is called orientation-preserving if the sequence of its images \((a_1\alpha, a_2\alpha, \ldots, a_m\alpha)\) is cyclic, that is, there exists no more than one index \(i \in \{1, \ldots, m\}\) such that \(a_i\alpha > a_{i+1}\alpha\), where \(a_{m+1}\) denotes \(a_1\). A transformation \(\alpha \in \mathcal{PT}_{n}\) is called extensive or increasing (respectively, decreasing) if \(x\leq x\alpha\) (respectively, \(x\geq x\alpha\)) for all \(x\) in the domain of \(\alpha\). Let \(k \in X_n\). We say that \(\alpha\) is \(k\)-extensive if \(x \leq x\alpha\) for all \(x \in \{k, \ldots, n\}\). In the paper under review, the authors study the monoid \(\mathcal{OPE}_{n,k}\) of all orientation-preserving \(k\)-extensive transformations of \(X_n\). They show that the monoid \(\mathcal{OPE}_{n,k}\) is abundant, and obtain a sufficient and necessary condition of an element in \(\mathcal{OPE}_{n,k}\) to be regular. Moreover, the authors determine a minimal generating set and the minimum idempotent generating set of the monoid \(\mathcal{OPE}_{n,k}\), and so the rank and the idempotent rank of \(\mathcal{OPE}_{n,k}\) are established.
    0 references
    transformation semigroup
    0 references
    orientation-preserving
    0 references
    \(k\)-extensive
    0 references
    generating set
    0 references
    rank
    0 references
    idempotent rank
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers