Jump to content

Uniform tree

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Michael Hardy (talk | contribs) at 12:59, 5 September 2008. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, 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