BOUNDING THE NUMBER OF IRREDUCIBLE CHARACTER DEGREES OF A FINITE GROUP IN TERMS OF THE LARGEST DEGREE

摘要

We conjecture that the number of irreducible character degrees of a finite group is bounded in terms of the number of prime factors (counting multiplicities) of the largest character degree. We prove that this conjecture holds when the largest character degree is prime and when the character degree graph is disconnected.