Quasirecognition by prime graph of \(^2D_p(3)\) where \(p=2^n+1\geq 5\) is a prime.

zbMath1172.20015MaRDI QIDQ730779

Behrooz Khosravi, N. Hasani, Azam Babai

Publication date: 1 October 2009

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/55939

zbMATH Keywords

prime graphssets of element ordersquasirecognizable 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 (9)

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)\). ⋮ 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)\). ⋮ Groups with the same prime graph as the simple group \(D_n(5)\). ⋮ Recognizing simple \(K_4\)-groups by few special conjugacy class sizes ⋮ 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)

This page was built for publication: Quasirecognition by prime graph of \(^2D_p(3)\) where \(p=2^n+1\geq 5\) is a prime.