Derived length when a product of characters has two nonprincipal irreducible constituents. (Q2803563)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Derived length when a product of characters has two nonprincipal irreducible constituents. |
scientific article; zbMATH DE number 6575651
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Derived length when a product of characters has two nonprincipal irreducible constituents. |
scientific article; zbMATH DE number 6575651 |
Statements
2 May 2016
0 references
products of characters
0 references
derived lengths
0 references
finite solvable groups
0 references
irreducible constituents
0 references
irreducible characters
0 references
0.78367746
0 references
0 references
0.77098954
0 references
0.76619077
0 references
0.75249887
0 references
0.7472985
0 references
0.7462332
0 references
Derived length when a product of characters has two nonprincipal irreducible constituents. (English)
0 references
Let \(\chi\) be a nonlinear irreducible character of a finite group \(G\); then it is known that the principal character \(1_G\in\chi\overline\chi\). Let \(\eta(\chi)\) be the number of nonprincipal irreducible constituents of \(\chi\overline\chi\) and suppose that \(G\) is solvable. \textit{E. Adan-Bante} proved the existence of a linear bound for the derived length of \(G/\ker(\chi)\) in terms of \(\eta(\chi)\), and [in J. Algebra 266, No. 1, 305-319 (2003; Zbl 1034.20008)] she described groups with faithful \(\chi\) such that \(\eta(\chi)\in\{1,2\}\). Her results on the case \(\eta(\chi)=1\) are quite complete, but for \(\eta(\chi)=2\) she only obtained partial results, such as that the derived length of such groups is at most 18.NEWLINENEWLINE The paper under review adds to our understanding of the case \(\eta(\chi)=2\) by proving that, in fact, the best possible bound for the derived length is 8. The proof that 8 is an upper bound requires careful study of linear group actions. To see that 8 cannot be improved, the authors exhibit an interesting example of order 165,888 with faithful character \(\chi\) of degree 8.
0 references