Exponential Generating Function

In mathematics, a generating function is a representation of an infinite sequence of numbers as the coefficients of a formal power series. Generating functions are often expressed in closed form (rather than as a series), by some expression involving operations on the formal series.

There are various types of generating functions, including ordinary generating functions, exponential generating functions, Lambert series, Bell series, and Dirichlet series. Every sequence in principle has a generating function of each type (except that Lambert and Dirichlet series require indices to start at 1 rather than 0), but the ease with which they can be handled may differ considerably. The particular generating function, if any, that is most useful in a given context will depend upon the nature of the sequence and the details of the problem being addressed.

Generating functions are sometimes called generating series, in that a series of terms can be said to be the generator of its sequence of term coefficients.

History

Generating functions were first introduced by Abraham de Moivre in 1730, in order to solve the general linear recurrence problem.

George Pólya writes in '' Mathematics and plausible reasoning'':

The name "generating function" is due to Laplace. Yet, without giving it a name, Euler used the device of generating functions long before Laplace . He applied this mathematical tool to several problems in Combinatory Analysis and the Theory of Numbers.

Definition

Convergence

Unlike an ordinary series, the ''formal'' power series is not required to converge: in fact, the generating function is not actually regarded as a function, and the "variable" remains an indeterminate. One can generalize to formal power series in more than one indeterminate, to encode information about infinite multi-dimensional arrays of numbers. Thus generating functions are not functions in the formal sense of a mapping from a domain to a codomain.

These expressions in terms of the indeterminate  may involve arithmetic operations, differentiation with respect to  and composition with (i.e., substitution into) other generating functions; since these operations are also defined for functions, the result looks like a function of . Indeed, the closed form expression can often be interpreted as a function that can be evaluated at (sufficiently small) concrete values of , and which has the formal series as its series expansion; this explains the designation "generating functions". However such interpretation is not required to be possible, because formal series are not required to give a convergent series when a nonzero numeric value is substituted for .

Limitations

Not all expressions that are meaningful as functions of  are meaningful as expressions designating formal series; for example, negative and fractional powers of  are examples of functions that do not have a corresponding formal power series.

Types

Ordinary generating function (OGF)

When the term ''generating function'' is used without qualification, it is usually taken to mean an ordinary generating function. The ''ordinary generating function'' of a sequence is:
$G(a_n;x)=\sum_^\infty a_n x^n.$
If is the probability mass function of a discrete random variable, then its ordinary generating function is called a probability-generating function.

Exponential generating function (EGF)

The ''exponential generating function'' of a sequence is
$\operatorname(a_n;x)=\sum_^\infty a_n \frac.$

Exponential generating functions are generally more convenient than ordinary generating functions for combinatorial enumeration problems that involve labelled objects.

Another benefit of exponential generating functions is that they are useful in transferring linear recurrence relations to the realm of differential equations. For example, take the Fibonacci sequence that satisfies the linear recurrence relation . The corresponding exponential generating function has the form
$\operatorname(x) = \sum_^\infty \frac x^n$

and its derivatives can readily be shown to satisfy the differential equation as a direct analogue with the recurrence relation above. In this view, the factorial term is merely a counter-term to normalise the derivative operator acting on .

Poisson generating function

The ''Poisson generating function'' of a sequence is
$\operatorname(a_n;x)=\sum _^\infty a_n e^ \frac = e^\, \operatorname(a_n;x).$

Lambert series

The ''Lambert series'' of a sequence is
$\operatorname(a_n;x)=\sum _^\infty a_n \frac.$Note that in a Lambert series the index starts at 1, not at 0, as the first term would otherwise be undefined.

The Lambert series coefficients in the power series expansions
b_n := ^n\operatorname(a_n;x)for integers are related by the divisor sum
$b_n = \sum_ a_d.$The main article provides several more classical, or at least well-known examples related to special arithmetic functions in number theory. As an example of a Lambert series identity not given in the main article, we can show that for we have that $\sum_^\infty \frac = \sum_^\infty \frac + \sum_^\infty \frac,$

where we have the special case identity for the generating function of the divisor function, , given by$\sum_^\infty \frac = \sum_^\infty \frac.$

Bell series

The Bell series of a sequence is an expression in terms of both an indeterminate and a prime and is given by:
$\operatorname_p(a_n;x) = \sum_^\infty a_x^n.$

Dirichlet series generating functions (DGFs)

Formal Dirichlet series are often classified as generating functions, although they are not strictly formal power series. The ''Dirichlet series generating function'' of a sequence is:
$\operatorname(a_n;s)=\sum _^\infty \frac.$

The Dirichlet series generating function is especially useful when is a multiplicative function, in which case it has an Euler product expression in terms of the function's Bell series:
$\operatorname(a_n;s)=\prod_ \operatorname_p(a_n;p^)\,.$

If is a Dirichlet character then its Dirichlet series generating function is called a Dirichlet -series. We also have a relation between the pair of coefficients in the Lambert series expansions above and their DGFs. Namely, we can prove that:
^n\operatorname(a_n; x) = b_nif and only if
$\operatorname(a_n;s) \zeta(s) = \operatorname(b_n;s),$where is the Riemann zeta function.

The sequence generated by a Dirichlet series generating function (DGF) corresponding to:$\operatorname(a_k;s)=\zeta(s)^m$has the ordinary generating function:$\sum_^ a_k x^k = x + \binom \sum_ x^ + \binom\underset x^ + \binom\underset x^ + \binom\underset x^ + \cdots$

Polynomial sequence generating functions

The idea of generating functions can be extended to sequences of other objects. Thus, for example, polynomial sequences of binomial type are generated by:
$e^=\sum_^\infty \frac t^n$where is a sequence of polynomials and is a function of a certain form. Sheffer sequences are generated in a similar way. See the main article generalized Appell polynomials for more information.

Examples of polynomial sequences generated by more complex generating functions include:

* Appell polynomials
* Chebyshev polynomials
* Difference polynomials
* Generalized Appell polynomials
* -difference polynomials

Other generating functions

Other sequences generated by more complex generating functions include:

* Double exponential generating functions e.g. the Bell numbers
* Hadamard products of generating functions and diagonal generating functions, and their corresponding integral transformations

Convolution polynomials

Knuth's article titled "''Convolution Polynomials''" defines a generalized class of ''convolution polynomial'' sequences by their special generating functions of the form
$F(z)^x = \exp\bigl(x \log F(z)\bigr) = \sum_^\infty f_n(x) z^n,$
for some analytic function with a power series expansion such that .

We say that a family of polynomials, , forms a ''convolution family'' if and if the following convolution condition holds for all , and for all :
$f_n(x+y) = f_n(x) f_0(y) + f_(x) f_1(y) + \cdots + f_1(x) f_(y) + f_0(x) f_n(y).$

We see that for non-identically zero convolution families, this definition is equivalent to requiring that the sequence have an ordinary generating function of the first form given above.

A sequence of convolution polynomials defined in the notation above has the following properties:

* The sequence is of binomial type
* Special values of the sequence include and , and
* For arbitrary (fixed) $x, y, t \isin \mathbb$, these polynomials satisfy convolution formulas of the form
$\begin f_n(x+y) & = \sum_^n f_k(x) f_(y) \\ f_n(2x) & = \sum_^n f_k(x) f_(x) \\ xn f_n(x+y) & = (x+y) \sum_^n k f_k(x) f_(y) \\ \frac & = \sum_^n \frac \frac. \end$

For a fixed non-zero parameter $t \isin \mathbb$, we have modified generating functions for these convolution polynomial sequences given by
\frac = \left ^n\right\mathcal_t(z)^x,
where is implicitly defined by a functional equation of the form . Moreover, we can use matrix methods (as in the reference) to prove that given two convolution polynomial sequences, and , with respective corresponding generating functions, and , then for arbitrary we have the identity
\left ^n\right\left(G(z) F\left(z G(z)^t\right)\right)^x = \sum_^n F_k(x) G_(x+tk).

Examples of convolution polynomial sequences include the ''binomial power series'', , so-termed ''tree polynomials'', the Bell numbers, , the Laguerre polynomials, and the Stirling convolution polynomials.

Ordinary generating functions

Examples for simple sequences

Polynomials are a special case of ordinary generating functions, corresponding to finite sequences, or equivalently sequences that vanish after a certain point. These are important in that many finite sequences can usefully be interpreted as generating functions, such as the Poincaré polynomial and others.

A fundamental generating function is that of the constant sequence , whose ordinary generating function is the geometric series
$\sum_^\infty x^n= \frac.$

The left-hand side is the Maclaurin series expansion of the right-hand side. Alternatively, the equality can be justified by multiplying the power series on the left by , and checking that the result is the constant power series 1 (in other words, that all coefficients except the one of are equal to 0). Moreover, there can be no other power series with this property. The left-hand side therefore designates the multiplicative inverse of in the ring of power series.

Expressions for the ordinary generating function of other sequences are easily derived from this one. For instance, the substitution gives the generating function for the geometric sequence for any constant :
$\sum_^\infty(ax)^n= \frac.$

(The equality also follows directly from the fact that the left-hand side is the Maclaurin series expansion of the right-hand side.) In particular,
$\sum_^\infty(-1)^nx^n= \frac.$

One can also introduce regular gaps in the sequence by replacing by some power of , so for instance for the sequence (which skips over ) one gets the generating function
$\sum_^\infty x^ = \frac.$

By squaring the initial generating function, or by finding the derivative of both sides with respect to and making a change of running variable , one sees that the coefficients form the sequence , so one has
$\sum_^\infty(n+1)x^n= \frac,$

and the third power has as coefficients the triangular numbers whose term is the binomial coefficient , so that
$\sum_^\infty\binom2 x^n= \frac.$

More generally, for any non-negative integer and non-zero real value , it is true that
$\sum_^\infty a^n\binomk x^n= \frac\,.$

Since
$2\binom2 - 3\binom1 + \binom0 = 2\frac2 -3(n+1) + 1 = n^2,$

one can find the ordinary generating function for the sequence of square numbers by linear combination of binomial-coefficient generating sequences:
$G(n^2;x) = \sum_^\infty n^2x^n = \frac - \frac + \frac = \frac.$

We may also expand alternately to generate this same sequence of squares as a sum of derivatives of the geometric series in the following form:
\begin
G(n^2;x)
& = \sum_^\infty n^2x^n \\ px & = \sum_^\infty n(n-1) x^n + \sum_^\infty n x^n \\ px & = x^2 D^2\left frac\right+ x D\left frac\right\\ px & = \frac + \frac =\frac.
\end

By induction, we can similarly show for positive integers that
$n^m = \sum_^m \begin m \\ j \end \frac,$

where denote the Stirling numbers of the second kind and where the generating function
$\sum_^\infty \frac \, z^n = \frac,$

so that we can form the analogous generating functions over the integral th powers generalizing the result in the square case above. In particular, since we can write
$\frac = \sum_^k \binom \frac,$

we can apply a well-known finite sum identity involving the Stirling numbers to obtain that
$\sum_^\infty n^m z^n = \sum_^m \begin m+1 \\ j+1 \end \frac.$

Rational functions

The ordinary generating function of a sequence can be expressed as a rational function (the ratio of two finite-degree polynomials) if and only if the sequence is a linear recursive sequence with constant coefficients; this generalizes the examples above. Conversely, every sequence generated by a fraction of polynomials satisfies a linear recurrence with constant coefficients; these coefficients are identical to the coefficients of the fraction denominator polynomial (so they can be directly read off). This observation shows it is easy to solve for generating functions of sequences defined by a linear finite difference equation with constant coefficients, and then hence, for explicit closed-form formulas for the coefficients of these generating functions. The prototypical example here is to derive Binet's formula for the Fibonacci numbers via generating function techniques.

We also notice that the class of rational generating functions precisely corresponds to the generating functions that enumerate ''quasi-polynomial'' sequences of the form
$f_n = p_1(n) \rho_1^n + \cdots + p_\ell(n) \rho_\ell^n,$

where the reciprocal roots, $\rho_i \isin \mathbb$, are fixed scalars and where is a polynomial in for all .

In general, Hadamard products of rational functions produce rational generating functions. Similarly, if
$F(s, t) := \sum_ f(m, n) w^m z^n$

is a bivariate rational generating function, then its corresponding ''diagonal generating function'',
$\operatorname(F) := \sum_^\infty f(n, n) z^n,$

is ''algebraic''. For example, if we let
$F(s, t) := \sum_ \binom s^i t^j = \frac,$

then this generating function's diagonal coefficient generating function is given by the well-known OGF formula
$\operatorname(F) = \sum_^\infty \binom z^n = \frac.$

This result is computed in many ways, including Cauchy's integral formula or contour integration, taking complex residues, or by direct manipulations of formal power series in two variables.

Operations on generating functions

Multiplication yields convolution

Multiplication of ordinary generating functions yields a discrete convolution (the Cauchy product) of the sequences. For example, the sequence of cumulative sums (compare to the slightly more general Euler–Maclaurin formula)
$(a_0, a_0 + a_1, a_0 + a_1 + a_2, \ldots)$
of a sequence with ordinary generating function has the generating function
$G(a_n; x) \cdot \frac$
because is the ordinary generating function for the sequence . See also the section on convolutions in the applications section of this article below for further examples of problem solving with convolutions of generating functions and interpretations.

Shifting sequence indices

For integers , we have the following two analogous identities for the modified generating functions enumerating the shifted sequence variants of and , respectively:
\begin
& z^m G(z) = \sum_^\infty g_ z^n \\ px& \frac = \sum_^\infty g_ z^n.
\end

Differentiation and integration of generating functions

We have the following respective power series expansions for the first derivative of a generating function and its integral:
\begin
G'(z) & = \sum_^\infty (n+1) g_ z^n \\ pxz \cdot G'(z) & = \sum_^\infty n g_ z^n \\ px\int_0^z G(t) \, dt & = \sum_^\infty \frac z^n.
\end

The differentiation–multiplication operation of the second identity can be repeated times to multiply the sequence by , but that requires alternating between differentiation and multiplication. If instead doing differentiations in sequence, the effect is to multiply by the th falling factorial:
$z^k G^(z) = \sum_^\infty n^\underline g_n z^n = \sum_^\infty n (n-1) \dotsb (n-k+1) g_n z^n \quad\text k \in \mathbb.$

Using the Stirling numbers of the second kind, that can be turned into another formula for multiplying by $n^k$ as follows (see the main article on generating function transformations):
$\sum_^k \begin k \\ j \end z^j F^(z) = \sum_^\infty n^k f_n z^n \quad\text k \in \mathbb.$

A negative-order reversal of this sequence powers formula corresponding to the operation of repeated integration is defined by the zeta series transformation and its generalizations defined as a derivative-based transformation of generating functions, or alternately termwise by and performing an integral transformation on the sequence generating function. Related operations of performing fractional integration on a sequence generating function are discussed here.

Enumerating arithmetic progressions of sequences

In this section we give formulas for generating functions enumerating the sequence given an ordinary generating function , where , , and and are integers (see the main article on transformations). For , this is simply the familiar decomposition of a function into even and odd parts (i.e., even and odd powers):
\begin
\sum_^\infty f_ z^ &= \frac \\ px\sum_^\infty f_ z^ &= \frac.
\end

More generally, suppose that and that denotes the th primitive root of unity. Then, as an application of the discrete Fourier transform, we have the formula
$\sum_^\infty f_ z^ = \frac \sum_^ \omega_a^ F\left(\omega_a^m z\right).$

For integers , another useful formula providing somewhat ''reversed'' floored arithmetic progressions — effectively repeating each coefficient times — are generated by the identity
$\sum_^\infty f_ z^n = \frac F(z^m) = \left(1 + z + \cdots + z^ + z^\right) F(z^m).$

-recursive sequences and holonomic generating functions

Definitions

A formal power series (or function) is said to be holonomic if it satisfies a linear differential equation of the form
$c_0(z) F^(z) + c_1(z) F^(z) + \cdots + c_r(z) F(z) = 0,$

where the coefficients are in the field of rational functions, $\mathbb(z)$. Equivalently, $F(z)$ is holonomic if the vector space over $\mathbb(z)$ spanned by the set of all of its derivatives is finite dimensional.

Since we can clear denominators if need be in the previous equation, we may assume that the functions, are polynomials in . Thus we can see an equivalent condition that a generating function is holonomic if its coefficients satisfy a -recurrence of the form
$\widehat_s(n) f_ + \widehat_(n) f_ + \cdots + \widehat_0(n) f_n = 0,$

for all large enough and where the are fixed finite-degree polynomials in . In other words, the properties that a sequence be ''-recursive'' and have a holonomic generating function are equivalent. Holonomic functions are closed under the Hadamard product operation on generating functions.

Examples

The functions , , , , $\sqrt$, the dilogarithm function , the generalized hypergeometric functions and the functions defined by the power series
$\sum_^\infty \frac$

and the non-convergent
$\sum_^\infty n! \cdot z^n$
are all holonomic.

Examples of -recursive sequences with holonomic generating functions include and , where sequences such as $\sqrt$ and are ''not'' -recursive due to the nature of singularities in their corresponding generating functions. Similarly, functions with infinitely many singularities such as , , and are ''not'' holonomic functions.

Software for working with '-recursive sequences and holonomic generating functions

Tools for processing and working with -recursive sequences in '' Mathematica'' include the software packages provided for non-commercial use on th
RISC Combinatorics Group algorithmic combinatorics software
site. Despite being mostly closed-source, particularly powerful tools in this software suite are provided by the Guess package for guessing ''-recurrences'' for arbitrary input sequences (useful for experimental mathematics and exploration) and the Sigma package which is able to find P-recurrences for many sums and solve for closed-form solutions to -recurrences involving generalized harmonic numbers. Other packages listed on this particular RISC site are targeted at working with holonomic ''generating functions'' specifically.

Relation to discrete-time Fourier transform

When the series converges absolutely,
$G \left ( a_n; e^ \right) = \sum_^\infty a_n e^$
is the discrete-time Fourier transform of the sequence .

Asymptotic growth of a sequence

In calculus, often the growth rate of the coefficients of a power series can be used to deduce a radius of convergence for the power series. The reverse can also hold; often the radius of convergence for a generating function can be used to deduce the asymptotic growth of the underlying sequence.

For instance, if an ordinary generating function that has a finite radius of convergence of can be written as
$G(a_n; x) = \frac$

where each of and is a function that is analytic to a radius of convergence greater than (or is entire), and where then
$a_n \sim \frac \, n^\left(\frac\right)^n \sim \frac \binom\left(\frac\right)^n = \frac \left(\!\!\binom\!\!\right)\left(\frac\right)^n\,,$
using the gamma function, a binomial coefficient, or a multiset coefficient. Note that limit as goes to infinity of the ratio of to any of these expressions is guaranteed to be 1; not merely that is proportional to them.

Often this approach can be iterated to generate several terms in an asymptotic series for . In particular,
$G\left(a_n - \frac \binom\left(\frac\right)^n; x \right) = G(a_n; x) - \frac \left(1 - \frac\right)^\,.$

The asymptotic growth of the coefficients of this generating function can then be sought via the finding of , , , , and to describe the generating function, as above.

Similar asymptotic analysis is possible for exponential generating functions; with an exponential generating function, it is that grows according to these asymptotic formulae. Generally, if the generating function of one sequence minus the generating function of a second sequence has a radius of convergence that is larger than the radius of convergence of the individual generating functions then the two sequences have the same asymptotic growth.

Asymptotic growth of the sequence of squares

As derived above, the ordinary generating function for the sequence of squares is:
$G(n^2; x) = \frac.$

With , , , , and , we can verify that the squares grow as expected, like the squares:
$a_n \sim \frac \, n^ \left (\frac \right)^n = \frac\,n^ \left(\frac1 1\right)^n = n^2.$

Asymptotic growth of the Catalan numbers

The ordinary generating function for the Catalan numbers is
$G(C_n; x) = \frac.$

With , , , , and , we can conclude that, for the Catalan numbers:
$C_n \sim \frac \, n^ \left(\frac \right)^n = \frac \, n^ \left(\frac\right)^n = \frac.$

Bivariate and multivariate generating functions

The generating function in several variables can be generalized to arrays with multiple indices. These non-polynomial double sum examples are called multivariate generating functions, or super generating functions. For two variables, these are often called bivariate generating functions.

Bivariate case

The ordinary generating function of a two-dimensional array (where and are natural numbers) is:
$G(a_;x,y)=\sum_^\infty a_ x^m y^n.$For instance, since is the ordinary generating function for binomial coefficients for a fixed , one may ask for a bivariate generating function that generates the binomial coefficients for all and . To do this, consider itself as a sequence in , and find the generating function in that has these sequence values as coefficients. Since the generating function for is:
$\frac,$the generating function for the binomial coefficients is:
$\sum_ \binom x^k y^n = \frac=\frac.$Other examples of such include the following two-variable generating functions for the binomial coefficients, the Stirling numbers, and the Eulerian numbers, where and denote the two variables:
\begin
e^ & = \sum_ \binom w^m \frac \\ pxe^ & = \sum_ \begin n \\ m \end w^m \frac \\ px\frac & = \sum_ \begin n \\ m \end w^m \frac \\ px\frac & = \sum_ \left\langle\begin n \\ m \end \right\rangle w^m \frac \\ px\frac &= \sum_ \left\langle\begin m+n+1 \\ m \end \right\rangle \frac.
\end

Multivariate case

Multivariate generating functions arise in practice when calculating the number of contingency tables of non-negative integers with specified row and column totals. Suppose the table has rows and columns; the row sums are and the column sums are . Then, according to I. J. Good, the number of such tables is the coefficient of:
$x_1^\cdots x_r^y_1^\cdots y_c^$in:$\prod_^\prod_^c\frac.$

Representation by continued fractions (Jacobi-type '-fractions)

Definitions

Expansions of (formal) ''Jacobi-type'' and ''Stieltjes-type'' continued fractions (''-fractions'' and ''-fractions'', respectively) whose th rational convergents represent -order accurate power series are another way to express the typically divergent ordinary generating functions for many special one and two-variate sequences. The particular form of the Jacobi-type continued fractions (-fractions) are expanded as in the following equation and have the next corresponding power series expansions with respect to for some specific, application-dependent component sequences, and , where denotes the formal variable in the second power series expansion given below:
\begin
J^(z) & = \cfrac \\ px & = 1 + c_1 z + \left(\text_2+c_1^2\right) z^2 + \left(2 \text_2 c_1+c_1^3 + \text_2 c_2\right) z^3 + \cdots
\end

The coefficients of $z^n$, denoted in shorthand by , in the previous equations correspond to matrix solutions of the equations:
$\begink_ & k_ & 0 & 0 & \cdots \\ k_ & k_ & k_ & 0 & \cdots \\ k_ & k_ & k_ & k_ & \cdots \\ \vdots & \vdots & \vdots & \vdots \end = \begink_ & 0 & 0 & 0 & \cdots \\ k_ & k_ & 0 & 0 & \cdots \\ k_ & k_ & k_ & 0 & \cdots \\ \vdots & \vdots & \vdots & \vdots \end \cdot \beginc_1 & 1 & 0 & 0 & \cdots \\ \text_2 & c_2 & 1 & 0 & \cdots \\ 0 & \text_3 & c_3 & 1 & \cdots \\ \vdots & \vdots & \vdots & \vdots \end,$

where , for , if , and where for all integers , we have an ''addition formula'' relation given by:
$j_ = k_ \cdot k_ + \sum_^ \text_2 \cdots \text_ \times k_ \cdot k_.$

Properties of the 'th convergent functions

For (though in practice when ), we can define the rational th convergents to the infinite -fraction, , expanded by:
$\operatorname_h(z) := \frac = j_0 + j_1 z + \cdots + j_ z^ + \sum_^\infty \widetilde_ z^n$

component-wise through the sequences, and , defined recursively by:
$\begin P_h(z) & = (1-c_h z) P_(z) - \text_h z^2 P_(z) + \delta_ \\ Q_h(z) & = (1-c_h z) Q_(z) - \text_h z^2 Q_(z) + (1-c_1 z) \delta_ + \delta_. \end$

Moreover, the rationality of the convergent function for all implies additional finite difference equations and congruence properties satisfied by the sequence of , ''and'' for if then we have the congruence
j_n \equiv ^n\operatorname_h(z) \pmod h,

for non-symbolic, determinate choices of the parameter sequences and when , that is, when these sequences do not implicitly depend on an auxiliary parameter such as , , or as in the examples contained in the table below.

Examples

The next table provides examples of closed-form formulas for the component sequences found computationally (and subsequently proved correct in the cited references)
in several special cases of the prescribed sequences, , generated by the general expansions of the -fractions defined in the first subsection. Here we define and the parameters $R, \alpha \isin \mathbb^+$ and to be indeterminates with respect to these expansions, where the prescribed sequences enumerated by the expansions of these -fractions are defined in terms of the -Pochhammer symbol, Pochhammer symbol, and the binomial coefficients.

The radii of convergence of these series corresponding to the definition of the Jacobi-type -fractions given above are in general different from that of the corresponding power series expansions defining the ordinary generating functions of these sequences.

Examples

Square numbers

Generating functions for the sequence of square numbers are:

where is the Riemann zeta function.

Applications

Generating functions are used to:

* Find a closed formula for a sequence given in a recurrence relation, for example, Fibonacci numbers.
* Find recurrence relations for sequences—the form of a generating function may suggest a recurrence formula.
* Find relationships between sequences—if the generating functions of two sequences have a similar form, then the sequences themselves may be related.
* Explore the asymptotic behaviour of sequences.
* Prove identities involving sequences.
* Solve enumeration problems in combinatorics and encoding their solutions. Rook polynomials are an example of an application in combinatorics.
* Evaluate infinite sums.

Various techniques: Evaluating sums and tackling other problems with generating functions

Example 1: Formula for sums of harmonic numbers

Generating functions give us several methods to manipulate sums and to establish identities between sums.

The simplest case occurs when . We then know that for the corresponding ordinary generating functions.

For example, we can manipulate
$s_n=\sum_^ H_\,,$
where are the harmonic numbers. Let
$H(z) = \sum_^\infty$
be the ordinary generating function of the harmonic numbers. Then
$H(z) = \frac\sum_^\infty \frac\,,$
and thus
$S(z) = \sum_^\infty = \frac\sum_^\infty \frac\,.$

Using
$\frac = \sum_^\infty (n+1)z^n\,,$
convolution with the numerator yields
$s_n = \sum_^ \frac = (n+1)H_n - n\,,$
which can also be written as
$\sum_^ = (n+1)(H_ - 1)\,.$

Example 2: Modified binomial coefficient sums and the binomial transform

As another example of using generating functions to relate sequences and manipulate sums, for an arbitrary sequence we define the two sequences of sums
\begin
s_n &:= \sum_^n \binom f_m 3^ \\ px\tilde_n &:= \sum_^n \binom (m+1)(m+2)(m+3) f_m 3^\,,
\end
for all , and seek to express the second sums in terms of the first. We suggest an approach by generating functions.

First, we use the binomial transform to write the generating function for the first sum as
$S(z) = \frac F\left(\frac\right).$

Since the generating function for the sequence is given by
$6 F(z) + 18z F'(z) + 9z^2 F''(z) + z^3 F(z)$
we may write the generating function for the second sum defined above in the form
$\tilde(z) = \frac F\left(\frac\right)+\frac F'\left(\frac\right)+\frac F''\left(\frac\right)+\frac F\left(\frac\right).$

In particular, we may write this modified sum generating function in the form of
$a(z) \cdot S(z) + b(z) \cdot z S'(z) + c(z) \cdot z^2 S''(z) + d(z) \cdot z^3 S(z),$
for , , , and , where .

Finally, it follows that we may express the second sums through the first sums in the following form:
\begin
\tilde_n & = ^nleft(6(1-3z)^3 \sum_^\infty s_n z^n + 18 (1-3z)^3 \sum_^\infty n s_n z^n + 9 (1-3z)^3 \sum_^\infty n(n-1) s_n z^n + (1-3z)^3 \sum_^\infty n(n-1)(n-2) s_n z^n\right) \\ px & = (n+1)(n+2)(n+3) s_n - 9 n(n+1)(n+2) s_ + 27 (n-1)n(n+1) s_ - (n-2)(n-1)n s_.
\end

Example 3: Generating functions for mutually recursive sequences

In this example, we reformulate a generating function example given in Section 7.3 of ''Concrete Mathematics'' (see also Section 7.1 of the same reference for pretty pictures of generating function series). In particular, suppose that we seek the total number of ways (denoted ) to tile a 3-by- rectangle with unmarked 2-by-1 domino pieces. Let the auxiliary sequence, , be defined as the number of ways to cover a 3-by- rectangle-minus-corner section of the full rectangle. We seek to use these definitions to give a closed form formula for without breaking down this definition further to handle the cases of vertical versus horizontal dominoes. Notice that the ordinary generating functions for our two sequences correspond to the series:
$\begin U(z) = 1 + 3z^2 + 11 z^4 + 41 z^6 + \cdots, \\ V(z) = z + 4z^3 + 15 z^5 + 56 z^7 + \cdots. \end$

If we consider the possible configurations that can be given starting from the left edge of the 3-by- rectangle, we are able to express the following mutually dependent, or ''mutually recursive'', recurrence relations for our two sequences when defined as above where , , , and :
$\begin U_n & = 2 V_ + U_ \\ V_n & = U_ + V_. \end$

Since we have that for all integers , the index-shifted generating functions satisfy
$z^m G(z) = \sum_^\infty g_ z^n\,,$
we can use the initial conditions specified above and the previous two recurrence relations to see that we have the next two equations relating the generating functions for these sequences given by
$\begin U(z) & = 2z V(z) + z^2 U(z) + 1 \\ V(z) & = z U(z) + z^2 V(z) = \frac U(z), \end$
which then implies by solving the system of equations (and this is the particular trick to our method here) that
$U(z) = \frac = \frac \cdot \frac + \frac \cdot \frac.$

Thus by performing algebraic simplifications to the sequence resulting from the second partial fractions expansions of the generating function in the previous equation, we find that and that
$U_ = \left\lceil \frac \right\rceil\,,$
for all integers . We also note that the same shifted generating function technique applied to the second-order recurrence for the Fibonacci numbers is the prototypical example of using generating functions to solve recurrence relations in one variable already covered, or at least hinted at, in the subsection on rational functions given above.

Convolution (Cauchy products)

A discrete ''convolution'' of the terms in two formal power series turns a product of generating functions into a generating function enumerating a convolved sum of the original sequence terms (see Cauchy product).

#Consider and are ordinary generating functions. C(z) = A(z)B(z) \Leftrightarrow ^n(z) = \sum_^
#Consider and are exponential generating functions. C(z) = A(z)B(z) \Leftrightarrow \left frac\right(z) = \sum_^n \binom a_k b_
#Consider the triply convolved sequence resulting from the product of three ordinary generating functions C(z) = F(z) G(z) H(z) \Leftrightarrow ^n(z) = \sum_ f_j g_k h_ l
#Consider the -fold convolution of a sequence with itself for some positive integer (see the example below for an application) C(z) = G(z)^m \Leftrightarrow ^n(z) = \sum_ g_ g_ \cdots g_

Multiplication of generating functions, or convolution of their underlying sequences, can correspond to a notion of independent events in certain counting and probability scenarios. For example, if we adopt the notational convention that the probability generating function, or ''pgf'', of a random variable is denoted by , then we can show that for any two random variables
$G_(z) = G_X(z) G_Y(z)\,,$
if and are independent.

Example: The money-changing problem

The number of ways to pay cents in coin denominations of values in the set (i.e., in pennies, nickels, dimes, quarters, and half dollars, respectively), where we distinguish instances based upon the total number of each coin but not upon the order in which the coins are presented, is given by the ordinary generating function
$\frac \frac \frac \frac \frac\,.$
When we also distinguish based upon the order in which the coins are presented (e.g., one penny then one nickel is distinct from one nickel then one penny), the ordinary generating function is
$\frac\,.$

If we allow the cents to be paid in coins of ''any'' positive integer denomination, we arrive at the partition function ordinary generating function expanded by an infinite -Pochhammer symbol product,
$\prod_^\infty \left(1 - z^n\right)^\,.$
When the order of the coins matters, the ordinary generating function is
$\frac = \frac\,.$

Example: Generating function for the Catalan numbers

An example where convolutions of generating functions are useful allows us to solve for a specific closed-form function representing the ordinary generating function for the Catalan numbers, . In particular, this sequence has the combinatorial interpretation as being the number of ways to insert parentheses into the product so that the order of multiplication is completely specified. For example, which corresponds to the two expressions and . It follows that the sequence satisfies a recurrence relation given by
$C_n = \sum_^ C_k C_ + \delta_ = C_0 C_ + C_1 C_ + \cdots + C_ C_0 + \delta_\,,\quad n \geq 0\,,$
and so has a corresponding convolved generating function, , satisfying
$C(z) = z \cdot C(z)^2 + 1\,.$

Since , we then arrive at a formula for this generating function given by
$C(z) = \frac = \sum_^\infty \frac\binom z^n\,.$

Note that the first equation implicitly defining above implies that
$C(z) = \frac \,,$
which then leads to another "simple" (of form) continued fraction expansion of this generating function.

Example: Spanning trees of fans and convolutions of convolutions

A ''fan of order '' is defined to be a graph on the vertices with edges connected according to the following rules: Vertex 0 is connected by a single edge to each of the other vertices, and vertex $k$ is connected by a single edge to the next vertex for all . There is one fan of order one, three fans of order two, eight fans of order three, and so on. A spanning tree is a subgraph of a graph which contains all of the original vertices and which contains enough edges to make this subgraph connected, but not so many edges that there is a cycle in the subgraph. We ask how many spanning trees of a fan of order are possible for each .

As an observation, we may approach the question by counting the number of ways to join adjacent sets of vertices. For example, when , we have that , which is a sum over the -fold convolutions of the sequence for . More generally, we may write a formula for this sequence as
$f_n = \sum_ \sum_ g_ g_ \cdots g_\,,$
from which we see that the ordinary generating function for this sequence is given by the next sum of convolutions as
$F(z) = G(z) + G(z)^2 + G(z)^3 + \cdots = \frac = \frac = \frac\,,$
from which we are able to extract an exact formula for the sequence by taking the partial fraction expansion of the last generating function.

Implicit generating functions and the Lagrange inversion formula

One often encounters generating functions specified by a functional equation, instead of an explicit specification. For example, the generating function for the number of binary trees on nodes (leaves included) satisfies

$T(z) = z\left(1+T(z)^2\right)$

The Lagrange inversion theorem is a tool used to explicitly evaluate solutions to such equations.

Applying the above theorem to our functional equation yields (with $\phi(z) = 1+z^2$):

^n(z) = ^\frac (1+z^2)^n

Via the binomial theorem expansion, for even $n$, the formula returns $0$. This is expected as one can prove that the number of leaves of a binary tree are one more than the number of its internal nodes, so the total sum should always be an odd number. For odd $n$, however, we get

^\frac (1+z^2)^n = \frac \dbinom

The expression becomes much neater if we let $n$ be the number of internal nodes: Now the expression just becomes the $n$^th Catalan number.

Introducing a free parameter (snake oil method)

Sometimes the sum is complicated, and it is not always easy to evaluate. The "Free Parameter" method is another method (called "snake oil" by H. Wilf) to evaluate these sums.

Both methods discussed so far have as limit in the summation. When n does not appear explicitly in the summation, we may consider as a "free" parameter and treat as a coefficient of , change the order of the summations on and , and try to compute the inner sum.

For example, if we want to compute
$s_n = \sum_^\infty\,, \quad m,n \in \mathbb_0\,,$
we can treat as a "free" parameter, and set
$F(z) = \sum_^\inftyz^n\,.$

Interchanging summation ("snake oil") gives
$F(z) = \sum_^\infty\sum_^\infty\,.$

Now the inner sum is . Thus
\begin F(z)
&= \frac\sum_^\infty \\ px&= \frac\sum_^\infty &\text C_k = k\text \\ px&= \frac\frac \\ px&= \frac\left(1-\frac\right) \\ px&= \frac = z\frac\,.
\end

Then we obtain
s_n = \begin
\displaystyle\binom & \text m \geq 1 \,, \\
= 0& \text m = 0\,.
\end

It is instructive to use the same method again for the sum, but this time take as the free parameter instead of . We thus set
$G(z) = \sum_^\infty\left( \sum_^\infty \binom\binom\frac \right) z^m\,.$

Interchanging summation ("snake oil") gives
$G(z) = \sum_^\infty \binom\frac z^ \sum_^\infty \binom z^\,.$

Now the inner sum is . Thus
\begin G(z)
&= (1+z)^n \sum_^\infty \frac\binom\left(\frac\right)^k \\ px&= (1+z)^n \sum_^\infty C_k \,\left(\frac\right)^k &\text C_k = k\text \\ px&= (1+z)^n \,\frac \\ px&= (1+z)^n \,\frac \\ px&= (1+z)^n \,\frac \\ px&= (1+z)^n \,\frac = z(1+z)^\,.
\end

Thus we obtain
s_n = \left ^m\rightz(1+z)^ = \left ^\right(1+z)^ = \binom\,,
for as before.

Generating functions prove congruences

We say that two generating functions (power series) are congruent modulo , written if their coefficients are congruent modulo for all , i.e., for all relevant cases of the integers (note that we need not assume that is an integer here—it may very well be polynomial-valued in some indeterminate , for example). If the "simpler" right-hand-side generating function, , is a rational function of , then the form of this sequence suggests that the sequence is eventually periodic modulo fixed particular cases of integer-valued . For example, we can prove that the Euler numbers,
$\langle E_n \rangle = \langle 1, 1, 5, 61, 1385, \ldots \rangle \longmapsto \langle 1,1,2,1,2,1,2,\ldots \rangle \pmod\,,$
satisfy the following congruence modulo 3:
$\sum_^\infty E_n z^n = \frac \pmod\,.$

One useful method of obtaining congruences for sequences enumerated by special generating functions modulo any integers (i.e., not only prime powers ) is given in the section on continued fraction representations of (even non-convergent) ordinary generating functions by -fractions above. We cite one particular result related to generating series expanded through a representation by continued fraction from Lando's ''Lectures on Generating Functions'' as follows:

Generating functions also have other uses in proving congruences for their coefficients. We cite the next two specific examples deriving special case congruences for the Stirling numbers of the first kind and for the partition function which show the versatility of generating functions in tackling problems involving integer sequences.

The Stirling numbers modulo small integers

The main article on the Stirling numbers generated by the finite products
$S_n(x) := \sum_^n \begin n \\ k \end x^k = x(x+1)(x+2) \cdots (x+n-1)\,,\quad n \geq 1\,,$

provides an overview of the congruences for these numbers derived strictly from properties of their generating function as in Section 4.6 of Wilf's stock reference ''Generatingfunctionology''.
We repeat the basic argument and notice that when reduces modulo 2, these finite product generating functions each satisfy

S_n(x) = (x+1)\cdot (x+1)\cdots = x^ (x+1)^\,,

which implies that the parity of these Stirling numbers matches that of the binomial coefficient

$\begin n \\ k \end \equiv \binom \pmod\,,$

and consequently shows that is even whenever .

Similarly, we can reduce the right-hand-side products defining the Stirling number generating functions modulo 3 to obtain slightly more complicated expressions providing that
\begin
\begin n \\ m \end & \equiv
^m\left(
x^ (x+1)^
(x+2)^
\right) && \pmod \\
& \equiv
\sum_^ \begin \left\lceil \frac \right\rceil \\ k \end
\begin \left\lfloor \frac \right\rfloor \\ m-k - \left\lceil \frac \right\rceil \end \times
2^ && \pmod\,.
\end

Congruences for the partition function

In this example, we pull in some of the machinery of infinite products whose power series expansions generate the expansions of many special functions and enumerate partition functions. In particular, we recall that ''the'' partition function is generated by the reciprocal infinite -Pochhammer symbol product (or -Pochhammer product as the case may be) given by
\begin
\sum_^\infty p(n) z^n & = \frac \\ pt& = 1 + z + 2z^2 + 3 z^3 + 5z^4 + 7z^5 + 11z^6 + \cdots.
\end

This partition function satisfies many known congruence properties, which notably include the following results though there are still many open questions about the forms of related integer congruences for the function:
$\begin p(5m+4) & \equiv 0 \pmod \\ p(7m+5) & \equiv 0 \pmod \\ p(11m+6) & \equiv 0 \pmod \\ p(25m+24) & \equiv 0 \pmod\,. \end$

We show how to use generating functions and manipulations of congruences for formal power series to give a highly elementary proof of the first of these congruences listed above.

First, we observe that in the binomial coefficient generating function
$\frac = \sum_^\infty \binomz^i\,,$
all of the coefficients are divisible by 5 except for those which correspond to the powers and moreover in those cases the remainder of the coefficient is 1 modulo 5. Thus,
$\frac \equiv \frac \pmod\,,$
or equivalently
$\frac \equiv 1 \pmod\,.$
It follows that
$\frac \equiv 1 \pmod\,.$

Using the infinite product expansions of
$z \cdot \frac = z \cdot \left((1-z)\left(1-z^2\right) \cdots \right)^4 \times \frac\,,$
it can be shown that the coefficient of in is divisible by 5 for all . Finally, since
\begin
\sum_^\infty p(n-1) z^n & = \frac \\ px& = z \cdot \frac \times \left(1+z^5+z^+\cdots\right)\left(1+z^+z^+\cdots\right) \cdots
\end
we may equate the coefficients of in the previous equations to prove our desired congruence result, namely that for all .

Transformations of generating functions

There are a number of transformations of generating functions that provide other applications (see the main article). A transformation of a sequence's ''ordinary generating function'' (OGF) provides a method of converting the generating function for one sequence into a generating function enumerating another. These transformations typically involve integral formulas involving a sequence OGF (see integral transformations) or weighted sums over the higher-order derivatives of these functions (see derivative transformations).

Generating function transformations can come into play when we seek to express a generating function for the sums
$s_n := \sum_^n \binom C_ a_m,$

in the form of involving the original sequence generating function. For example, if the sums are
$s_n := \sum_^\infty \binom a_k \,$
then the generating function for the modified sum expressions is given by
$S(z) = \frac A\left(\frac\right)$
(see also the binomial transform and the Stirling transform).

There are also integral formulas for converting between a sequence's OGF, , and its exponential generating function, or EGF, , and vice versa given by
\begin
F(z) &= \int_0^\infty \hat(tz) e^ \, dt \,, \\ px\hat(z) &= \frac \int_^\pi F\left(z e^\right) e^ \, d\vartheta \,,
\end

provided that these integrals converge for appropriate values of .

Tables of special generating functions

An initial listing of special mathematical series is found here. A number of useful and special sequence generating functions are found in Section 5.4 and 7.4 of ''Concrete Mathematics'' and in Section 2.5 of Wilf's ''Generatingfunctionology''. Other special generating functions of note include the entries in the next table, which is by no means complete.See also the ''1031 Generating Functions'' found in

See also

* Moment-generating function
* Probability-generating function
* Generating function transformation
* Stanley's reciprocity theorem
* Integer partition
* Combinatorial principles
* Cyclic sieving
* Z-transform
* Umbral calculus
* Coins in a fountain

Notes

References

Citations

*
* Reprinted in
*
*
*
*
*

External links

"Introduction To Ordinary Generating Functions"
by Mike Zabrocki, York University, Mathematics and Statistics
*

Generating Functions, Power Indices and Coin Change
at cut-the-knot

"Generating Functions"
by Ed Pegg Jr., Wolfram Demonstrations Project, 2007.

{{DEFAULTSORT:Generating Function
1730 introductions

Abraham de Moivre