Abstract
We consider the sequence of polynomials defined by the recursion , with initial values and , where are real numbers, , and . We show that every polynomial is distinct-real-rooted, and that the roots of the polynomial interlace the roots of the polynomial . We find that, as , the sequence of smallest roots of the polynomials converges decreasingly to a real number, and that the sequence of largest roots converges increasingly to a real number. Moreover, by using the Dirichlet approximation theorem, we prove that there is a number to which, for every positive integer , the sequence of th smallest roots of the polynomials converges. Similarly, there is a number to which, for every positive integer , the sequence of th largest roots of the polynomials converges. It turns out that these two convergence points are independent of the numbers and , as well as . We derive explicit expressions for these four limit points, and we determine completely when some of these limit points coincide.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.