On linear relations between character values (Q1239253): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5551256 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5577154 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On groups with extremal blocks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Endliche Gruppen I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of groups in terms of the degrees of their characters / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of groups in terms of the degrees of their characters. II / rank | |||
Normal rank |
Latest revision as of 21:34, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On linear relations between character values |
scientific article |
Statements
On linear relations between character values (English)
0 references
1977
0 references
Finite groups \(G\) satisfying the following properties are characterized: There exist non-conjugate elements \(s\) and \(u\) of \(G\) and complex numbers \(a\), \(b\) and \(c\), \(ab \neq 0\), such that \(aX(s) +bX(u) = c\) is satisfied: (i) by every irreducible character of \(G\), or (ii) by every non-principal irreducible character of \(G\), but not by the principal character. In case (i), \(G\) turns out to be a solvable group of derived length at most 3. In case (ii) it is shown that if \(|G| > 3\), then either \(G\) is a Frobenius group of order \(2n\), \(n\) odd, with the kernel of order \(n\), or \(G \cong \text{PSL}(2,2^n)\), \(n \geq 2\).
0 references