arXiv · 2411.18534
On stabilizers in finite permutation groups
Abstract
Let $G$ be a permutation group on the finite set $\Omega$. We prove various results about partitions of $\Omega$ whose stabilizers have good properties. In particular, in every solvable permutation group there is a set-stabilizer whose orbits have length at most $6$, which is best possible and answers two questions of Babai. Every solvable maximal subgroup of any almost simple group has derived length at most $10$, which is best possible. In every primitive group with solvable stabilizer, there are two points whose stabilizer has derived length bounded by an absolute constant.
Explore related subjects
Keep this discovery
Luca Sabatini. 2024-11-27. On stabilizers in finite permutation groups. https://doi.org/10.1112/blms.70201
Cite the original work for its findings. Save a collection to share your selection of sources.