Solvable groups satisfying the two-prime hypothesis. II. (Q694581)

This paper continues earlier work of the first author [part I, ibid. 10, No. 1, 1-24 (2007; Zbl 1120.20008)]. The main result is the following: Let \(G\) be a finite solvable group satisfying the two-prime hypothesis, that is, the greatest common divisor of any two distinct irreducible complex character degrees is the product of at most two (possibly the same) primes. Then the number of distinct character degrees of \(G\) is bounded above by \(462,515\). The authors note that 27 is the largest known possible value for the number of character degrees in this situation, and that they have made no attempt to find the optimal bound, which seems to be a hard problem. The proof only has to deal with groups \(G\) satisfying the additional hypothesis that \(G\) does not have a nonabelian nilpotent factor group, because the other case has already been taken care of in part I of this paper (where a bound of 88 was obtained).