A new solvability criterion for finite groups

Details A new solvability criterion for finite groups A new solvability criterion for finite groups

2011-05-03

arxiv.org/abs/1105.0475v1

Mathematics

Group Theory

The results here are an improved version of the paper of the same name posted as arXiv:1007.5394 by the first, third and fourt

Scientific paper

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 consisting of elements of prime power order, there exist x in C and y in D with x and y generating a solvable group. 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 prime divisors a and b of |G| such that, for all elements x, y in G with |x|=a and |y|=b, the subgroup generated by x and y is not solvable. Further, using a recent result of Guralnick and Malle, we obtain a similar membership criterion for any family of finite groups closed under forming subgroups, quotients and extensions.

Affiliated with

Also associated with

No associations

Rating

A new solvability criterion for finite groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A new solvability criterion for finite groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new solvability criterion for finite groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-692328