{
  "aliases": [
    "mckay-correspondence"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn mathematics, the **McKay graph** of a finite-dimensional representation $V$ of a finite group $G$ is a weighted quiver encoding the structure of the representation theory of $G$. Each node represents an irreducible representation of $G$. If $\\chi_{i}, \\chi_{j}$ are irreducible representations of $G$, then there is an arrow from $\\chi_{i}$ to $\\chi_{j}$ if and only if $\\chi_{j}$ is a constituent of the [[tensor product|0BF2DE2SYK]] $V\\otimes\\chi_i.$ Then the weight $n_{ij}$ of the arrow is the number of times this constituent appears in $V \\otimes\\chi_i.$ For finite [[subgroups|0X1JXT47GA]] $H$ of $\\text{GL}(2, \\mathbb{C}),$ the McKay graph of $H$ is the McKay graph of the defining 2-dimensional representation of $H$.\n",
  "commit": "a799a9852bcfeae9dc83faa3bef60208bb53686b",
  "front": {
    "aliases": [
      "mckay-correspondence"
    ],
    "inventory": [
      "NMWZQG6VVC"
    ],
    "kind": "concept",
    "name": "McKay graph",
    "same_as": {
      "wikidata": "Q6801707",
      "wikipedia": "McKay graph"
    },
    "sources": [
      {
        "locator": "McKay graph",
        "mention": "wikipedia://en/34080241",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:34080241@r1366267521"
      }
    ],
    "tag": "1H7X0R5PSQ"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/1H7X0R5PSQ/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/1H7X0R5PSQ.md",
  "msc": null,
  "name": "McKay graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/1H7/1H7X0R5PSQ.md",
  "status": null,
  "tag": "1H7X0R5PSQ",
  "uri": "m2://1H7X0R5PSQ",
  "url": "https://math2.tamnd.com/wiki/mckay-graph/",
  "writing": {
    "tag": "1H7X0R5PSQ",
    "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
      }
    ]
  }
}