Quasirecognition by prime graph of \(F_4(q)\) where \(q=2^n>2\). (Q633261)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Quasirecognition by prime graph of \(F_4(q)\) where \(q=2^n>2\).
scientific article

    Statements

    Quasirecognition by prime graph of \(F_4(q)\) where \(q=2^n>2\). (English)
    0 references
    31 March 2011
    0 references
    Let \(G\) be a finite group. The set of all primes dividing \(|G|\) is denoted by \(\pi(G)\). The prime graph \(\Gamma(G)\) of \(G\) is defined as follows: the vertices are the elements of \(\pi(G)\), and two distinct vertices \(p,q\) are joined by an edge if and only if there is an element of order \(pq\) in \(G\). The authors prove that if \(G\) is a finite group such that \(\Gamma(G)=\Gamma(F_4(q))\), where \(q=2^n>2\), then \(G\) has a unique nonabelian composition factor and this factor is isomorphic to \(F_4(q)\).
    0 references
    0 references
    0 references
    0 references
    0 references
    non-Abelian composition factors
    0 references
    recognition of finite simple groups
    0 references
    sets of element orders
    0 references
    quasirecognizable groups
    0 references
    prime graphs
    0 references
    quasirecognition
    0 references
    0 references
    0 references
    0 references