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

TL;DR

This paper investigates when the fundamental group of a graph of groups has the finitely generated intersection property, providing criteria based on vertex groups, cosets, and graph structure, with applications to hyperbolic groups.

Contribution

It offers new general criteria for the finitely generated intersection property in graphs of groups, extending classical results and applying to hyperbolic group structures.

Findings

Criteria for f.g.i.p. depending on vertex groups and coset properties.

Characterization of f.g.i.p. in graphs of locally quasi-convex hyperbolic groups.

Decidability of the f.g.i.p. condition in certain group configurations.

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.