Existence of Tree Lattices
Hyman E. Bass, Alexander Lubotzky · Birkhäuser Boston eBooks · 2001
Let X be a locally finite tree, and G = Aut( X ). When does X admit a—uniform, or non-uniform—lattice? We would like to answer this in terms of properties of the edge-indexed quotient graph I ( G \\ X ) (cf. (2.4) and (2.5)). These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.