Characters that agree on prime-power-order elements. (Q1812165)

In this paper, results on character theory of fully factored characters are shown. The first theorem proven is: Theorem A: Suppose \(G\) is a finite solvable group, let \(\chi\in\text{Irr}(G)\), \(\psi\in\text{Irr}(G)\) such that \(\chi(t)=\psi(t)\) whenever \(t\in G\) is an element of prime power order. If one of \(\chi\) or \(\psi\) is primitive, then \(\chi=\psi\). The proof of Theorem A is an application of the theory of factored characters. A primitive character of a solvable group is called fully factored, if it is a product of \(p\)-special characters for various distinct primes \(p\). Theorem B is formulated like Theorem A, by changing ``one of \(\chi\) or \(\psi\) is primitive'' into ``both \(\chi\) and \(\psi\) are fully factored''. Theorem C is formulated like Theorem B, by adding, that \(G\) has odd order, and changing ``both \(\chi\) and \(\psi\) are'' into ``one of \(\chi\) or \(\psi\) is''. Another nice result is Theorem D: Suppose \(G\) is solvable of odd order, and let \(\chi\in\text{Irr}(G)\). Then \(\chi\) is \(p\)-special if and only if \(\chi(1)\) is a power of \(p\) and \(\chi\) has real values on all elements of \(q\)-power order in \(G\) for all primes \(q\neq p\). The list of references refers to work of \textit{D. Gajendragadkar} [J. Algebra 59, 237-259 (1979; Zbl 0426.20007)] and papers of \textit{I. M. Isaacs} [in Math. Z. 177, 267-284 (1981; Zbl 0475.20007) and J. Algebra 157, No. 2, 548-561 (1993; Zbl 0790.20017)]; the reviewer refers the reader kindly to it, as fundamental.