No label defined (Q4387009)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1149491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1149491 |
Statements
6 May 1998
0 references
Fibonacci-like polynomials
0 references
non-zero accumulation points
0 references
real roots
0 references
0.8294602036476135
0 references
0.827877402305603
0 references
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.
0 references