SearcharxivSearch

arXiv · 2006.03764

Genus of commuting conjugacy class graph of groups

Abstract

For a non-abelian group $G$, its commuting conjugacy class graph $\mathcal{CCC}(G)$ is a simple undirected graph whose vertex set is the set of conjugacy classes of the non-central elements of $G$ and two distinct vertices $x^G$ and $y^G$ are adjacent if there exists some elements $x' \in x^G$ and $y' \in y^G$ such that $x'y' = y'x'$. In this paper we compute the genus of $\mathcal{CCC}(G)$ for six well-known classes of non-abelian two-generated groups (viz. $D_{2n}, SD_{8n}, Q_{4m}, V_{8n}, U_{(n, m)}$ and $G(p, m, n)$) and determine whether $\mathcal{CCC}(G)$ for these groups are planar, toroidal, double-toroidal or triple-toroidal.

Explore related subjects

Keep this discovery

BibTeXRIS

Parthajit Bhowal, Rajat Kanti Nath. 2020-06-06. Genus of commuting conjugacy class graph of groups. https://arxiv.org/abs/2006.03764

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