All finite subdivision rules are combinatorially equivalent to three-dimensional subdivision rules

Abstract

Finite subdivision rules in high dimensions can be difficult to visualize and require complex topological structures to be constructed explicitly. In many applications, only the history graph is needed. We characterize the history graph of a subdivision rule, and define a combinatorial subdivision rule based on such graphs. We use this to show that a finite subdivision rule of arbitrary dimension is combinatorially equivalent to a three-dimensional subdivision rule. We use this to show that the Gromov boundary of special cubulated hyperbolic groups is a quotient of a compact subset of three-dimensional space, with connected preimages at each point.

Subdivision rules for all Gromov hyperbolic groups

“…The process of creating a history graph can be reversed; in [10], we defined a combinatorial subdivision graph as a graph Ξ which contains a family of disjoint subgraphs Ξn such that:…”