QUASIRECOGNITION BY PRIME GRAPH OF SOME ORTHOGONAL GROUPS OVER THE BINARY FIELD
DOI10.1142/S0219498812500569zbMath1244.20011OpenAlexW2143322682MaRDI QIDQ2892997
Behrooz Khosravi, Hossein Moradi
Publication date: 25 June 2012
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219498812500569
orthogonal groupsfinite simple groupsprime graphssets of element ordersrecognition by spectrumquasirecognitionquasirecognizable groupsnon-Abelian composition factorsrecognition of finite simple groups
Arithmetic and combinatorial problems involving abstract finite groups (20D60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite simple groups and their classification (20D05) Simple groups: alternating groups and groups of Lie type (20D06)
Related Items (4)
Cites Work
- Quasirecognition by prime graph of \(F_4(q)\) where \(q=2^n>2\).
- 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)\).
- 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.
- Certain embeddings among finite groups of Lie type
- \(A_ 1\)-type overgroups of elements of order \(p\) in semisimple algebraic groups and the associated finite groups
- CHARACTERIZATION BY PRIME GRAPH OF PGL(2, pk) WHERE p AND k > 1 ARE ODD
- RECOGNITION OF SOME FINITE SIMPLE GROUPS OF TYPE Dn(q) BY SPECTRUM
- An Adjacency Criterion for the Prime Graph of a Finite Simple Group
- n-RECOGNITION BY PRIME GRAPH OF THE SIMPLE GROUP PSL(2,q)
- The Prime Graph of a Sporadic Simple Group
- Quasirecognition by prime graph of simple group D_n(3)
This page was built for publication: QUASIRECOGNITION BY PRIME GRAPH OF SOME ORTHOGONAL GROUPS OVER THE BINARY FIELD