Timeline for How large can the smallest generating set of a group $G$ of order $n$ be?

10 events

when toggle format	what		by	license	comment
Dec 4, 2015 at 11:33	comment	added	Frieder Ladisch		@GeoffRobinson: Thank you very much!
Dec 4, 2015 at 5:58	history	edited	Geoff Robinson	CC BY-SA 3.0	Typo
Dec 4, 2015 at 0:42	history	edited	Geoff Robinson	CC BY-SA 3.0	spacing
Dec 4, 2015 at 0:20	comment	added	Geoff Robinson		@FriederLadisch : The result was proved independently by Guralnick and Lucchini at around the same time, it was not a joint paper - I had forgotten that myself!
Dec 4, 2015 at 0:18	history	edited	Geoff Robinson	CC BY-SA 3.0	Added explanation about proofs by Guralnick and Lucchini.
Dec 3, 2015 at 23:06	history	edited	Geoff Robinson	CC BY-SA 3.0	minor typo
Dec 3, 2015 at 14:21	comment	added	Derek Holt		Simple groups are all $2$-generated.
Dec 3, 2015 at 14:19	comment	added	Ofir Gorodetsky		Interesting. I have a related vague question: Assume $G$ embedds in $S_n$. Your answer gives a bound of $n$ on the number of generators. For abelian $G$ this is tight (up to a multiplicative constant, maybe). Is there some family of $G$'s for which we have a better bound? E.g., simple subgroups of $S_n$?
Dec 3, 2015 at 14:11	vote	accept	Peter
Dec 3, 2015 at 14:06	history	answered	Geoff Robinson	CC BY-SA 3.0