SearcharxivSearch

arXiv · 0809.1754

A note concerning a tidying procedure and contraction groups in non-metrizable, totally disconnected groups

Abstract

In a 2004 article, Udo Baumgartner and George Willis used ideas from the structure theory of totally disconnected, locally compact groups to achieve a better understanding of the contraction group U_f associated with an automorphism f of such a group G, assuming that G is metrizable. (Recall that U_f consists of all group elements x such that f^n(x) tends to the identity element as n tends to infinity). Recently, Wojciech Jaworski showed that the main technical tool of the latter article remains valid in the non-metrizable case. He asserted without proof that, therefore, all results from that article remain valid. However, metrizability enters the arguments at a second point. In this note, we resolve this difficulty, by providing an affirmative answer to a question posed by Willis in 2004.

Explore related subjects

Keep this discovery

BibTeXRIS

Helge Glockner. 2008-09-10. A note concerning a tidying procedure and contraction groups in non-metrizable, totally disconnected groups. https://arxiv.org/abs/0809.1754

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