SearcharxivSearch

arXiv · 1109.5007

Commutativity pattern of finite non-abelian $p$-groups determine their orders

Abstract

Let $G$ be a non-abelian group and $Z(G)$ be the center of $G$. Associate a graph $Γ_G$ (called non-commuting graph of $G$) with $G$ as follows: take $G\setminus Z(G)$ as the vertices of $Γ_G$ and join two distinct vertices $x$ and $y$, whenever $xy\neq yx$. Here, we prove that "the commutativity pattern of a finite non-abelian $p$-group determine its order among the class of groups"; this means that if $P$ is a finite non-abelian $p$-group such that $Γ_P\cong Γ_H$ for some group $H$, then $|P|=|H|$.

Explore related subjects

Keep this discovery

BibTeXRIS

A. Abdollahi, S. Akbari, H. Dorbidi, H. Shahverdi. 2011-09-23. Commutativity pattern of finite non-abelian $p$-groups determine their orders. https://arxiv.org/abs/1109.5007

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