Recurrence relations for the connection coefficients of orthogonal polynomials of a discrete variable (Q5961656)

Using a technique based on ideas introduced by \textit{S. Lewanowicz} [J. Comput. Appl. Math. 65, No. 1-3, 215-231 (1995; Zbl 0849.33006); ibid. 69, No. 1, 159-170 (1996)] the author derives recurrence relations satisfied by the connection coefficients between two families of classical polynomials of a discrete variable (i.e., the Charlier, Meixner, Krawtchouk and Hahn polynomials). First of all a second order recurrence relation is obtained for the connection coefficients in the case that both families belong to the family of Hahn polynomials. These connection coefficients were already found explicitly by \textit{G. Gasper} [J. Math. Anal. Appl. 45, 176-198 (1974; Zbl 0276.33026)] as the author indicates. Secondly he obtains a recurrence relation for the connection coefficients in those cases that both families belong to the family of Charlier, Meixner and Krawtchouk polynomials. The order of this recurrence relation is at most two, which improves earlier results by \textit{A. Ronveaux, S. Belmehdi, E. Godoy} and \textit{A. Zarzo} [CRM Proc. Lect. Notes 9, 319-335, (1996; Zbl 0862.33006)]. See also \textit{A. Ronveaux, A. Zarzo} and \textit{E. Godoy} [J. Comput. Appl. Math. 62, No. 1, 67-73 (1995)]. In all nine cases the recurrence relations are given explicitly, but solutions are only mentioned in those cases for which the coefficients were already known. Finally the author studies the problem of expressing the associated polynomials in terms of the corresponding classical ones in all four cases. He finds recurrence relations for the connection (or Fourier) coefficients involved of order four (in case of the Hahn polynomials) and of order three (in case of the Charlier, Meixner and Krawtchouk polynomials). The symmetric case of the Hahn polynomials (with \(\beta=\alpha\)) leads to a second order recurrence relation.