Quasirecognition by prime graph of finite simple groups \(L_n(2)\) and \(U_n(2)\). (Q653863): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 09:51, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Quasirecognition by prime graph of finite simple groups \(L_n(2)\) and \(U_n(2)\). |
scientific article |
Statements
Quasirecognition by prime graph of finite simple groups \(L_n(2)\) and \(U_n(2)\). (English)
0 references
19 December 2011
0 references
Let \(G\) be a finite group and the prime graph \(\Gamma(G)\) of \(G\) is defined as follows: the vertices of \(\Gamma(G)\) are the primes dividing the order \(|G|\) and two distinct vertices \(p,q\) are joined by an edge if \(G\) has an element of order \(pq\) [see \textit{J. S. Williams}, J. Algebra 69, 487-513 (1981; Zbl 0471.20013)]. A finite non-Abelian simple \(S\) is said to be quasirecognizable by prime graph if \(G\) with \(\Gamma(G)=\Gamma(S)\) has a unique nonabelian composition factor isomorphic to \(S\). In this paper, the authors prove that the simple groups \(L_n(2)\) and \(U_n(2)\) are quasirecognizable. As a consequence of the above result the authors give a new proof for the recognition by element orders of \(L_n(2)\).
0 references
prime graphs
0 references
finite simple groups
0 references
linear groups
0 references
unitary groups
0 references
quasirecognition
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