\(r\)-recognizability of \(B_n(q)\) and \(C_n(q)\) where \(n=2^m\geqslant 4\). (Q555968)

From MaRDI portal
scientific article
Language Label Description Also known as
English
\(r\)-recognizability of \(B_n(q)\) and \(C_n(q)\) where \(n=2^m\geqslant 4\).
scientific article

    Statements

    \(r\)-recognizability of \(B_n(q)\) and \(C_n(q)\) where \(n=2^m\geqslant 4\). (English)
    0 references
    0 references
    0 references
    10 June 2005
    0 references
    0 references
    order components
    0 references
    prime graphs
    0 references
    finite simple groups
    0 references
    sets of element orders
    0 references
    recognizable groups
    0 references
    0 references