Generalized characters and prime graphs
Generalized characters of finite groups whose values at nonidentity elements are sums of at most two roots of unity are investigated. For an abelian group \(G\) with \(\gcd(|G|,30)=1\), every such character has the form \(\chi=a\rho_G+\delta_1\lambda_1+\delta_2\lambda_2\), where \(\rho_G\) is the regular character, \(a\in\mathbb{Z}\), \(\delta_i\in\{-1,0,1\}\) and \(\lambda_i\in\mathrm{Irr}(G)\). When \(2\), \(3\) or \(5\) divides \(|G|\), four additional forms involving three or four distinct irreducible characters are possible, together with further exceptions involving five to seven distinct irreducible characters when \(|G|\leq21\).
- A bound on norms of generalized characters with applications
- Generalized characters whose values on non-identity elements are roots of unity.
- scientific article; zbMATH DE number 3526920 (Why is no real title available?)
- scientific article; zbMATH DE number 3081728 (Why is no real title available?)
- On vanishing sums of roots of unity.
- Prime graph components of finite groups
- The diameter of the prime graph of a finite group
- The Number of Intersection Points Made by the Diagonals of a Regular Polygon
- Transitive permutation groups where nontrivial elements have at most two fixed points.
This page was built for publication: Generalized characters and prime graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7444279)