SearcharxivSearch

arXiv · 2608.01168

On context-free subgroups and R. Thompson's group $V$

Abstract

Consider $V_*$, the subgroup of R. Thompson's group $V$ which stabilises $0^\omega$ under the natural action upon the Cantor set, $\{0, 1\}^\omega$. Let $G_*$ be any subgroup of a finitely generated group $G$. We show that $G_*$ is a context-free subgroup of $G$ if and only if $G_*$ is a pullback of $V_*$ under a homomorphism $G \rightarrow V$. In particular, this shows the existence of a hardest context-free membership problem. As a consequence, we prove that a group $G$ embeds into $V$ if and only if it is the transition group of a finite union of context-free automata, or equivalently, if there exist finitely many context-free subgroups of $G$ whose cores intersect trivially.

Explore related subjects

Keep this discovery

BibTeXRIS

Henry Jaspars. 2026-08-02. On context-free subgroups and R. Thompson's group $V$. https://arxiv.org/abs/2608.01168

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