scientific article; zbMATH DE number 1149491
The Fibonacci-like polynomials \(G_n(x)\) are defined by the recursive formula \[ G_n(x) = xG_{n-1}(x)+G_{n-2}(x) \] for \(n\geq2\), where \(G_0(x)\) and \(G_1(x)\) are fixed polynomials (so-called seed-polynomials) with real coefficients. In the note under review the author studies the set of the non-zero accumulation points of the real roots of \(G_n(x)\) if both seed polynomials are constant or linear. Especially, he shows that the maximal real root of \(G_n(x)\) tends with \(n\to \infty\) to \(-\frac{a(a+2)}{a+1}\) if \(G_0(x)=a\), \(G_1(x)=x+a\) and \(a>0\) or \(a<-2\). Furthermore, some quantitative estimates are given.
- Some remarks on generalized recursive polynomials
- A note on Fibonacci-type polynomials
- Generalizing results on the convergence of the maximum roots of Fibonacci type polynomials
- Asveld's polynomials p_j(n)
- scientific article; zbMATH DE number 1182972 (Why is no real title available?)
- scientific article; zbMATH DE number 1336417 (Why is no real title available?)
- SOME ANALYTICAL AND NUMERICAL RESULTS FOR THE ZEROS OF A CLASS OF FIBONACCI-LIKE POLYNOMIALS
- On Fibonacci-type polynomial recurrences of order two and the accumulation points of their set of zeros
- The limit of the zero set of polynomials of the Fibonacci type
- On numerical radius inequalities for n× n operator matrices and applications to bounding the zeros of polynomials
- Some remarks on Fibonacci-type recursive polynomials
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4387009)