Generating Function

Also found in: Acronyms, Wikipedia.

generating function

[′jen·ə‚rād·iŋ ‚fəŋk·shən]
A function g (x, y) corresponding to a family of orthogonal polynomials ƒ0(x), ƒ1(x),…, where a Taylor series expansion of g (x, y) in powers of y will have the polynomial ƒn (x) as the coefficient for the term y n .
A function, g (y), corresponding to a sequence a0, a1, ⋯) where g (y) = a0+ a1 y + a2 y 2+ …. Also known as ordinary generating function.

Generating Function


A generating function of the sequence f0, f1,..., fn is the function

assuming that this power series converges for at least one nonzero value of t.

The sequence f0, f1,..., fn,… can be a sequence of numbers or of functions. In the latter case, the generating function depends not only on t but also on the arguments of the functions fn. For example, if fn = aqn, where a and q are constants, the generating function is

If the fn are Fibonacci numbers—that is, if f0 = 0, f1 = 1, fn+2 = fn+1 + fn—we have

If fn = Tn (x) are Chebyshev polynomials—that is, if T0(x) = 1

and Tn (x) = cos (n arc cos x)—then

Knowledge of the generating function of a sequence often makes it easier to study the properties of the sequence. Generating functions are used in probability theory, in the theory of functions, and in the theory of invariants in algebra. Methods involving generating functions were first applied by P. Laplace to solve certain problems in probability theory.


Feller, W. Vvedenie v teoriiu veroiatnostei i eeprilozheniia, 2nd ed., vols. 1–2. Moscow, 1967. (Translated from English.)
Natanson, I. P. Konstruktivnaia teoriia funktsii. Moscow-Leningrad, 1949.
References in periodicals archive ?
say, where P(x) = P(x; [alpha]) is the residual function which is the sum of the residues of the generating function, [phi](s) to be defined below, with weights and we are to express the error term [DELTA](x; [delta]) in terms of special functions and where the prime on the summation sign means that the term corresponding to ([n.
Moreover, inverse hazard, the information generating, moment generating functions were introduced and studied.
i,k](x) be the exponential generating function of the numbers [m.
We denote by g(x) the generating function of G, and f(x, y) the bivariate generating function of F where the coefficient of [x.
The probability that the system resides in each phase is calculated by both Matrix Geometric Method and Probability Generating Function method and listed in Table 2.
Key words: Moment generating function, randomized response models, estimation of proportion, relative efficiency, simple random sampling.
The generating function of the first generation is the function with respect to the duration of the monitoring process:
Furthermore, we have the following exponential generating function.
Preliminary results regarding the generating function method for SHS are reported in Section 2.
0] is introduced with a characteristic radius r0, and a dimensionless generating function G with the characteristic amplitude [G.
They also feature a nano-mist and ion generating function that is highly effective in beautifying the skin and inhibiting viruses and bacteria.