Search arXivSearch

arXiv · 0807.2871

Algorithms and Classification in Groups of Piecewise-Linear Homeomorphisms

Abstract

This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's group F and suitable larger groups of piecewise-linear homeomorphisms of the unit interval. We determine algorithms to compute roots and centralizers in these groups and to detect periodic points and their behavior by looking at a particular diagram associated to an element. In the second part, we describe the structure of subgroups of the group of all homeomorphisms of the unit circle, with the additional requirement that they contain no non-abelian free subgroup. It is shown that in this setting the rotation number map is a group homomorphism. We give a classification of such subgroups as subgroups of certain wreath products and we show that such subgroups can exist by building examples. Similar techniques are then used to compute centralizers in these groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Francesco Matucci. 2008-07-18. Algorithms and Classification in Groups of Piecewise-Linear Homeomorphisms. https://arxiv.org/abs/0807.2871

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