Math 2.0

Difference and functional equations Definition

Linear recurrence with constant coefficients

Builds on Recurrence relation

Definition

Let RR be a commutative ring and let dd be a natural number. A linear recurrence of order dd with constant coefficients over RR is given by coefficients c0,c1,…,cd−1∈Rc_0, c_1, \dots, c_{d-1} \in R. It is the recurrence relation un+d=c0un+c1un+1+⋯+cd−1un+d−1(n≥0)u_{n+d} = c_0 u_n + c_1 u_{n+1} + \dots + c_{d-1} u_{n+d-1} \qquad (n \ge 0) for sequences (un)n≥0(u_n)_{n \ge 0} in RR.

Remarks

This form is homogeneous. A non-homogeneous recurrence adds a term g(n)g(n) that does not depend on uu. The Fibonacci sequence satisfies the recurrence of order 22 with c0=c1=1c_0 = c_1 = 1. The sequences that satisfy it are its solutions. Its characteristic polynomial is Xd−cd−1Xd−1−⋯−c1X−c0X^d - c_{d-1} X^{d-1} - \dots - c_1 X - c_0.

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. Recurrence relation definition
  2. Linear recurrence with constant coefficients definition

Where this leads

8 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Linear_recurrence_with_constant_coefficients, Definitions
About this page
Tag081THG13JZ
URIm2://081THG13JZ
Kinddefinition
WritingW1 stated
MSC39A06
DefinesLinear recurrence with constant coefficients
UsesRecurrence relation

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

Used by