Maps related to Grigorchuk's group (Q627937)

The maps studied in this paper can be described as follows. Let \(\Delta\) be a triangle in the hyperbolic plane \({\mathbb H}^2\) with angles \(0,\pi/2,0\), and let \(\Gamma\) be the group generated by reflections \(p_0,p_1,p_2\) in the edges of \(\Delta\). The images of \(\Delta\) under \(\Gamma\) tessellate \({\mathbb H}^2\), and the images of \(p_0\) and \(p_0p_1\) form the vertices and edges of the \textit{universal map} on \({\mathbb H}^2\). Given a transitive permutation representation \(\Theta\) of \(\Gamma\), the quotient of the universal map by a point stabilizer in \(\Gamma\) is a map. There is also a combinatorial construction. The \textit{growth rate} of a map is defined analogously to the growth rate of a graph (such as the Cayley graph of a group). The author shows that a map has polynomial, intermediate, or exponential growth when the corresponding group does. Grigorchuk's group is a group which acts on the infinite binary tree. It is a permutation representation of \(\Gamma\), and thus generates a map \(\mathcal G\). The group \(G\), and thus the map \(\mathcal G\), have intermediate growth. The compact and non-compact maps corresponding to quotients of \(\mathcal G\) (generated by subgroups of \(G\)) are also described, and it is shown how these ideas can be extended to generalized Grigorchuk groups.