Finite groups have even more conjugacy classes. (Q532594): Difference between revisions

Let \(k(G)\) denote the number of conjugacy classes of a finite group \(G\). A fundamental and venerable problem in Finite Group Theory is finding lower bounds of \(k(G)\) in terms of \(|G|\); for an excellent survey see [\textit{E. A. Bertram}, Contemp. Math. 402, 95-117 (2006; Zbl 1104.20026)]. In 1992, \textit{L. Pyber} [J. Lond. Math. Soc., II. Ser. 46, No. 2, 239-249 (1992; Zbl 0712.20016)] showed that for every finite group \(G\), \(k(G)\geq\varepsilon\log_2|G|/(\log_2\log_2|G|)^8\) holds for some fixed \(\varepsilon>0\). Moreover, he proved that if \(G\) is a solvable group with trivial Frattini subgroup, then \(k(G)=\beta\log_2|G|/(\log_2\log_2|G|)^3\) for some fixed \(\beta>0\). In the paper under review, the author, following Pyber's arguments, improves his results and obtains stronger lower bounds of \(k(G)\). Indeed, he proves the following theorems: Theorem A: There exists a (explicitly computable) constant \(\varepsilon_1>0\) such that every finite group \(G\) with \(|G|\geq 4\) satisfies \[ \kappa(G)\geq\varepsilon_1\log_2|G|/(\log_2\log_2|G|)^7, \] and if in addition \(G\) is solvable, then even \[ k(G)\geq\varepsilon_1\log_2|G|/(\log_2\log_2|G|). \] (Note that the lower bound of the form \(\varepsilon_1\log_2|G|/(\log_2\log_2|G|)\) for solvable groups is the best possible that can be achieved with Pyber's approach.) Theorem B: There is a (explicitly computable) constant \(\beta>0\) such that for any solvable group with trivial Frattini subgroup we have \(k(G)>|G|^\beta\). (Note that Theorem A is a consequence of this theorem.) Theorem C: Let \(G\) be a finite solvable group and write \(c\) for the nilpotency class of the Frattini subgroup of \(G\). Then \[ k(G)>\bigl(\tfrac{1}{2}c|G|^{\frac{1}{c}}\bigr)^{\beta/3}, \] where \(\beta\) is the constant from Theorem B.