Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2108.10814

On the intersections of finitely generated subgroups of free groups: reduced rank to full rank

Marco Linton
View original source ↗Read source document ↗Export metadata ↓

Abstract

We show that the number of conjugacy classes of intersections $A\cap B^g$, for fixed finitely generated subgroups $A, B<F$ of a free group, is bounded above in terms of the ranks of $A$ and $B$; this confirms an intuition of Walter Neumann. This result was previously known only in the case where $A$ or $B$ is cyclic by the $w$-cycles theorem of Helfer and Wise and, independently, Louder and Wilton. In order to prove our main theorem, we introduce new results regarding the structure of fibre products of finite graphs. We work with a generalised definition of graph immersions so that our results apply to the theory of regular languages. For example, we give a new algorithm to decide non-emptiness of the intersection of two regular languages.

Explore related subjects

math.GRcs.FL

Keep this discovery

BibTeXRIS

Marco Linton. 2021-08-24. On the intersections of finitely generated subgroups of free groups: reduced rank to full rank. https://arxiv.org/abs/2108.10814

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗