SearcharxivSearch

arXiv · 2007.12478

The virtually generating graph of a profinite group

Abstract

We consider the graph $\Gamma_{\rm{virt}}(G)$ whose vertices are the elements of a finitely generated profinite group $G$ and where two vertices $x$ and $y$ are adjacent if and only if they topologically generate an open subgroup of $G$. We investigate the connectivity of the graph $\Delta_{\rm{virt}}(G)$ obtained from $\Gamma_{\rm{virt}}(G)$ by removing its isolated vertices. In particular we prove that for every positive integer $t$, there exists a finitely generated prosoluble group $G$ with the property that $\Delta_{\rm{virt}}(G)$ has precisely $t$ connected components. Moreover we study the graph $\tilde \Gamma_{\rm{virt}}(G)$, whose vertices are again the elements of $G$ and where two vertices are adjacent if and only if there exists a minimal generating set of $G$ containing them. In this case we prove that the subgraph $\tilde \Delta_{\rm{virt}}(G)$ obtained removing the isolated vertices is connected and has diameter at most 3.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrea Lucchini. 2020-07-24. The virtually generating graph of a profinite group. https://doi.org/10.4153/s0008439520000843

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