2008/03/21 by Edith Adan-Bante, Adan-Bante, Edith
Mathematics · Computer Science · Engineering · #Finite Group Theory Research #Coding theory and cryptography #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.0803.3222
Let G be a finite nilpotent group, χ and ψ be irreducible complex characters of G of prime degree. Assume that χ(1)=p. Then either the product χψ is a multiple of an irreducible character or χψ is the linear combination of at least (p+1)/(2) distinct irreducible characters.