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

We present a simple approach in order to compute recursively the connection coefficients between two families of classical (discrete) orthogonal polynomials (Charlier, Meixner, Kravchuk, Hahn), i.e., the coefficients Cm(n) in the expression Pn(x) = ∑m=0nCm(n)Qm(x), where {Pn(x)} and {Qm(x)} belong to the aforementioned class of polynomials. This is done by adapting a general and systematic algorithm, recently developed by the authors, to the discrete classical situation. Moreover, extensions of this method allow to give new addition formulae and to estimate Cm(n)-asymptotics in limit relations between some families.