SearcharxivSearch

arXiv · 2210.03564

Thompson's group $F$ is almost $\frac{3}{2}$-generated

Abstract

Recall that a group $G$ is said to be $\frac{3}{2}$-generated if every non-trivial element of $G$ belongs to a generating pair of $G$. Thompson's group $V$ was proved to be $\frac{3}{2}$-generated by Donoven and Harper in 2019. It was the first example of an infinite finitely presented non-cyclic $\frac{3}{2}$-generated group. Recently, Bleak, Harper and Skipper proved that Thompson's group $T$ is also $\frac{3}{2}$-generated. In this paper, we prove that Thompson's group $F$ is "almost" $\frac{3}{2}$-generated in the sense that every element of $F$ whose image in the abelianization forms part of a generating pair of $\mathbb{Z}^2$ is part of a generating pair of $F$. We also prove that for every non-trivial element $f\in F$ there is an element $g\in F$ such that the subgroup $\langle f,g\rangle$ contains the derived subgroup of $F$. Moreover, if $f$ does not belong to the derived subgroup of $F$, then there is an element $g\in F$ such that $\langle f,g\rangle$ has finite index in $F$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gili Golan. 2022-10-07. Thompson's group $F$ is almost $\frac{3}{2}$-generated. https://arxiv.org/abs/2210.03564

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