On solvable factors of almost simple groups
Abstract
Let be a finite almost simple group with socle . A (nontrivial) factorization of is an expression of the form , where the factors and are core-free subgroups. There is an extensive literature on factorizations of almost simple groups, with important applications in permutation group theory and algebraic graph theory. In a recent paper, Li and Xia describe the factorizations of almost simple groups with a solvable factor . Several infinite families arise in the context of classical groups and in each case a solvable subgroup of containing is identified. Building on this earlier work, in this paper we compute a sharp lower bound on the order of a solvable factor of every almost simple group and we determine the exact factorizations with a solvable factor. As an application, we describe the finite primitive permutation groups with a nilpotent regular subgroup, extending classical results of Burnside and Schur on cyclic regular subgroups, and more recent work of Li in the abelian case.
Cite
@article{arxiv.1910.00644,
title = {On solvable factors of almost simple groups},
author = {Timothy C. Burness and Cai Heng Li},
journal= {arXiv preprint arXiv:1910.00644},
year = {2020}
}
Comments
29 pages; to appear in Advances in Math