SearcharxivSearch

arXiv · 1810.03508

The generating graph of the abelian groups

Abstract

For a group $G,$ let $\Gamma(G)$ denote the graph defined on the elements of $G$ in such a way that two distinct vertices are connected by an edge if and only if they generate $G$. Moreover let $\Gamma^*(G)$ be the subgraph of $\Gamma(G)$ that is induced by all the vertices of $\Gamma(G)$ that are not isolated. We prove that if $G$ is a 2-generated non-cyclic abelian group then $\Gamma^*(G)$ is connected. Moreover $\mathrm{diam}(\Gamma^*(G))=2$ if the torsion subgroup of $G$ is non-trivial and $\mathrm{diam}(\Gamma^*(G))=\infty$ otherwise. If $F$ is the free group of rank 2, then $\Gamma^*(F)$ is connected and we deduce from $\mathrm{diam}(\Gamma^*(\mathbb{Z}\times \mathbb{Z}))=\infty$ that $\mathrm{diam}(\Gamma^*(F))=\infty.$

Explore related subjects

Keep this discovery

BibTeXRIS

Cristina Acciarri, Andrea Lucchini. 2018-10-08. The generating graph of the abelian groups. https://arxiv.org/abs/1810.03508

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