{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn mathematics, a **uniform tree** is a locally finite [[tree|062D9KXJB1]] which is the universal cover of a finite graph. Equivalently, the full [[automorphism group|0CWXCWP0Y0]] $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$.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "7ASE2SNWG2"
    ],
    "kind": "concept",
    "name": "Uniform tree",
    "same_as": {
      "wikidata": "Q7885123",
      "wikipedia": "Uniform tree"
    },
    "sources": [
      {
        "locator": "Uniform tree",
        "mention": "wikipedia://en/19146037",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:19146037@r1317749502"
      }
    ],
    "tag": "R53ANW6ZTK"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/R53ANW6ZTK/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/R53ANW6ZTK.md",
  "msc": null,
  "name": "Uniform tree",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/R53/R53ANW6ZTK.md",
  "status": null,
  "tag": "R53ANW6ZTK",
  "uri": "m2://R53ANW6ZTK",
  "url": "https://math2.tamnd.com/wiki/uniform-tree/",
  "writing": {
    "tag": "R53ANW6ZTK",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}
