2004/01/27 by Y. Chen, Chen, Y., James Griffin +5
Computer Science · Mathematics · #Advanced Differential Equations and Dynamical Systems #Classical Analysis and ODEs (math.CA) #FOS: Mathematics #Mathematical functions and polynomials #Polynomial and algebraic computation #math.CA
paper · pdf · doi:10.48550/arxiv.math/0401382
51 pages, 9 figures
arxiv created 2004/01/27 · openalex publication_date 2004/01/27 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We show how polynomial mappings of degree k from a union of disjoint intervals onto [-1,1] generate a countable number of special cases of a certain generalization of the Chebyshev Polynomials. We also derive a new expression for these generalized Chebyshev Polynomials for any number of disjoint intervals from which the coefficients of xn can be found explicitly in terms of the end points and the recurrence coefficients. We find that this representation is useful for specializing to the polynomial mapping cases for small k where we will have algebraic expressions for the recurrence coefficients in terms of the end points. We study in detail certain special cases of the polynomials for small k and prove a theorem concerning the location of the zeroes of the polynomials. We also derive an expression for the discriminant for the case of two intervals that is valid for any configuration of the end points.