English

On stabilizers in finite permutation groups

Group Theory 2025-09-29 v4 Combinatorics

Abstract

Let GG 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 66, which is best possible and answers two questions of Babai. Every solvable maximal subgroup of any almost simple group has derived length at most 1010, 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.

Keywords

Cite

@article{arxiv.2411.18534,
  title  = {On stabilizers in finite permutation groups},
  author = {Luca Sabatini},
  journal= {arXiv preprint arXiv:2411.18534},
  year   = {2025}
}

Comments

14 pages, to appear in Bull. London Math. Soc

R2 v1 2026-06-28T20:14:52.908Z