Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case (Q1379701)

Given two families of orthogonal polynomials \(\{P_n\}\) and \(\{Q_m\}\), the connection coefficients between these families are defined as the numbers \(\{C_m(n)\}\) in the relation \[ P_n(x)= \sum^n_{m= 0} C_m(n)Q_m(x). \] For certain families of classical discrete orthogonal polynomials (Charlier, Meixner, Kravchuk, Hahn), the authors present (minimal) recurrence relations for the computation of these connection coefficients. Several examples are considered in some detail, and possible extensions of the method are pointed out.