SearcharxivSearch

arXiv · 1501.00839

The geometry of profinite graphs revisited

Abstract

For a formation $\mathfrak{F}$ of finite groups, tight connections are established between the pro-$\mathfrak{F}$-topology of a finitely generated free group $F$ and the geometry of the Cayley graph $Γ(\hat{F_{\mathfrak{F}}})$ of the pro-$\mathfrak{F}$-completion $\hat{F_{\mathfrak {F}}}$ of $F$. For example, the Ribes--Zalesskii-Theorem is proved for the pro-$\mathfrak{F}$-topology of $F$ in case $Γ(\hat{F_{\mathfrak F}})$ is a tree-like graph. All these results are established by purely geometric proofs, without the use of inverse monoids which were indispensable in earlier papers, thereby giving more direct and more transparent proofs. Due to the richer structure provided by formations (compared to varieties), new examples of (relatively free) profinite groups with tree-like Cayley graphs are constructed. Thus, new topologies on $F$ are found for which the Ribes-Zalesskii-Theorem holds.

Explore related subjects

Keep this discovery

BibTeXRIS

K. Auinger. 2016-01-21. The geometry of profinite graphs revisited. https://arxiv.org/abs/1501.00839

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