English

Base sizes for finite linear groups with solvable stabilisers

Group Theory 2025-01-14 v2

Abstract

Let GG be a transitive permutation group on a finite set with solvable point stabiliser and assume that the solvable radical of GG is trivial. In 2010, Vdovin conjectured that the base size of GG is at most 5. Burness proved this conjecture in the case of primitive GG. The problem was reduced by Vdovin in 2012 to the case when GG 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 \PSLn(q),\PSL_n(q), and the remaining classical groups will be handled in two forthcoming papers.

Keywords

Cite

@article{arxiv.2408.08510,
  title  = {Base sizes for finite linear groups with solvable stabilisers},
  author = {Anton A. Baykalov},
  journal= {arXiv preprint arXiv:2408.08510},
  year   = {2025}
}

Comments

This paper is based on material from arXiv:1703.00124 which is divided into two papers in purpose of publication. The introduction section is updated as well as some of the proofs; minor gaps in proofs and statements are fixed

R2 v1 2026-06-28T18:14:22.653Z