SearcharxivSearch

arXiv · 1105.4017

Schreier graphs of actions of Thompson's group F on the unit interval and on the Cantor set

Abstract

Schreier graphs of the actions of Thompson's group $F$ on the orbits of all points of the unit interval and of the Cantor set with respect to the standard generating set $\{x_0,x_1\}$ are explicitly constructed. The closure of the space of pointed Schreier graphs of the action of $F$ on the orbits of dyadic rational numbers and corresponding Schreier dynamical system are described. In particular, we answer the question of Grigorchuk on the Cantor-Bendixson rank of the underlying space of the Schreier dynamical system in the context of $F$. As applications we prove that the pointed Schreier graphs of points from $(0,1)$ are amenable, have infinitely many ends, and are pairwise non-isomorphic. Moreover, we prove that points $x,y\in(0,1)$ have isomorphic non-pointed Schreier graphs if and only if they belong to the same orbit of $F$.

Explore related subjects

Keep this discovery

BibTeXRIS

Dmytro Savchuk. 2011-05-20. Schreier graphs of actions of Thompson's group F on the unit interval and on the Cantor set. https://arxiv.org/abs/1105.4017

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