Character tables and Sylow normalizers. (Q1614905)

Let \(\pi\) be an arbitrary set of primes, \(G^0\) the set of all \(\pi\)-elements of a finite group \(G\) and \(\chi^0\) the restriction of \(\chi\in\text{Irr}(G)\) to \(G^0\). We refer to \(\chi^0\) as a \(\pi\)-partial character of \(G\). Let \(\text{I}_\pi(G)\) denote the set of irreducible \(\pi\)-partial characters of \(G\) (i.e., exactly those that cannot be written as sums of other \(\pi\)-partial characters). Let \(G\) be \(\pi\)-separable group. Then there is a canonically defined subset \(\text{B}_\pi(G)\subseteq\text{Irr}(G)\) of characters \(\chi\) such that the map \(\chi\mapsto\chi^0\) is always a bijection from \(\text{B}_\pi(G)\) onto \(\text{I}_\pi(G)\). Then, if \(Q\in\text{Syl}_q(G)\), where \(q\) is a prime, then \(N_G(Q)\) is a \(\pi\)-group if and only if every irreducible character of \(G\) having \(q'\)-degree lies in \(\text{B}_\pi(G)\). It follows that the character table of \(G\) determines whether or not \(N_G(Q)\) is a \(\pi\)-group. In conclusion, the authors offer a more elementary proof of the last assertion based on easy recursive algorithms.