SearcharxivSearch

arXiv · 2512.12635

The finitely generated intersection property in fundamental groups of graphs of groups

Abstract

A group $G$ is said to satisfy the finitely generated intersection property (f.g.i.p.) if the intersection of any two finitely generated subgroups of $G$ is again finitely generated. The aim of this article is to understand when the fundamental group of a graph of groups has the f.g.i.p. Our main results are general criteria for the f.g.i.p. in graphs of groups which depend on properties of the vertex groups, properties of certain double cosets of the edge groups and the structure of the underlying graph. For acylindrical graphs of groups, we also obtain criteria for the strong f.g.i.p. (s.f.g.i.p.). Our results generalise classical results due to Burns and Cohen on the f.g.i.p. for amalgamated free products and HNN extensions. As a concrete application, we show that a graph of locally quasi-convex hyperbolic groups with virtually $\mathbb{Z}$ edge groups (for instance, a generalised Baumslag--Solitar group) has the f.g.i.p. if and only if it does not contain $F_2\times\mathbb{Z}$ as a subgroup. In addition, we show that this condition is decidable. The main tools we use are the explicit constructions of pullbacks of immersions into a graph of group, obtained by the authors in a previous paper, and a technical condition on coset interactions, introduced in this paper.

Explore related subjects

Keep this discovery

BibTeXRIS

Jordi Delgado, Marco Linton, Jone Lopez de Gamiz Zearra, Mallika Roy, Pascal Weil. 2025-12-14. The finitely generated intersection property in fundamental groups of graphs of groups. https://arxiv.org/abs/2512.12635

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