2000 character limit reached
On soluble subgroups of sporadic groups
Published 3 May 2021 in math.GR | (2105.00718v2)
Abstract: Let $G$ be an almost simple sporadic group and let $H$ be a soluble subgroup of $G$. In this paper we prove that there exists $x,y \in G$ such that $H \cap Hx \cap Hy=1$, which is equivalent to the bound $b(G,H) \leqslant 3$ with respect to the base size of $G$ on the set of cosets of $H$. This bound is best possible. In this setting, our main result establishes a strong form of a more general conjecture of Vdovin on the intersection of conjugate soluble subgroups of finite groups. The proof uses a combination of computational and probabilistic methods.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.