Connection and linearization coefficients of the Askey–Wilson polynomials

The linearization problem   is the problem of finding the coefficients Ck(m,n)Ck(m,n) in the expansion of the product Pn(x)Qm(x)Pn(x)Qm(x) of two polynomial systems in terms of a third sequence of polynomials Rk(x)Rk(x),Pn(x)Qm(x)=∑k=0n+mCk(m,n)Rk(x). The polynomials PnPn, QmQm and RkRk may belong to three different polynomial families. In the case P=Q=RP=Q=R, we get the (standard) linearization   or Clebsch–Gordan-type problem. If Qm(x)≡1Qm(x)≡1, we are faced with the so-called connection problem.In this paper, we compute explicitly, in a more general setting and using an algorithmic approach, the connection and linearization coefficients of the Askey–Wilson orthogonal polynomial families.We find our results by an application of computer algebra. The major algorithmic tool for our development is a refined version of q-Petkovšekʼs algorithm published by Horn (2008), Horn et al. (2012) and implemented in Maple by Sprenger (2009), Sprenger and Koepf (2012) (in his package qFPS.mpl) which finds the q-hypergeometric term solutions of q-holonomic recurrence equations.The major ingredients which make this application non-trivial are
• the use of appropriate operators DxDx and SxSx;
• the use of an appropriate basis Bn(a,x)Bn(a,x) for these operators;
• and a suitable characterization of the classical orthogonal polynomials on a non-uniform lattice which was developed very recently (Foupouagnigni et al., 2011). Without this preprocessing the relevant recurrence equations are not accessible, and without the mentioned algorithm the solutions of these recurrence equations are out of reach. Furthermore, we present an algorithm to deduce the inversion coefficients for the basis Bn(a,x)Bn(a,x) in terms of the Askey–Wilson polynomials.Our results generalize and extend known results, and they can be used to deduce the connection and linearization coefficients for any family of classical orthogonal polynomial (including very classical orthogonal polynomials and classical orthogonal polynomials on non-uniform lattices), using the fact that from the Askey–Wilson polynomials, one can deduce, by specialization and/or by limiting processes, any other family of classical orthogonal polynomials. As illustration, we give explicitly the connection coefficients of the continuous q-Hahn, q-Racah and Wilson polynomials.