Connection and linearization coefficients of the Askey-Wilson polynomials
نویسندگان
چکیده
The linearization problem is the problem of finding the coefficients Ck (m,n) in the expansion of the product Pn(x)Qm(x) of two polynomial systems in terms of a third sequence of polynomials Rk (x), Pn(x)Qm(x) = n+m ∑ k=0 Ck (m,n)Rk (x). The polynomials Pn , Qm and Rk may belong to three different polynomial families. In the case P = Q = R, we get the (standard ) linearization or Clebsch-Gordan-type problem. If Qm(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 [14, 15] and implemented in Maple by Sprenger [26, 27] (in his package qFPS.mpl) which finds the q-hypergeometric term solutions of q-holonomic recurrence equations). The major ingredients which makes this application non-trivial are • the use of appropriate operators Dx and Sx ; • the use of an appropriate basis 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 [9]. 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) 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.
منابع مشابه
On Moments of Classical Orthogonal Polynomials
In this work, using the inversion coefficients and some connection coefficients between some polynomial sets, we give explicit representations of the moments of all the orthogonal polynomials belonging to the Askey-Wilson scheme. Generating functions for some of these moments are also provided.
متن کاملWilson Function Transforms Related to Racah Coefficients
The irreducible ∗-representations of the Lie algebra su(1, 1) consist of discrete series representations, principal unitary series and complementary series. We calculate Racah coefficients for tensor product representations that consist of at least two discrete series representations. We use the explicit expressions for the Clebsch-Gordan coefficients as hypergeometric functions to find explici...
متن کاملBootstrapping and Askey-wilson Polynomials
Abstract. The mixed moments for the Askey-Wilson polynomials are found using a bootstrapping method and connection coe cients. A similar bootstrapping idea on generating functions gives a new Askey-Wilson generating function. Modified generating functions of orthogonal polynomials are shown to generate polynomials satisfying recurrences of known degree greater than three. An important special c...
متن کاملA second addition formula for continuous q-ultraspherical polynomials
This paper provides the details of Remark 5.4 in the author’s paper “Askey-Wilson polynomials as zonal spherical functions on the SU(2) quantum group”, SIAM J. Math. Anal. 24 (1993), 795–813. In formula (5.9) of the 1993 paper a two-parameter class of Askey-Wilson polynomials was expanded as a finite Fourier series with a product of two 3phi2’s as Fourier coefficients. The proof given there use...
متن کاملA Necessary and Sufficient Condition for Nonnegative Product Linearization of Orthogonal Polynomials
cos nθ cos mθ = 2 cos(n − m)θ + 2 cos(n + m)θ. Certain classical orthogonal polynomials admit explicit computation of the coefficients c(n,m, k). For example, they are known explicitly for the ultraspherical polynomials along with their q-analogs [8]. However, they are not available in a simple form for the nonsymmetric Jacobi polynomials (see [7]). The first general criterion for nonnegativity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 53 شماره
صفحات -
تاریخ انتشار 2013