Period growth and co-context-free groups
Alex Bishop, Corentin Bodart, Letizia Issini, Davide Perego
TL;DR
This work introduces period growth as an invariant and develops a general upper bound for co-context-free groups, linking it to decidability questions and the Torsion Problem. It then analyzes concrete families—Houghton groups, Thompson groups $T$ and $V$, and CF-TR groups—providing sharp asymptotics: $p_{H_m}(n)\asymp \exp(\sqrt{n\log n})$, $p_T(n)\asymp \exp(n)$, and $p_V(n)\asymp \exp(n^2)$, together with $p_V^D(n)\preceq \exp(n)$ under suitable $D$. The authors develop practical algorithms for computing element orders and rotation numbers in Thompson groups using marked strand diagrams and riffle-shuffle analyses, and prove that certain CF-TR groups (notably $B(C_2)$) embed in $V$ and exhibit exponential period growth, highlighting limits of current conjectures and posing several open problems. Overall, the paper links language-theoretic properties with geometric/group-theoretic growth phenomena, providing new tools and benchmarks for period growth in co-context-free and related groups.
Abstract
We study period growth in co-context-free groups, giving general results and looking at specific examples such as Thompson groups $T$ and $V$ and the Houghton groups $H_m$. Along the way, we give a refined upper bound on the word metric in Thompson $V$, as well as efficient algorithms to determine if elements of $V$ are torsion, and compute their order. We also adapt our algorithm to compute the rotation number of elements of $T$ and answer a question of D. Calegari.
