Bounding the number of classes of a finite group in terms of a prime (Q2182111): Difference between revisions

Let \(G\) be a finite group and let \(k(G)\) be the number of conjugacy classes of \(G\) (\(k(G)\) is also equal to the number of complex irreducible characters of \(G\)). A fundamental problem in (finite) group theory and representation theory is bounding \(k(G)\) as a function of some invariant of \(G\). \textit{L. Héthelyi} and \textit{B. Külshammer} [J. Algebra 270, No. 2, 660--669 (2003; Zbl 1047.20016)] showed that, if \(G\) is solvable and \(p^{2}\) divides \(|G|\), then \(k(G) \geq (49p+1)/60\). The main result of the paper under review is Theorem 1.1: There exists a constant \(c > 0\) such that, for any finite group \(G\) whose order is divisible by the square of a prime \(p\), we have \(k(G) \geq cp\). The proof uses the classification of finite simple groups.