Zeros of a binomial combination of Chebyshev polynomials
Summer Al Hamdani, Khang Tran

TL;DR
This paper investigates the zeros of polynomials generated by a binomial combination of Chebyshev polynomials, showing that only finitely many zeros lie outside the interval (-1,1), regardless of polynomial degree.
Contribution
It establishes a uniform bound on the number of zeros outside (-1,1) for polynomials generated from a binomial combination of Chebyshev polynomials.
Findings
Number of zeros outside (-1,1) is bounded independently of degree m.
Zeros are mostly confined within the interval (-1,1).
Provides insight into the zero distribution of these polynomial sequences.
Abstract
For , we study the zeros of the sequence of polynomials generated by the reciprocal of , expanded as a power series in . Equivalently, this sequence is obtained from a linear combination of Chebyshev polynomials whose coefficients have a binomial form. We show that the number of zeros of outside the interval is bounded by a constant independent 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
TopicsMathematical functions and polynomials · Advanced Mathematical Theories and Applications · Advanced Mathematical Identities
