Base sizes for primitive groups with soluble stabilisers

From MaRDI portal
Publication:2239243

DOI10.2140/ANT.2021.15.1755zbMATH Open1486.20002arXiv2006.10510OpenAlexW3125988253WikidataQ114045559 ScholiaQ114045559MaRDI QIDQ2239243FDOQ2239243


Authors: Timothy C. Burness Edit this on Wikidata


Publication date: 3 November 2021

Published in: Algebra \& Number Theory (Search for Journal in Brave)

Abstract: Let G be a finite primitive permutation group on a set Omega with point stabiliser H. Recall that a subset of Omega is a base for G if its pointwise stabiliser is trivial. We define the base size of G, denoted b(G,H), to be the minimal size of a base for G. Determining the base size of a group is a fundamental problem in permutation group theory, with a long history stretching back to the 19th century. Here one of our main motivations is a theorem of Seress from 1996, which states that b(G,H)leqslant4 if G is soluble. In this paper we extend Seress' result by proving that b(G,H)leqslant5 for all finite primitive groups G with a soluble point stabiliser H. This bound is best possible. We also determine the exact base size for all almost simple groups and we study random bases in this setting. For example, we prove that the probability that 4 random elements in Omega form a base tends to 1 as |G| tends to infinity.


Full work available at URL: https://arxiv.org/abs/2006.10510




Recommendations




Cites Work


Cited In (28)





This page was built for publication: Base sizes for primitive groups with soluble stabilisers

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