{
  "aliases": null,
  "backlinks": [
    {
      "field": "proves",
      "target": "V282NG3QJR"
    }
  ],
  "body": "\n## Statement\n\nIn [[combinatorial|0JKW7W7XFR]] mathematics, the **labelled enumeration theorem** is the counterpart of the Pólya enumeration theorem for the labelled case, where we have a set of labelled objects given by an exponential generating function (EGF) *g*(*z*) which are being distributed into *n* slots and a permutation group *G* which permutes the slots, thus creating equivalence classes of configurations. There is a special re-labelling operation that re-labels the objects in the slots, assigning labels from 1 to *k*, where *k* is the total number of nodes, i.e. the sum of the number of nodes of the individual objects. The EGF $f_n(z)$ of the number of different configurations under this re-labelling process is given by\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "YAGE2H0J3X"
    ],
    "kind": "statement",
    "name": "Labelled enumeration theorem",
    "role": "proposition",
    "same_as": {
      "wikidata": "Q6466909",
      "wikipedia": "Labelled enumeration theorem"
    },
    "sources": [
      {
        "locator": "Labelled enumeration theorem",
        "mention": "wikipedia://en/34871920",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:34871920@r1195473520"
      }
    ],
    "tag": "XNX30CK7S5"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/XNX30CK7S5/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/XNX30CK7S5.md",
  "msc": null,
  "name": "Labelled enumeration theorem",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/XNX/XNX30CK7S5.md",
  "status": null,
  "tag": "XNX30CK7S5",
  "uri": "m2://XNX30CK7S5",
  "url": "https://math2.tamnd.com/wiki/labelled-enumeration-theorem/",
  "writing": {
    "tag": "XNX30CK7S5",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}