Recurrence equations and their classical orthogonal polynomial solutions on a quadratic or a q-quadratic lattice

Abstract

ABSTRACTIf is an orthogonal polynomial system, then satisfies a three-term recurrence relation of type with . On the other hand, Favard's theorem states that the converse is true. A general method to derive the coefficients , , in terms of the polynomial coefficients of the divided-difference equations satisfied by orthogonal polynomials on a quadratic or q-quadratic lattice is recalled. If a three-term recurrence relation is given as input, the Maple implementations rec2ortho of Koorwinder and Swarttouw or retode of Koepf and Schmersau can identify its solution which is a (linear transformation of a) classical orthogonal polynomial system of a continuous, a discrete or a q-discrete variable, if applicable. The two implementations rec2ortho and retode do not handle classical orthogonal polynomials on a quadratic or q-quadratic lattice. Motivated by an open problem, submitted by Alhaidari during the 14th International Symposium on Orthogonal Polynomials, Special Functions and Applications, which will serve as application, the Maple implementation retode of Koepf and Schmersau is extended to cover classical orthogonal polynomial solutions on quadratic or q-quadratic lattices of three-term recurrence relations.