On linear recursions with nonnegative coefficients (Q1187515): Difference between revisions

The authors establish the following characterization: Theorem. Let \(P(x)\) be the polynomial \(x^ k-\alpha_ 1x^{k-1}-\dots-\alpha_ k\), where \(\alpha_ 1,\dots,\alpha_ k\) are given complex numbers, and denote by \(Q\) the set of all real polynomials of the form \(c_ nx^ n-\sum^{n- 1}_{i=0}c_ ix^ i\), where \(n\geq 1\), \(c_ n>0\), and \(c_ i\geq 0\) for \(i=0,\dots,n-1\). Then, conditions (A) and (B) below are equivalent. (A) Any infinite sequence \((U_ n)_{n\geq 0}\) of complex numbers which satisfies the recursion \(U_{n+k}=\alpha_ 1u_{n+k- 1}+\cdots+\alpha_ ku_ n\), \(n\geq 0\), also satisfies a linear recursion with nonnegative coefficients. (B) The polynomial \(P(x)\) divides a polynomial in \(Q\).