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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20D06 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20D60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 2175023 / rank
 
Normal rank
Property / zbMATH Keywords
 
order components
Property / zbMATH Keywords: order components / rank
 
Normal rank
Property / zbMATH Keywords
 
prime graphs
Property / zbMATH Keywords: prime graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
finite simple groups
Property / zbMATH Keywords: finite simple groups / rank
 
Normal rank
Property / zbMATH Keywords
 
sets of element orders
Property / zbMATH Keywords: sets of element orders / rank
 
Normal rank
Property / zbMATH Keywords
 
recognizable groups
Property / zbMATH Keywords: recognizable groups / rank
 
Normal rank

Revision as of 14:43, 1 July 2023

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