No Access
On the Number of Constituents of Products of Characters
https://doi.org/10.1142/S100538670700020XCited by:1 (Source: Crossref)
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 ≥ 5, is bigger than (p + 1)/2, then it is at least p. We give a counterexample to this conjecture.
The second author was supported by the FEDER, the Spanish Ministerio de Ciencia y Educación, grants MTM2004-04665 and MTM2004-06067-C02-01, the Generalitat Valenciana and the Programa Ramón y Cajal.
AMSC: 20C15
