Trees of Graphs as Boundaries of Hyperbolic Groups
Nima Hoda, Jacek Świątkowski
TL;DR
This work provides a complete characterization of when a 1-ended word hyperbolic group G has a Gromov boundary ∂G homeomorphic to a tree of graphs. The authors develop a robust framework of tree systems and their limits to realize ∂G as a limit object, and connect this with the reduced Bowditch JSJ splitting, introducing rigid cluster factors and abstract/flexible factors via Whitehead graphs. They prove the equivalence between boundary type (tree of graphs or regular tree of 2-connected graphs) and algebraic data (virtually free rigid cluster factors) and give an explicit description of the boundary as a regular tree of graphs arising from a graphical connecting system R_G associated to the Bowditch JSJ splitting. The results yield concrete structural descriptions, including detailed cases with θ-graphs and Whitehead graphs, and identify a broad class of examples (e.g., right-angled Coxeter groups) where the boundary can be realized as explicit regular trees of graphs. Overall, the paper links topological boundaries to JSJ-based decompositions, enabling explicit, computable descriptions of ∂G in dimension 1 with broad implications for understanding hyperbolic group boundaries.
Abstract
We characterize those 1-ended word hyperbolic groups whose Gromov boundaries are homeomorphic to trees of graphs (i.e. to inverse limits of graphs that have particularly simple finitary descriptions). These are groups with the simplest connected Gromov boundaries of topological dimension 1. The characterization is expressed in terms of algebraic properties of the Bowditch JSJ splitting of the corresponding groups (i.e. the canonical JSJ splitting over 2-ended subgroups).
