A new solvability criterion for finite groups

From MaRDI portal




Abstract: In 1968, John Thompson proved that a finite group G is solvable if and only if every 2-generator subgroup of G is solvable. In this paper, we prove that solvability of a finite group G is guaranteed by a seemingly weaker condition: G is solvable if for all conjugacy classes C and D of G, emph{there exist} xinC and yinD for which genx,y is solvable. We also prove the following property of finite nonabelian simple groups, which is the key tool for our proof of the solvability criterion: if G is a finite nonabelian simple group, then there exist two integers a and b which represent orders of elements in G and for all elements x,yinG with |x|=a and |y|=b, the subgroup genx,y is nonsolvable.












This page was built for publication: A new solvability criterion for finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6219960)