Almost simple groups polynomial bound conjecture
Almost simple groups polynomial bound conjecture
Let be a finite almost simple group, meaning that its socle is a nonabelian simple group and . For a normal subgroup of a finite group , define
where is the largest size of a minimal generating set. Let denote the set of prime divisors of . Almost simple groups polynomial bound conjecture. There exist constants and such that, for every finite almost simple group ,
The paper presents this as the almost-simple reduction of the polynomial bound conjecture; it is known for alternating and sporadic socles, while the Lie-type case remains substantially open.
Sources & referencesView supporting material
Primary source
Andrea Lucchini, Mariapia Moscatiello and Pablo Spiga, “Bounding the maximal size of independent generating sets of finite groups”, arXiv:1908.01160 (2019).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.