Non-Uniform Lattices on Uniform Trees
Part of the Progress in Mathematics book series (PM, volume 176)
- 346 Downloads
Consider a locally finite tree X, a subgroup \(H \leqslant G = Aut(X)\) without inversions, and indexed quotient graph \((A,i) = I(H\backslash \backslash X).\)
KeywordsDouble Cover Tree Lattice Terminal Vertex Vertex Graph Uniform Tree
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.
Unable to display preview. Download preview PDF.
© Birkhäuser Boston 2001