论文标题
关于人物产品成分的数量
On the number of constituents of products of characters
论文作者
论文摘要
有人猜想，如果有限的$ p $ - group的两个忠实不可减少字符的不同构成数量（对于$ p \ geq5 $）大于$（p+1）/2 $，那么它至少是$ p $。我们对这个猜想进行反例。
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.
