Root geometry of polynomial sequences II: Type (1,0)
J.L. Gross, T. Mansour, T.W. Tucker, and D.G.L. Wang

TL;DR
This paper studies the roots of a polynomial sequence defined by a specific recurrence, proving they are real, interlaced, and converge to explicit limits, revealing deep root structure and convergence properties.
Contribution
It provides a comprehensive analysis of the root behavior of the polynomial sequence, including interlacing, convergence, and explicit limit points, extending understanding of polynomial root geometry.
Findings
All polynomials in the sequence have distinct real roots.
Roots of consecutive polynomials interlace.
Sequences of roots converge to explicit limit points.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Differential Equations and Dynamical Systems · Mathematical Dynamics and Fractals · Meromorphic and Entire Functions
