Math 2.0

Concept

Uniform tree

Summary

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)G=Aut(X) of the tree, which is a locally compact topological group, is unimodular and G/XG/X is finite. Also equivalent is the existence of a uniform X-lattice in GG.

Further reading

  1. Wikipedia, page 19146037, revision 1317749502, Uniform tree. adopted
About this page
TagR53ANW6ZTK
URIm2://R53ANW6ZTK
Kindconcept
WritingW1 stated
Same as
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.