A graph-theoretical characterisation of subgroups of Thompson's group $V$

Abstract

We prove a graph-theoretical characterisation of finitely generated subgroups of Thompson's group $V$: a finitely generated group embeds in $V$ if and only if it admits a faithful context-free action, or equivalently if it belongs to the class CF-TR of transition groups of context-free graphs recently introduced by Matucci and the three last authors. Using this characterisation, we prove results in different directions: - All known examples of groups with co-context-free Word Problem do embed in $V$, providing evidence towards Lehnert's conjecture. - Each finitely generated subgroup of $V$ is either virtually abelian, or contains a free non-abelian semigroup. It follows that groups of intermediate growth do not embed in Thompson's $V$. We further study the relation between transition groups defined by graphs that are limits or covers of each others, and prove properties of transition groups of context-free graphs of polynomial growth. Finally, we prove that the Basilica and Hanoï Towers groups do not embed in $V$. This uses the geometry of Schreier graphs of the natural actions of these groups and of Thompson's $V$.

Preliminary version. 44 pages, 19 figures