SearcharxivSearch

arXiv · 2511.01809

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 $\Gamma_{\rm{N}}(G)$ of $G$ and which is a refinement of the classical Gruenberg-Kegel graph. The vertices of $\Gamma_{\rm{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\rightarrow 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(\mathbb{Z} G)$ of the units with augmentation $1$ in the integral group ring $\mathbb{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 $\Gamma_{\rm{N}}(V(\mathbb{Z} G))=\Gamma_{\rm{N}}(G)$ holds for any finite group $G$. We also prove that $\Gamma_{\rm{N}}(V(\mathbb{Z} G))=\Gamma_{\rm{N}}(G)$ if $G$ is almost simple with socle either an alternating group, or ${\rm{PSL}}(r^f)$ with $r$ prime and $f\le 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(\mathbb{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$.

Explore related subjects

Keep this discovery

BibTeXRIS

Emanuele Pacifici, Angel del Rio, Marco Vergani. 2025-11-03. The N-prime graph and the Subgroup Isomorphism Problem. https://arxiv.org/abs/2511.01809

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR