SearcharxivSearch

arXiv · 2006.04242

On certain Semigroups of Transformations that preserve a partition

Abstract

Let $X$ be a nonempty set, and let $\mathcal{T}_X$ be the full transformation semigroup on $X$. For a partition $\mathcal{P} = \{X_i \;|\; i\in I\}$ of $X$, we consider the semigroup $T(X, \mathcal{P}) = \{f\in \mathcal{T}_X\;|\; \forall X_i\;\exists X_j,\; X_i f \subseteq X_j\}$, the subsemigroup $\Sigma(X, \mathcal{P}) = \{f\in T(X, \mathcal{P})\;|\; Xf \cap X_i \neq \emptyset\; \forall X_i\}$, and the group of units $S(X, \mathcal{P})$ of $T(X, \mathcal{P})$. In this paper, we first characterize the elements of $\Sigma(X, \mathcal{P})$. For a permutation $f$ of finite $X$, we next observe whether there exists a nontrivial partition $\mathcal{P}$ of $X$ such that $f\in S(X, \mathcal{P})$. We then characterize and enumerate the idempotents in the semigroup $\Sigma(X, \mathcal{P})$ for arbitrary and finite $X$, respectively. We also characterize the elements of $S(X, \mathcal{P})$. For finite $X$, we finally calculate the cardinality of $T(X, \mathcal{P})$, $\Sigma(X, \mathcal{P})$, and $S(X, \mathcal{P})$.

Explore related subjects

Keep this discovery

BibTeXRIS

Mosarof Sarkar, Shubh N. Singh. 2020-06-07. On certain Semigroups of Transformations that preserve a partition. https://doi.org/10.1080/00927872.2020.1799224

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