AN ANALOGUE OF HUPPERT’S CONJECTURE FOR CHARACTER CODEGREES

Abstract

AbstractLet G be a finite group, let ${\mathrm{Irr}}(G)$ be the set of all irreducible complex characters of G and let $\chi \in {\mathrm{Irr}}(G)$ . Define the codegrees, ${\mathrm{cod}}(\chi ) = |G: {\mathrm{ker}}\chi |/\chi (1)$ and ${\mathrm{cod}}(G) = \{{\mathrm{cod}}(\chi ) \mid \chi \in {\mathrm{Irr}}(G)\} $ . We show that the simple group ${\mathrm{PSL}}(2,q)$ , for a prime power $q>3$ , is uniquely determined by the set of its codegrees.