Polynomial Generated by the Fibonacci Sequence

The Fibonacci sequence's initial terms are F-0 = 0 and F-1 = Fn-1 + Fn-2 for n >= 2. We define the polynomial sequence p by setting p(0)(x) = 1 and p(n)(x) =xp(n-1)(x) + Fn+1 for n >= 1 with p(n)(x) = Sigma(n)(k=0) F(k+1)x(n-k) We call p(n)(x) the Fibonacci-coefficient polynomial (FCP) of order n. The FCP sequence is distinct from the well-known Fibonacci polynomial sequence. We answer several questions regarding these polynomials. Specifically, we show that each even-degree FCP has no real zeros, while each odd-degree FCP has a unique,and (for degree at least 3) irrational, real zero. Further, we show that this sequence of unique real zeros converges monotonically to the negative of the golden ratio. Using Rouches theorem, we prove that the zeros of the FCPs approach the golden ratio in modulus. We also prove a general result that gives the Mahler measures of an infinite subsequence of the FCP sequence whose coefficients are reduced modulo an integer m >= 2. We then apply this to the case that m = L-n, the nth Lucas number, showing that the Mahler measure of the subsequence is phi(n-1), where 1+root 5/2.