Classifying Solvable Primitive Permutation Groups of Low Rank

MaRDI QIDQ6418968zbMATH OpenFDO

Authors Yuxuan Sun, Yong Yang

Publication date 29 November 2022

Mathematics Subject Classification ID

Representation theory of groups (20C99)

Abstract: Suppose that $G$ is a finite, transitive, solvable permutation group acting on a set $S$ with $n$ elements. Let $G_0$ be the stabilizer of a point $alphainOmega$. Define the rank of a permutation group, denoted $r(G),$ as the number of distinct orbits of $G_0$ in $S$ (including the trivial orbit $alpha$). Huppert cite{Huppert} and Foulser cite{Foulser} classified all finite, solvable, permutation groups of rank two and three respectively, and Foulser restricted the rank four groups to a small list of possibilities. This paper completes the classification of all groups of rank less than $5$ by explicitly confirming these past results and computationally constructing the groups of rank $4$.

This page was built for publication: Classifying Solvable Primitive Permutation Groups of Low Rank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6418968)