Character products and \(Q\)-polynomial group association schemes (Q1975922): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q173980
Property / reviewed by
 
Property / reviewed by: Q1349476 / rank
Normal rank
 

Revision as of 06:36, 10 February 2024

scientific article
Language Label Description Also known as
English
Character products and \(Q\)-polynomial group association schemes
scientific article

    Statements

    Character products and \(Q\)-polynomial group association schemes (English)
    0 references
    0 references
    0 references
    28 August 2000
    0 references
    Let \(\overline{\mathbb{Q}}\) be the algebraic closure of \(\mathbb{Q}\) in \(C\). Let \(\text{Irr} (G)\) be the set of irreducible complex characters of a finite group \(G\). For \(\phi \in \text{Irr} (G)\), let \[ \widehat \phi= \begin{cases} \phi & \text{if} \quad\phi\quad \text{is real valued} \\ \phi+\widehat \phi & \text{otherwise}.\end{cases} \] Theorem 1.1. Let \(G\) be a finite group and let \(\chi, \psi_1,\dots,\psi_r\in \text{Irr} (G)\). Suppose \[ \widehat \chi^2=b\cdot 1+a\cdot \chi+c\cdot(\widehat \psi_1+\dots+\widehat \psi_r), \] with nonnegative integers \(a,b,c\), and \(\{\widehat \psi_1,\dots,\widehat \psi_r\}\) a single orbit under the action of the Galois group \(\text{Gal}(\overline {\mathbb{Q}}/ {\mathbb{Q}}(\widehat \chi))\). If \(\chi\) is faithful, then one of the following holds. (i) \(\chi(1)=1\) and \(G\) is a cyclic group. (ii) \(G\) is a Frobenius group whose complement is of prime order \(p\) with \(p=\chi(1)=2r+1\). (iii) \(\chi(1)=\widehat \chi(1)=2,\;r=1\), and \(G\) is isomorphic to \(S_3\). (iv) \(\chi(1)=\widehat \chi(1)=2,\;r=1\), and \(G\) is isomorphic to one of the binary polyhedral groups \(\text{SL}_2(3)\), \(\text{SL}_2(3)\cdot 2\) or \(\text{SL}_2(5)\). (v) \(\chi(1)=\widehat \chi(1)=3,\;r=1\), and \(G\) is isomorphic to \(A_5\). As application a classification of \(Q\)-polynomial group association schemes is given.
    0 references
    association schemes
    0 references
    characters of finite groups
    0 references

    Identifiers