paper

Root geometry of polynomial sequences II: Type (1,0)

arXiv:1503.05404

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.

37 pages

Root geometry of polynomial sequences II: Type (1,0) · wovepaper