Quasirecognition by prime graph of \(^2D_p(3)\) where \(p=2^n+1\geq 5\) is a prime. (Q730779)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Quasirecognition by prime graph of ^2D_p(3) where p=2ⁿ+1 5 is a prime. |
scientific article; zbMATH DE number 5609685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quasirecognition by prime graph of \(^2D_p(3)\) where \(p=2^n+1\geq 5\) is a prime. |
scientific article; zbMATH DE number 5609685 |
Statements
Quasirecognition by prime graph of \(^2D_p(3)\) where \(p=2^n+1\geq 5\) is a prime. (English)
0 references
1 October 2009
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
0.956797182559967
0 references
0.9346016049385072
0 references
0.9241045713424684
0 references
0.9026070237159728
0 references
0.8887767195701599
0 references
