SearcharxivSearch

arXiv · 1512.05608

Orbits of Primitive $k$-Homogenous Groups on $(n-k)$-Partitions with Applications to Semigroups

Abstract

Let $X$ be a finite set such that $|X|=n$, and let $k< n/2$. A group is $k$-homogeneous if it has only one orbit on the sets of size $k$. The aim of this paper is to prove some general results on permutation groups and then apply them to transformation semigroups. On groups we find the minimum number of permutations needed to generate $k$-homogeneous groups (for $k\ge 1$); in particular we show that $2$-homogeneous groups are $2$-generated. We also describe the orbits of $k$-homogenous groups on partitions with $n-k$ parts, classify the $3$-homogeneous groups $G$ whose orbits on $(n-3)$-partitions are invariant under the normalizer of $G$ in $S_n$, and describe the normalizers of $2$-homogeneous groups in the symmetric group. Then these results are applied to extract information about transformation semigroups with given group of units, namely to prove results on their automorphisms and on the minimum number of generators. The paper finishes with some problems on permutation groups, transformation semigroups and computational algebra.

Explore related subjects

Keep this discovery

BibTeXRIS

João Araújo, Peter J. Cameron. 2015-12-17. Orbits of Primitive $k$-Homogenous Groups on $(n-k)$-Partitions with Applications to Semigroups. https://arxiv.org/abs/1512.05608

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