Fibonacci Polynomials - Definition

Definition

These Fibonacci polynomials are defined by a recurrence relation:

F_n(x)= \begin{cases} 0, & \mbox{if } n = 0\\ 1, & \mbox{if } n = 1\\ x F_{n - 1}(x) + F_{n - 2}(x),& \mbox{if } n \geq 2 \end{cases}

The first few Fibonacci polynomials are:

The Lucas polynomials use the same recurrence with different starting values: L_n(x) = \begin{cases} 2, & \mbox{if } n = 0 \\ x, & \mbox{if } n = 1 \\ x L_{n - 1}(x) + L_{n - 2}(x), & \mbox{if } n \geq 2. \end{cases}

The first few Lucas polynomials are:

The Fibonacci and Lucas numbers are recovered by evaluating the polynomials at x = 1; Pell numbers are recovered by evaluating Fn at x = 2. The degrees of Fn is n − 1 and the degree of Ln is n. The ordinary generating function for the sequences are:

The polynomials can be expressed in terms of Lucas sequences as

Read more about this topic:  Fibonacci Polynomials

Famous quotes containing the word definition:

    “One definition of man is “an intelligence served by organs.””
    —Ralph Waldo Emerson (1803–1882)

    “The very definition of the real becomes: that of which it is possible to give an equivalent reproduction.... The real is not only what can be reproduced, but that which is always already reproduced. The hyperreal.”
    —Jean Baudrillard (b. 1929)

    “It is very hard to give a just definition of love. The most we can say of it is this: that in the soul, it is a desire to rule; in the spirit, it is a sympathy; and in the body, it is but a hidden and subtle desire to possess—after many mysteries—what one loves.”
    —François, Duc De La Rochefoucauld (1613–1680)