The N-prime graph and the Subgroup Isomorphism Problem
Emanuele Pacifici, Angel del Rio, Marco Vergani

TL;DR
This paper introduces the N-prime graph, a new refinement of the Gruenberg-Kegel graph, to analyze subgroup structures and unit groups in integral group rings, providing new insights into the Subgroup Isomorphism Problem.
Contribution
It defines the N-prime graph and proves its equivalence for units and the group in certain classes, advancing understanding of subgroup structures and the Subgroup Isomorphism Problem.
Findings
The N-prime graph of units matches that of the group for finite solvable groups.
The N-prime graph equality holds for almost simple groups with specific socles.
Stronger results for solvable groups relate Frobenius subgroups in units to those in the group.
Abstract
We introduce a directed graph related to a group , which we call the N-prime graph of and which is a refinement of the classical Gruenberg-Kegel graph. The vertices of are the primes such that has an element of order , and, for distinct vertices and , the arc is in the graph if and only if has a subgroup of order whose normalizer in has an element of order . Generalizing some known results about the Gruenberg-Kegel graph, we prove that the group of the units with augmentation in the integral group ring has the same N-prime graph as if is a finite solvable group, and we reduce to almost simple groups the problem of whether holds for any finite group . We also prove that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Rings, Modules, and Algebras · graph theory and CDMA systems
