Jump to content

Uniform tree

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 128.176.183.133 (talk) at 13:53, 2 September 2008 (Uniform tree). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Uniform tree

Template:AFC pending

A uniform tree is a locally finite tree which is the universal cover of a finite graph. Equivalently, the full automorphism group of the tree, which is a locally compact topological group is unimodular and 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