The Classification of Partition Homogeneous Groups with Applications to Semigroup Theory

preprint2013arXivOpen access

Abstract

Let λ=(λ1,λ2,...)λ=(λ_1,λ_2,...) be a \emph{partition} of nn, a sequence of positive integers in non-increasing order with sum nn. Let Ω:={1,...,n}Ω:=\{1,...,n\}. An ordered partition P=(A1,A2,...)P=(A_1,A_2,...) of ΩΩ has \emph{type} λλ if ∣Ai∣=λi|A_i|=λ_i. Following Martin and Sagan, we say that GG is \emph{λλ-transitive} if, for any two ordered partitions P=(A1,A2,...)P=(A_1,A_2,...) and Q=(B1,B2,...)Q=(B_1,B_2,...) of ΩΩ of type λλ, there exists g∈Gg\in G with Aig=BiA_ig=B_i for all ii. A group GG is said to be \emph{λλ-homogeneous} if, given two ordered partitions PP and QQ as above, inducing the sets P′={A1,A2,...}P'=\{A_1,A_2,...\} and Q′={B1,B2,...}Q'=\{B_1,B_2,...\}, there exists g∈Gg\in G such that P′g=Q′P'g=Q'. Clearly a λλ-transitive group is λλ-homogeneous. The first goal of this paper is to classify the λλ-homogeneous groups. The second goal is to apply this classification to a problem in semigroup theory. Let $\trans$ and $\sym$ denote the transformation monoid and the symmetric group on ΩΩ, respectively. Fix a group $H\leq \sym$. Given a non-invertible transformation $a\in \trans\setminus \sym$ and a group $G\leq \sym$, we say that (a,G)(a,G) is an \emph{HH-pair} if the semigroups generated by {a}∪H\{a\}\cup H and {a}∪G\{a\}\cup G contain the same non-units, that is, <a,G>∖G=<a,H>∖H< a,G>\setminus G=< a,H>\setminus H. Using the classification of the λλ-homogeneous groups we classify all the $\sym$-pairs. This topic involves both group theory and semigroup theory; we have attempted to include enough exposition to make the paper self-contained for researchers in both areas. The paper finishes with a number of open problems on permutation and linear groups.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.