SearcharxivSearch

arXiv · 2207.03193

Commuting graph of a group action with few edges

Abstract

Let $A$ be a group acting by automorphisms on the group $G.$ \textit{The commuting graph $\Gamma(G,A)$ of $A$-orbits} of this action is the simple graph with vertex set $\{x^{A} : 1\ne x \in G \}$, the set of all $A$-orbits on $G\setminus \{1\}$, where two distinct vertices $x^{A}$ and $y^{A}$ are joined by an edge if and only if there exist $x_{1}\in x^{A}$ and $y_{1}\in y^{A}$ such that $[x_{1},y_{1}]=1$. The present paper characterizes the groups $G$ for which $\Gamma(G,A)$ is an $\mathcal{F}$-graph, that is, a connected graph which contains at most one vertex whose degree is not less than three.

Explore related subjects

Keep this discovery

BibTeXRIS

İsmail Ş. Güloğlu, Gülin Ercan. 2022-07-07. Commuting graph of a group action with few edges. https://arxiv.org/abs/2207.03193

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