Connectedness of degree graphs of nonsolvable groups. (Q1403861)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Connectedness of degree graphs of nonsolvable groups.
scientific article

    Statements

    Connectedness of degree graphs of nonsolvable groups. (English)
    0 references
    0 references
    0 references
    20 August 2003
    0 references
    If \(Z\) is a subset of \(\mathbb{N}\), then the `prime graph' \(\Delta(G)\) of \(Z\) has the vertex set consisting of all prime divisors of the members of \(Z\), and distinct vertices \(p\) and \(q\) are joined if \(pq\) divides some member of \(Z\). Set \(\Delta=\Delta(G)=\Delta(\text{cd}(G))\). Let \(c=c(\Delta)\) be the number of connected components of \(\Delta\). Below the main results follow. (a) Let \(G\) be a nonabelian simple group. If \(c>1\), then \(G\cong\text{PSL}(2,q)\) for some prime power \(q\). Let \(G\cong\text{PSL}(2,q)\). If \(q=2^n\), then \(c=3\), otherwise \(c=2\). (b) If \(G\) is such that \(c=3\), then \(G=S\times A\), where \(S\cong\text{PSL}(2,2^n)\), \(n>1\), and \(A\) is Abelian. (c) Suppose that \(G\) is a perfect group with \(c=2\). Then one of the following occurs: (i) \(G\cong\text{PSL}(2,q)\) for an odd prime power \(q>5\). (ii) \(G\cong\text{SL}(2,q)\) for an odd prime power \(q\geq 5\). (iii) \(G\) has a normal subgroup \(L\) so that \(G/L\cong\text{SL}(2,q)\) for some prime power \(q\geq 4\), \(L\) is elementary Abelian of order \(q^2\), and \(G/L\) acts transitively on \(\text{Irr}(L)-\{1_L\}\). If \(q\) is odd, then \(G\) splits over \(L\). Using the above results, the authors classify, in Theorem 6.3, the nonsolvable disconnected groups. Corrigendum: From the text: We are grateful to Silvio Dolfi for pointing out that Lemma 5.1 in the paper cited in the heading is false. Here we give corrected versions of the proofs of Lemmas 5.2 and 5.3. Because Lemma 5.1 is not used elsewhere, the remainder of the published paper remains true. This corrigendum replaces Section 5 of the published paper.
    0 references
    prime graphs
    0 references
    character degrees
    0 references
    finite simple groups
    0 references
    connected components
    0 references
    irreducible characters
    0 references
    finite perfect groups
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references