Infinite towers of tree lattices (Q5953002): Difference between revisions

Let \(X\) be a locally finite tree and \(G\) its automorphism group. Then \(G\) is a locally compact group in a natural way. A discrete subgroup \(\Gamma\subset G\) is called an \(X\)-lattice if \(\text{vol} (\Gamma \backslash \backslash X)\overset\text{def}=\sum_x {1\over|\Gamma_x|}\) is finite. Here the sum runs over all vertices of \(\Gamma\backslash X\) and \(\Gamma_x\) is the stabilizer of \(x\) in \(\Gamma\). In this situation it may happen that there exists an infinite tower \(\Gamma_1\subset \Gamma_2\subset \Gamma_3\subset \dots\) of \(X\)-lattices where the inclusions are of finite index and \(\text{vol} (\Gamma_i \backslash\backslash X)\to 0\) as \(i\to\infty\). \textit{H. Bass} and \textit{R. Kulkarni} have given in [J. Am. Math. Soc. 3, No. 4, 843--902 (1990; Zbl 0734.05052)] several examples of graphs \(X\) admitting towers \((\Gamma_j)\) as above. In the present paper a general criterion is stated ensuring the existence of a tower.