The N-prime graph and the Subgroup Isomorphism Problem

Abstract

We introduce a directed graph related to a group G, which we call the N-prime graph N(G) of G and which is a refinement of the classical Gruenberg-Kegel graph. The vertices of N(G) are the primes p such that G has an element of order p, and, for distinct vertices p and q, the arc q→ p is in the graph if and only if G has a subgroup of order p whose normalizer in G has an element of order q. Generalizing some known results about the Gruenberg-Kegel graph, we prove that the group V(Z G) of the units with augmentation 1 in the integral group ring Z G has the same N-prime graph as G if G is a finite solvable group, and we reduce to almost simple groups the problem of whether N(V(Z G))=N(G) holds for any finite group G. We also prove that N(V(Z G))=N(G) if G is almost simple with socle either an alternating group, or PSL(rf) with r prime and f 2. Finally, for G solvable we obtain some stronger results which give a contribution to the Subgroup Isomorphism Problem. More precisely, we prove that if V(Z G) contains a Frobenius subgroup T with kernel of prime order and complement of prime power order, then G contains a subgroup isomorphic to T.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…