SearcharxivSearch

arXiv · 1605.05387

On the stabilizers of finite sets of numbers in the R. Thompson group $F$

Abstract

We study subgroups $H_U$ of the R. Thompson group $F$ which are stabilizers of finite sets $U$ of numbers in the interval $(0,1)$. We describe the algebraic structure of $H_U$ and prove that the stabilizer $H_U$ is finitely generated if and only if $U$ consists of rational numbers. We also show that such subgroups are isomorphic surprisingly often. In particular, we prove that if finite sets $U\subset [0,1]$ and $V\subset [0,1]$ consist of rational numbers which are not finite binary fractions, and $|U|=|V|$, then the stabilizers of $U$ and $V$ are isomorphic. In fact these subgroups are conjugate inside a subgroup $\bar F<\Homeo([0,1])$ which is the completion of $F$ with respect to what we call the Hamming metric on $F$. Moreover the conjugator can be found in a certain subgroup $\F < \bar F$ which consists of possibly infinite tree-diagrams with finitely many infinite branches. We also show that the group $\F$ is non-amenable.

Explore related subjects

Keep this discovery

BibTeXRIS

Gili Golan, Mark Sapir. 2016-07-03. On the stabilizers of finite sets of numbers in the R. Thompson group $F$. https://arxiv.org/abs/1605.05387

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