SearcharxivSearch

arXiv · 1509.02888

Normal category of partitions of a set

Abstract

Let $T_X$ be the semigroup of all non-invertible transformations on an arbitrary set $X$. It is known that $T_X$ is a regular semigroup. The principal right(left) ideals of a regular semigroup $S$ with partial left(right) translations as morphisms form a normal category $\mathcal{R}( S )$($\mathcal{L}( S )$). Here we consider the category $\Pi(X)$ of partitions of a set $X$ and show that it admits a normal category structure and that $\Pi(X)$ is isomorphic to the category $\mathcal{R}( T_X )$. We also consider the normal dual $N^\ast \mathscr{P}(X)$ of the power-set category $\mathscr{P}(X)$ associated with $X$ and show that $N^\ast \mathscr{P}(X)$ is isomorphic to the partition category - $\Pi(X)$ of the set $X$.

Explore related subjects

Keep this discovery

BibTeXRIS

A. R. Rajan, Azeef Muhammed P A. 2015-09-09. Normal category of partitions of a set. https://arxiv.org/abs/1509.02888

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