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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jpaa.2004.11.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046609450 / rank
 
Normal rank

Revision as of 20:14, 19 March 2024

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