2000 character limit reached
Base sizes for finite linear groups with solvable stabilisers (2408.08510v2)
Published 16 Aug 2024 in math.GR
Abstract: Let $G$ be a transitive permutation group on a finite set with solvable point stabiliser and assume that the solvable radical of $G$ is trivial. In 2010, Vdovin conjectured that the base size of $G$ is at most 5. Burness proved this conjecture in the case of primitive $G$. The problem was reduced by Vdovin in 2012 to the case when $G$ is an almost simple group. Now the problem is further reduced to groups of Lie type through work of Baykalov and Burness. In this paper, we prove the strong form of the conjecture for all almost simple groups with socle isomorphic to $\PSL_n(q),$ and the remaining classical groups will be handled in two forthcoming papers.