On Generalized Characters Whose Values on Nonidentity Elements are Sums of at Most Two Roots of Unity
Christopher Herbig
TL;DR
This work analyzes generalized characters of finite groups, focusing on abelian groups whose values on nonidentity elements are sums of at most two roots of unity. The authors prove a near-complete structural description: such a generalized character on an abelian group typically has the form $\chi = a\rho_G + \delta_1\lambda_1 + \delta_2\lambda_2$, with $\delta_i\in\{-1,0,1\}$, except when $|G|$ is divisible by $2$, $3$, or $5$ where explicit outliers arise. The proof combines vanishing-sum results for roots of unity, Brauer’s characterization, and a detailed case analysis, yielding strong constraints on the prime divisors of $|G|$ and the constituents of $\chi$. As an application, the paper derives connectivity properties of prime graphs for groups admitting such characters, showing, for instance, that certain induced subgraphs become disconnected under natural prime-partitioning, while acknowledging that full disconnection of the entire prime graph remains delicate. Overall, the results advance the understanding of how constrained root-of-unity values in generalized characters influence group structure and prime-graph connectivity.
Abstract
A character of a finite group having degree $n$ takes values which may be expressed as sums of $n$ or fewer roots of unity. In this note, we prove a result which describes the irreducible constituents of generalized characters on abelian groups whose values on nonidentity elements are expressible as sums of two or fewer roots of unity. In Section 4, we apply our main result to obtain information about the connectivity of prime graphs for groups admitting such characters.
