Searcharxiv⌕ Search

arXiv · 2611.16111

Subgroup distortion in free-by-cyclic groups with linearly growing monodromy

Abstract

Let $G=F\rtimes_ϕ\mathbb Z$ be the mapping torus of a linearly growing UPG automorphism $ϕ$ of a finitely generated free group $F$. We compute the distortion of every finitely generated subgroup $H$ of $G$, and we show that it is linear, quadratic or exponential. In contrast, for each $d\ge2$, Dison and Riley constructed an automorphism of polynomial degree $d$ whose mapping torus contains a free subgroup with distortion equivalent to the Ackermann function $A_{d+1}$, which grows faster than every iterated exponential function. Using the natural splitting of $G$ over $\mathbb Z^2$ subgroups and its topological representative, we associate to $H$ a family of \emph{horizontal components}, together with \emph{dilation homomorphisms} defined from slopes along these components. We prove that $H$ is undistorted in $G$ if and only if every horizontal component of $H$ consists of only one piece. Otherwise, the distortion of $H$ is quadratic if all dilation homomorphisms are trivial, and exponential if one of them is nontrivial. Along the way, we show that the distortion of $H$ is determined, up to superadditive closure, by the distortions of the stabilizers of its horizontal components.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hoang Thanh Nguyen. 2026-11-11. Subgroup distortion in free-by-cyclic groups with linearly growing monodromy. https://searcharxiv.com/abs/2611.16111

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗