Quasirecognition by prime graph of F₄(q) where q=2ⁿ>2.
DOI10.1007/S00605-009-0155-6zbMATH Open1216.20007OpenAlexW1969128811MaRDI QIDQ633261FDOQ633261
Authors: Behrooz Khosravi, Azam Babai
Publication date: 31 March 2011
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00605-009-0155-6
Recommendations
- Quasirecognition by prime graph of the simple group \(^2F_4(q)\).
- Quasirecognition by prime graph of the simple group \(^2G_2(q)\).
- Quasirecognition by prime graph of \(L_n(2^\alpha)\) for some \(n\) and \(\alpha\)
- Quasirecognition by prime graph of \(C_n(4)\), where \(n\geq 17\) is odd
- Quasirecognition by prime graph of \(^2D_n(3^\alpha)\) where \(n=4m+1\geq 21\) and \(\alpha\) is odd
prime graphssets of element ordersquasirecognitionquasirecognizable groupsnon-Abelian composition factorsrecognition of finite simple groups
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Simple groups: alternating groups and groups of Lie type (20D06) Arithmetic and combinatorial problems involving abstract finite groups (20D60)
Cites Work
- Title not available (Why is that?)
- Prime graph components of finite groups
- A Diophantine equation which arises in the theory of finite groups
- An Adjacency Criterion for the Prime Graph of a Finite Simple Group
- Title not available (Why is that?)
- Title not available (Why is that?)
- Endliche Gruppen I
- Recognition of finite groups by the prime graph
- Quasirecognition by prime graph of the simple group \(^2F_4(q)\).
- Quasirecognition by prime graph of the simple group \(^2G_2(q)\).
- 2-recognizability by prime graph of \(\text{PSL}(2,p^2)\).
- n-RECOGNITION BY PRIME GRAPH OF THE SIMPLE GROUP PSL(2,q)
- Decomposition of the Augmentation Ideal and of the Relation Modules of a Finite Group
- The Prime Graph of a Sporadic Simple Group
- Groups with the same prime graph as a CIT simple group.
- Quasirecognition by prime graph of \(^2D_p(3)\) where \(p=2^n+1\geq 5\) is a prime.
- On the prime graph of \(\text{PSL}(2,p)\) where \(p>3\) is a prime number.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recognition by spectrum of the groups \(^2D_{2^m+1}(3)\).
- Title not available (Why is that?)
Cited In (13)
- Quasirecognition by prime graph of \(^2D_n(3^\alpha)\) where \(n=4m+1\geq 21\) and \(\alpha\) is odd
- Groups with the same prime graph as the simple group \(D_n(5)\).
- Quasirecognition by prime graph of some orthogonal groups over the binary field.
- Title not available (Why is that?)
- On the composition factors of a group with the same prime graph as B n (5)
- ON COMPOSITION FACTORS OF A GROUP WITH THE SAME PRIME GRAPH AS Ln(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.
- 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)\).
- Quasirecognition by prime graph of the simple group \(^2F_4(q)\).
- Criterion of unrecognizability of a finite group by its Gruenberg-Kegel graph
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)