In mathematics, a uniform tree is a locally finite tree which is the universal cover of a finite graph. Equivalently, the full automorphism group G=Aut(X) of the tree, which is a locally compact topological group, is unimodular and G\X is finite. Also equivalent is the existence of a uniform X-lattice in G.
Sources
- Bass, Hyman; Lubotzky, Alexander (2001), Tree Lattices, Progress in Mathematics, vol. 176, Birkhäuser, ISBN 0-8176-4120-3
.svg){kind=small} | This combinatorics-related article is a stub. You can help Wikipedia by expanding it. |
In mathematics, a uniform tree is a locally finite tree which is the universal cover of a finite graph. Equivalently, the full automorphism group G=Aut(X) of the tree, which is a locally compact topological group, is unimodular and G\X is finite. Also equivalent is the existence of a uniform X-lattice in G.
Sources
- Bass, Hyman; Lubotzky, Alexander (2001), Tree Lattices, Progress in Mathematics, vol. 176, Birkhäuser, ISBN 0-8176-4120-3
|
| This combinatorics-related article is a stub. You can help Wikipedia by expanding it. |