SearcharxivSearch

arXiv · 2605.20658

Generalized quaternion NCI-groups, NNN-groups and NNND-groups

Abstract

A Cayley (di)graph $\Cay(G,S)$ of a finite group $G$ is called CI if, for every Cayley (di)graph $\Cay(G,T)$ of $G$, $\Cay(G,S)\cong \Cay(G,T)$ implies that $S^{\sigma}=T$ for some $\sigma\in \Aut(G)$. The group $G$ is called an NDCI-group (resp. NCI-group) if every normal Cayley digraph (resp. graph) of $G$ is CI. It was shown that the generalized quaternion group $\Q_{4n}$ of order $4n$ ($n\geq 2$) is an NDCI-group if and only if either $n=2$ or $n$ is odd, but its NCI-group classification has been left as an open question. In this paper, we solve the question and prove that $\Q_{4n}$ is an NCI-group for every $n\geq 2$. A normal Cayley (di)graph of a group $G$ is called NNN if its automorphism group contains a non-normal regular subgroup isomorphic to $G$, and $G$ is called an NNND-group (resp. NNN-group) if it admits an NNN Cayley digraph (resp. graph). In this paper, we show that $\Q_{4n}$ is not an NNN-group for every $n\geq 2$, and is an NNND-group if and only if $n\geq 6$ and $n$ is even.

Explore related subjects

Keep this discovery

BibTeXRIS

Jun-Feng Yang, jia-Li Du, Yan-Quan Feng, Young Soo Kwon. 2026-05-20. Generalized quaternion NCI-groups, NNN-groups and NNND-groups. https://arxiv.org/abs/2605.20658

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