A new solvability criterion for finite groups

preprint2010arXivOpen access

Abstract

In 1968, John Thompson proved that a finite group GG is solvable if and only if every 22-generator subgroup of GG is solvable. In this paper, we prove that solvability of a finite group GG is guaranteed by a seemingly weaker condition: GG is solvable if for all conjugacy classes CC and DD of GG, \emph{there exist} x∈Cx\in C and y∈Dy\in D for which $\gen{x,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 GG is a finite nonabelian simple group, then there exist two integers aa and bb which represent orders of elements in GG and for all elements x,y∈Gx,y\in G with ∣x∣=a|x|=a and ∣y∣=b|y|=b, the subgroup $\gen{x,y}$ is nonsolvable.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.