Constructing tree lattices

From MaRDI portal





The author describes how to construct tree lattices. She focuses on the construction of nonuniform tree lattices. The task is a complex and interesting mixture of graph theory, combinatorics and finite group theory. A uniform tree is a tree that covers a finite connected graph. Let \(X\) be any locally finite tree. Then \(G= \Aut(X)\) is a locally compact group. The author proves that if \(X\) is uniform, and if \(G\) is not discrete and acts minimally on \(X\), then \(G\) contains nonuniform lattices. For the entire collection see [Zbl 0939.00025].











This page was built for publication: Constructing tree lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4495678)