Almost simple groups polynomial bound conjecture

Let XX be a finite almost simple group, meaning that its socle socX\operatorname{soc} X is a nonabelian simple group and socXXAut(socX)\operatorname{soc} X\leq X\leq \operatorname{Aut}(\operatorname{soc} X). For a normal subgroup NN of a finite group GG, define

m(G,N):=m(G)m(G/N),m(G,N):=m(G)-m(G/N),

where m(G)m(G) is the largest size of a minimal generating set. Let π(S)\pi(S) denote the set of prime divisors of S|S|. Almost simple groups polynomial bound conjecture. There exist constants σ\sigma and η\eta such that, for every finite almost simple group XX,

m(X,socX)σπ(socX)η.m(X,\operatorname{soc} X)\leq \sigma\cdot |\pi(\operatorname{soc} X)|^\eta.

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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.