Math 2.0

definition

Linear recurrence with constant coefficients

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.

Explanations

L1 human

In a linear recurrence with constant coefficients, each new term is a fixed weighted sum of the previous dd terms. The weights do not change with nn.

What this node 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 node is. They do not measure its truth.

What this needs

To read this node, read these 2 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Recurrence relation definition
  2. Linear recurrence with constant coefficients definition

What depends on this

4 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Linear_recurrence_with_constant_coefficients, Definitions