Prime-order generation conjecture for finite nonabelian simple groups

Let GG be a finite nonabelian simple group. Define

oe(G)={mgG with g=m}\operatorname{oe}(G)=\{m\mid \exists\,g\in G\text{ with }|g|=m\}

to be the set of element orders of GG. Prime-order generation conjecture. There exist two distinct primes p,qoe(G)p,q\in\operatorname{oe}(G) such that, for all x,yGx,y\in G with x=p|x|=p and y=q|y|=q, the subgroup x,y\langle x,y\rangle is nonsolvable; perhaps, even, it is nonabelian simple. The preceding theorem establishes the analogous assertion with pp and qq replaced by arbitrary element orders, while the conjecture asks whether the orders can always be chosen to be distinct primes. It is motivated by the verified cases for alternating and sporadic groups; its status is not established in the supplied text.

Sources & referencesView supporting material

Primary source

Silvio Dolfi, Marcel Herzog and Cheryl E. Praeger, “A new solvability criterion for finite groups”, arXiv:1007.5394 (2010).

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.