The sum and average of irreducible character codegrees (Q6901068)

Let \(G\) be a finite group, \(\mathrm{Irr}(G)\) the set of (complex) irreducible characters and \(\mathrm{Irr}_{\mathbb{Q}}(G)\) the set of rational-valued irreducible characters of \(G\). For \(\chi \in \mathrm{Irr}(G)\), the codegree of \(\chi\) is defined as \(\mathrm{cod}(\chi)=\big | G : \ker \chi \big | \cdot \chi(1)^{-1}\).\N\NTheorem A proves that if \(G\) is non-solvable, then the sum of codegrees over linear and even-degree characters is at least \(16\) and the sum over rational-valued characters is at least \(28\). When no simple group isomorphic to \(\mathrm{PSL}_2(3^{2f+1})\) is involved, analogous bounds hold for rational-valued linear and even-degree characters.\N\NTheorem B introduces the average codegree \(\mathrm{acod}_{\mathbb{Q}}(G) = \big |\mathrm{Irr}_{\mathbb{Q}}(G) \big |^{-1} \cdot \sum_{\chi \in \mathrm{Irr}_{\mathbb{Q}}(G)} \mathrm{cod}(\chi)\) and shows that \(G\) is solvable whenever \(\mathrm{acod}_{\mathbb{Q}}(G) < \mathrm{acod}_{\mathbb{Q}}(\mathrm{Alt}_{5})= 28/3\).