The Classification of Partition Homogeneous Groups with Applications to Semigroup Theory
Jorge Andr\'e, Jo\~ao Ara\'ujo, Peter J. Cameron

TL;DR
This paper classifies groups based on their ability to permute partitions of a set with specific structures and applies this to classify certain semigroup pairs, advancing understanding in both group and semigroup theory.
Contribution
It provides a complete classification of mbda-homogeneous groups and applies this to classify all mbda-pairs involving the symmetric group, linking group and semigroup theory.
Findings
Classified all mbda-homogeneous groups.
Established a classification of mbda-pairs involving the symmetric group.
Connected permutation group properties with semigroup generation.
Abstract
Let be a \emph{partition} of , a sequence of positive integers in non-increasing order with sum . Let . An ordered partition of has \emph{type} if . Following Martin and Sagan, we say that is \emph{-transitive} if, for any two ordered partitions and of of type , there exists with for all . A group is said to be \emph{-homogeneous} if, given two ordered partitions and as above, inducing the sets and , there exists such that . 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
