SearcharxivSearch

arXiv · 2504.14703

On characterization of groups by isomorphism type of Gruenberg-Kegel graph

Abstract

The Gruenberg-Kegel graph (or the prime graph) $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of order $rs$ in $G$. A group $G$ is recognizable by isomorphism type of Gruenberg--Kegel graph if for every group $H$ the isomorphism between $\Gamma(H)$ and $\Gamma(G)$ as abstract graphs (i.\,e. unlabeled graphs) implies that $G\cong H$. In this paper, we prove that finite simple exceptional groups of Lie type ${^2}E_6(2)$ and $E_8(q)$ for $q \in \{3, 4, 5, 7, 8, 9, 17\}$ are recognizable by isomorphism type of Gruenberg-Kegel graph.

Explore related subjects

Keep this discovery

BibTeXRIS

Mingzhu Chen, Natalia V. Maslova, Marianna R. Zinov'eva. 2025-04-20. On characterization of groups by isomorphism type of Gruenberg-Kegel graph. https://arxiv.org/abs/2504.14703

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