Math 2.0

Difference and functional equations Definition

Solution of recurrences by generating functions

Builds on Generating functionFormal power seriesLinear recurrence with constant coefficients

Definition

Let KK be a field and let (un)n≥0(u_n)_{n \ge 0} be a sequence in KK that satisfies a recurrence relation for n≥0n \ge 0. The generating function method for this recurrence consists of these steps.

  1. Form the generating function U(x)=∑n≥0unxnU(x) = \sum_{n \ge 0} u_n x^n in the ring K[ ⁣[x] ⁣]K[\![x]\!] of formal power series.
  2. Multiply the recurrence for index nn by a suitable power xn+dx^{n+d} and sum over n≥0n \ge 0. This gives an equation for U(x)U(x) that involves the initial values.
  3. Solve this equation for U(x)U(x).
  4. Read off unu_n as the coefficient of xnx^n in the solution.

For a linear recurrence with constant coefficients un+d=cd−1un+d−1+⋯+c0unu_{n+d} = c_{d-1} u_{n+d-1} + \cdots + c_0 u_n, step 3 gives U(x)=P(x)1−cd−1x−cd−2x2−⋯−c0xd,U(x) = \frac{P(x)}{1 - c_{d-1} x - c_{d-2} x^2 - \cdots - c_0 x^d}, where PP is a polynomial of degree less than dd determined by u0,…,ud−1u_0, \dots, u_{d-1}.

Remarks

Example: the Fibonacci sequence has F0=0F_0 = 0, F1=1F_1 = 1 and Fn+2=Fn+1+FnF_{n+2} = F_{n+1} + F_n. Multiplying by xn+2x^{n+2} and summing gives F(x)−x=xF(x)+x2F(x)F(x) - x = x F(x) + x^2 F(x), so F(x)=x/(1−x−x2)F(x) = x/(1 - x - x^2). Partial fractions with the roots of 1−x−x21 - x - x^2 then give Fn=(φn−ψn)/5F_n = (\varphi^n - \psi^n)/\sqrt{5}, where φ,ψ\varphi, \psi are the roots of X2−X−1X^2 - X - 1. Non-example: for the nonlinear recurrence un+1=un2u_{n+1} = u_n^2, step 2 does not give an equation in UU alone. The series ∑un2xn\sum u_n^2 x^n is not a simple function of U(x)U(x), so the method does not apply directly. The denominator in the constant-coefficient case is xdχ(1/x)x^d \chi(1/x), where χ\chi is the characteristic polynomial of the recurrence. Other generating functions, such as exponential ones, suit other recurrences, for example those with factors nn in the coefficients.

Reading path

To understand this page from the ground up, read these 5 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 concept
  2. Generating function concept
  3. Recurrence relation definition
  4. Linear recurrence with constant coefficients definition
  5. Solution of recurrences by generating functions definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Generating_function
About this page
Tag76NQXSGSHS
URIm2://76NQXSGSHS
Kinddefinition
WritingW0 stub
MSC39A06, 05A15
DefinesSolution of recurrences by generating functions
UsesGenerating function, Formal power series, Linear recurrence with constant coefficients

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (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.