Inequalities for character degrees of solvable groups (Q1086341): Difference between revisions

Let \(G\) be a finite solvable group. Inequalities involving the following five numerical invariants of \(G\) are established: \(\omega(G)\) -- the maximum number of prime divisors (counted with multiplicities) of a character degree of \(G\); \(\sigma(G)\) -- the maximum number of different prime divisors of a character degree of \(G\); \(\rho(G)\) -- the number of primes which divide some of the character degrees of \(G\); \(n(G)\) -- the nilpotent (Fitting) length of \(G\); \(dl(G)\) -- the derived length of \(G\). The following results are proved: (a) \(\rho(G)\leq n(G)\sigma(G)\). (b) If \(\omega(G)\geq 2\) then \(dl(G)\leq 2\omega(G)\). (c) \(\rho(G)\leq 2\omega (G)^ 2\). (d) If \(\omega(G)\leq 2\) then \(\rho(G)\leq 2\omega(G)\). These results extend and are based on a theorem of \textit{I. M. Isaacs} and \textit{D. S. Passman} [Pac. J. Math. 24, 467-510 (1968; Zbl 0155.05502)] who proved that if \(\omega (G)=1\) then \(dl(G)\leq 3\) and \(\rho(G)\leq 2\).