Quasirecognition by prime graph of \(F_4(q)\) where \(q=2^n>2\).

DOI10.1007/s00605-009-0155-6zbMath1216.20007OpenAlexW1969128811MaRDI QIDQ633261

Azam Babai, Behrooz Khosravi

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

zbMATH Keywords

prime graphssets of element ordersquasirecognitionquasirecognizable groupsnon-Abelian composition factorsrecognition of finite simple groups

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Simple groups: alternating groups and groups of Lie type (20D06)

Related Items (11)

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) ⋮ Criterion of unrecognizability of a finite group by its Gruenberg-Kegel graph ⋮ Groups with the same prime graph as the orthogonal group \(B_n(3)\). ⋮ On characterization by Gruenberg-Kegel graph of finite simple exceptional groups of Lie type ⋮ On \(r\)-recognition by prime graph of \(B_p(3)\) where \(p\) is an odd prime. ⋮ 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)\). ⋮ 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 ⋮ ON COMPOSITION FACTORS OF A GROUP WITH THE SAME PRIME GRAPH AS Ln(5)

Cites Work

• 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.
• Recognition by spectrum of the groups \(^2D_{2^m+1}(3)\).
• Quasirecognition by prime graph of the simple group \(^2F_4(q)\).
• 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
• 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
• Recognition of finite groups by the prime graph
• Endliche Gruppen I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quasirecognition by prime graph of \(F_4(q)\) where \(q=2^n>2\).