Nonsolvable groups with few primitive character degrees (Q1705156)

An irreducible (complex) character of a finite group \(G\) is called monomial if it is induced from a linear character of a subgroup of \(G\). If an irreducible character of \(G\) cannot be induced from any character of any proper subgroup, then the character is called primitive. Clearly a nonlinear primitive character is nonmonomial. This paper is devoted to the proof of four pairs of theorems on characters, the first theorem of each pair pertaining to the primitive characters and the second to the nonmonomial ones. As an example of the results obtained by the author, we report here the second and fourth pair of theorems. Theorem B1 (resp. B2): Let \(G\) be a nonsolvable group and assume that all primitive (resp. nonmonomial) characters of \(G\) are of square-free degree. Then \(G/\mathrm{Sol}(G)\) is isomorphic to one of the following groups: \(A_{7}\), \(S_{7}\), \(\mathrm{PSL}_{2}(p)\) or \(\mathrm{PGL}_{2}(p)\) (resp. \(A_{7}\), \(\mathrm{PSL}_{2}(p)\) or \(\mathrm{PGL}_{2}(p)\)), where \(p\geq 7\) is a prime, \(p-1\) square-free. Theorem D1: Assume that all primitive characters of \(G\) are of odd degree. Then every nonabelian composition factor of \(G\) is of type \(\mathrm{PSL}_{2}(q)\), where \(q\) is odd and \(q=p^{f} \geq 9\). Theorem D2: Assume that all nonmonomial characters of \(G\) are of odd degree. Then \(G\) is solvable.