Polynomial bound conjecture for maximal independent generating sets
Let be a finite group, let be the largest size of a minimal generating set of , and let
where is the set of prime divisors of and is the minimal number of generators of a Sylow -subgroup of . Polynomial bound conjecture. There exist constants and such that, for every finite group ,
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
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.