SearcharxivSearch

arXiv · 2607.18880

Prime and N-Prime graphs of solvable uniformly semi-rational groups

Abstract

In this paper, we study the prime graph, also known as Gruenberg-Kegel graph, realizable by finite solvable uniformly semi-rational groups. This is primarily achieved by classifying the prime graphs realizable by metanilpotent groups. We also introduce a new class of groups, called MP* groups, which extends the class of groups with Magnus property and forms a natural subclass of uniformly semi-rational groups. For MP* groups, we give a complete classification of the prime graphs realized by them. In the process, we obtain the realizability of prime graphs by uniformly semi-rational groups, assuming them to be in varied substantial subclasses of solvable groups, namely, 2-Frobenius, metacyclic, metabelian, nilpotent-by-abelian, abelian-by-cyclic and cyclic-by-abelian. We also classify the so called N-prime graphs for all these classes of groups. The prime graph question for uniformly semi-rational groups has also been addressed.

Explore related subjects

Keep this discovery

BibTeXRIS

Anu Jindal, Sugandha Maheshwary. 2026-07-21. Prime and N-Prime graphs of solvable uniformly semi-rational groups. https://arxiv.org/abs/2607.18880

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