Math 2.0

Combinatorics Definition

Exponential generating function

Builds on Formal power series

Definition

Let KK be a field of characteristic 00, for example ℚ\mathbb{Q} or ℝ\mathbb{R}, and let (an)n≥0(a_n)_{n \ge 0} be a sequence in KK. The exponential generating function of (an)(a_n) is the formal power series A^(x)=∑n≥0anxnn!∈K[ ⁣[x] ⁣].\hat{A}(x) = \sum_{n \ge 0} a_n \frac{x^n}{n!} \in K[\![x]\!].

Remarks

The constant sequence 11 has the exponential generating function ex=∑nxn/n!e^x = \sum_n x^n / n!. For exponential generating functions, the product corresponds to the binomial convolution cn=∑k=0n(nk)akbn−kc_n = \sum_{k=0}^{n} \binom{n}{k} a_k b_{n-k}. They suit labelled structures. For example, the derangement numbers have the exponential generating function e−x1−x\frac{e^{-x}}{1 - x}.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Formal power series definition
  2. Exponential generating function definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Generating_function, Exponential generating function (EGF)
About this page
Tag0KE6NBTVY8
URIm2://0KE6NBTVY8
Kinddefinition
WritingW1 stated
MSC05A15
DefinesExponential generating function
UsesFormal power series

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (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.