Jump to content

Uniform tree

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by BagLuke (talk | contribs) at 20:34, 27 January 2025 (Added illustration and description.). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Section of the uniform tree for graph

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

[edit]
  • Bass, Hyman; Lubotzky, Alexander (2001), Tree Lattices, Progress in Mathematics, vol. 176, Birkhäuser, ISBN 0-8176-4120-3