On the number of constituents of products of characters

Abstract

It has been conjectured that if the number of distinct irreducible constituents of the product of two faithful irreducible characters of a finite $p$-group, for $p\geq5$, is bigger than $(p+1)/2$, then it is at least $p$. We give a counterexample to this conjecture.