Polynomial bound conjecture for maximal independent generating sets

About 7 years old · traced to

Let GG be a finite group, let m(G)m(G) be the largest size of a minimal generating set of GG, and let

δ(G):=∑p∈π(G)dp(G),\delta(G):=\sum_{p\in \pi(G)}d_p(G),

where π(G)\pi(G) is the set of prime divisors of ∣G∣|G| and dp(G)d_p(G) is the minimal number of generators of a Sylow pp-subgroup of GG. Polynomial bound conjecture. There exist constants cc and η\eta such that, for every finite group GG,

m(G)≤c⋅δ(G)η.m(G)\leq c\cdot \delta(G)^\eta.

This generalizes Dennis' conjecture and is motivated by the polynomial bound established for symmetric groups; the paper reduces it to a corresponding assertion for finite almost simple groups.

References

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.