SearcharxivSearch

arXiv · 2512.19422

On the small Schr\"{o}der semigroup $\mathcal{SS}^{\prime}_{n}$

Abstract

Let $[n]$ be a finite $n-$chain $\{1, 2, \dots, n\}$, and let $\mathcal{LS}_{n}$ be the Schr\"{o}der monoid, consisting of all isotone and order-decreasing partial transformations on $[n]$. Furthermore, let $\mathcal{SS}^{\prime}_{n} = \{\alpha \in \mathcal{LS}_{n} : \, 1\not\in \text{ Dom } \alpha\}$ be the subsemigroup of $\mathcal{LS}_{n}$, consisting of all transformations in $\mathcal{LS}_{n}$, each of whose domain does not contain $1$. For $1 \leq p \leq n$, let $K(n,p) = \{\alpha \in \mathcal{SS}^{\prime}_{n} : \, |Im \, \alpha| \leq p\}$ be the two-sided ideal of $\mathcal{SS}^{\prime}_{n}$. Moreover, let ${RSS}^{\prime}_{n}(p)$ denote the Rees quotient of $K(n,p)$. It is shown in this article that for any $S$ in $\{\mathcal{SS}^{\prime}_{n}, K(n,p), {RSS}^{\prime}_{n}(p)\}$, $S$ is right abundant for all values of $n$, but not left abundant for all $n \geq 2$. In addition, the rank of the Rees quotient ${RSS}^{\prime}_{n}(p)$ is shown to be equal to the rank of the two-sided ideal $K(n,p)$, which is equal to $\binom{n-1}{p-1}+\sum\limits_{k=p}^{n-1}\binom{n-1}{k} \binom{k-1}{p-1}$. Finally, the rank of $\mathcal{SS}^{\prime}_{n}$ is determined to be $3n-4$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Muhammad Mansur Zubairu, Abdullahi Umar, Fatma Salim Al-Kharousi. 2025-12-22. On the small Schr\"{o}der semigroup $\mathcal{SS}^{\prime}_{n}$. https://arxiv.org/abs/2512.19422

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR