# Difference between revisions of "Generating function"

(categorize) |
|||

Line 20: | Line 20: | ||

== External Link == | == External Link == | ||

*[http://www.math.upenn.edu/~wilf/DownldGF.html GeneratingFunctionology] | *[http://www.math.upenn.edu/~wilf/DownldGF.html GeneratingFunctionology] | ||

+ | |||

+ | [[Category:Combinatorics]] | ||

+ | [[Category:Definition]] |

## Revision as of 14:37, 8 December 2007

The idea behind **generating functions** is to create a power series whose coefficients, , give the terms of a sequence which of interest. Therefore the power series (i.e. the generating function) is and the sequence is .

## Simple Example

If we let , then we have .

This function can be described as the number of ways we can get heads when flipping different coins.

The reason to go to such lengths is that our above polynomial is equal to (which is clearly seen due to the Binomial Theorem). By using this equation, we can rapidly uncover identities such as (let ), also .

## Convolutions

Suppose we have the sequences and . We can create a new sequence, called the convolution of and , defined by . Generating functions allow us to represent the convolution of two sequences as the product of two power series. If is the generating function for and is the generating function for , then the generating function for is .