Quasirecognition by prime graph of finite simple groups \(L_n(2)\) and \(U_n(2)\).
DOI10.1007/s10474-010-0053-3zbMath1232.20020MaRDI QIDQ653863
Hossein Moradi, Behrooz Khosravi
Publication date: 19 December 2011
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10474-010-0053-3
finite simple groups; unitary groups; linear groups; prime graphs; sets of element orders; quasirecognition; quasirecognizable groups; non-Abelian composition factors; recognition of finite simple groups
20D60: Arithmetic and combinatorial problems involving abstract finite groups
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
20D05: Finite simple groups and their classification
20D06: Simple groups: alternating groups and groups of Lie type
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasirecognition by prime graph of \(F_4(q)\) where \(q=2^n>2\).
- NCF-distinguishablity by prime graph of \(\text{PGL}(2,p)\) where \(p\) is a prime
- Quasirecognition by the prime graph of the group \(C_n(2)\), where \(n\neq 3\) is odd.
- Quasirecognition by prime graph of \(^2D_p(3)\) where \(p=2^n+1\geq 5\) is a prime.
- On element orders in coverings of the simple groups \(L_n(q)\) and \(U_n(q)\).
- A characterization of the finite simple group \(L_{16}(2)\) by its prime graph.
- On the prime graph of \(\text{PSL}(2,p)\) where \(p>3\) is a prime number.
- Quasirecognition by prime graph of the simple group \(^2F_4(q)\).
- CHARACTERIZATION BY PRIME GRAPH OF PGL(2, pk) WHERE p AND k > 1 ARE ODD
- An Adjacency Criterion for the Prime Graph of a Finite Simple Group
- Spectra of finite linear and unitary groups
- n-RECOGNITION BY PRIME GRAPH OF THE SIMPLE GROUP PSL(2,q)
- Involutions in Chevalley groups over fields of even order
- The Prime Graph of a Sporadic Simple Group
- Recognition of finite groups by the prime graph