Quasirecognition by prime graph of F₄(q) where q=2ⁿ>2.
From MaRDI portal
Publication:633261
Let \(G\) be a finite group. The set of all primes dividing \(|G|\) is denoted by \(\pi(G)\). The prime graph \(\Gamma(G)\) of \(G\) is defined as follows: the vertices are the elements of \(\pi(G)\), and two distinct vertices \(p,q\) are joined by an edge if and only if there is an element of order \(pq\) in \(G\). The authors prove that if \(G\) is a finite group such that \(\Gamma(G)=\Gamma(F_4(q))\), where \(q=2^n>2\), then \(G\) has a unique nonabelian composition factor and this factor is isomorphic to \(F_4(q)\).
Recommendations
- Quasirecognition by prime graph of the simple group \(^2F_4(q)\).
- Quasirecognition by prime graph of the simple group ^2G₂(q).
- Quasirecognition by prime graph of L_n(2^) for some n and
- Quasirecognition by prime graph of C_n(4), where n 17 is odd
- Quasirecognition by prime graph of \(^2D_n(3^\alpha)\) where \(n=4m+1\geq 21\) and \(\alpha\) is odd
Cites work
- 2-recognizability by prime graph of \(\text{PSL}(2,p^2)\).
- A Diophantine equation which arises in the theory of finite groups
- An Adjacency Criterion for the Prime Graph of a Finite Simple Group
- Decomposition of the Augmentation Ideal and of the Relation Modules of a Finite Group
- Endliche Gruppen I
- Groups with the same prime graph as a CIT simple group.
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 1099518 (Why is no real title available?)
- scientific article; zbMATH DE number 2039000 (Why is no real title available?)
- scientific article; zbMATH DE number 3294681 (Why is no real title available?)
- scientific article; zbMATH DE number 3197229 (Why is no real title available?)
- scientific article; zbMATH DE number 4183687 (Why is no real title available?)
- n-RECOGNITION BY PRIME GRAPH OF THE SIMPLE GROUP PSL(2,q)
- On the prime graph of \(\text{PSL}(2,p)\) where \(p>3\) is a prime number.
- Prime graph components of finite groups
- Quasirecognition by prime graph of \(^2D_p(3)\) where \(p=2^n+1\geq 5\) is a prime.
- Quasirecognition by prime graph of the simple group \(^2F_4(q)\).
- Quasirecognition by prime graph of the simple group ^2G₂(q).
- Recognition by spectrum of the groups \(^2D_{2^m+1}(3)\).
- Recognition of finite groups by the prime graph
- The Prime Graph of a Sporadic Simple Group
Cited in
(14)- Quasirecognition by prime graph of the simple group \(^2F_4(q)\).
- Criterion of unrecognizability of a finite group by its Gruenberg-Kegel graph
- Groups with the same prime graph as the simple group D_n(5).
- Quasirecognition by prime graph of \(^2D_n(3^\alpha)\) where \(n=4m+1\geq 21\) and \(\alpha\) is odd
- Quasirecognition by prime graph of some orthogonal groups over the binary field.
- On the composition factors of a group with the same prime graph as B n (5)
- Groups with the same prime graph as the orthogonal group \(B_n(3)\).
- On \(r\)-recognition by prime graph of \(B_p(3)\) where \(p\) is an odd prime.
- Quasirecognition by prime graph of C_n(4), where n 17 is odd
- On composition factors of a group with the same prime graph as \(L_n(5)\)
- scientific article; zbMATH DE number 5875511 (Why is no real title available?)
- On characterization by Gruenberg-Kegel graph of finite simple exceptional groups of Lie type
- Quasirecognition by prime graph of finite simple groups L_n(2) and U_n(2).
- Recognition by prime graph of \(^2D_{2^m+1}(3)\).
This page was built for publication: Quasirecognition by prime graph of \(F_4(q)\) where \(q=2^n>2\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633261)
