{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "0KE6NBTVY8"
    },
    {
      "field": "uses",
      "target": "39HWNYW5EF"
    },
    {
      "field": "uses",
      "target": "K9VZKJACKT"
    }
  ],
  "body": "\n## Summary\n\nAn exponential generating function encodes a sequence $(a_n)$ as the series $\\sum a_n x^n / n!$. It is the natural tool to count labelled structures, because products give binomial convolutions. The node [[exponential generating function|0KE6NBTVY8]] gives the precise definition.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "inventory": [
      "X6AGSJFM3Y"
    ],
    "kind": "concept",
    "msc": [
      "05A15"
    ],
    "name": "Exponential generating function",
    "sources": [
      {
        "locator": "Exponential generating function (EGF)",
        "url": "https://en.wikipedia.org/wiki/Generating_function"
      }
    ],
    "specializes": [
      "0PHAC833JF"
    ],
    "tag": "0JHXPVFKT0"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/0JHXPVFKT0/",
  "links": [
    {
      "field": "specializes",
      "target": "0PHAC833JF"
    }
  ],
  "markdown": "https://tamnd.github.io/math2/node/0JHXPVFKT0.md",
  "msc": [
    "05A15"
  ],
  "name": "Exponential generating function",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0JH/0JHXPVFKT0.md",
  "status": null,
  "tag": "0JHXPVFKT0",
  "uri": "m2://0JHXPVFKT0",
  "url": "https://tamnd.github.io/math2/wiki/exponential-generating-function/",
  "writing": {
    "tag": "0JHXPVFKT0",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "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
      }
    ]
  }
}