Skip to main content

Theory and Modern Applications

Askey-Wilson integral and its generalizations

Abstract

We expand the Askey-Wilson (AW) density in a series of products of continuous q-Hermite polynomials times the density that makes these polynomials orthogonal. As a by-product we obtain the value of the AW integral as well as the values of integrals of q-Hermite polynomial times the AW density (q-Hermite moments of AW density). Our approach uses nice, old formulae of Carlitz and is general enough to venture a generalization. We prove that it is possible and pave the way how to do it. As a result, we obtain a system of recurrences that if solved successfully gives a sequence of generalized AW densities with more and more parameters.

MSC: 33D45, 05A30, 05E05.

1 Introduction and preliminaries

1.1 Introduction

We consider a sequence of nonnegative, integrable functions g n :[1,1] R + defined by the formula

g n ( x | a ( n ) , q ) = f h (x|q) j = 1 n φ h (x| a j ,q),

where a ( n ) =( a 1 ,, a n ), functions f h and φ h defined by (1.16) and (1.14) denote respectively the density of measure that makes the so-called continuous q-Hermite polynomials orthogonal and the generating function of these polynomials calculated at points a j , j=1,,n. Naturally functions g n are symmetric with respect to vectors a ( n ) .

Our elementary but crucial for this paper observation is that examples of such functions are proportional to the densities of measures that make orthogonal respectively the so-called continuous q-Hermite (q-Hermite, n=0 [[1], Eq. (14.26.2)]), big q-Hermite (bqH, n=1 [[1], Eq. (14.18.2)]), Al-Salam-Chihara (ASC, n=2 [[1], Eq. (14.8.2)]), continuous dual Hahn (C2H, n=3 [[1], Eq. (14.3.2)]), Askey-Wilson (AW, n=4 [[1], Eq. (14.1.2)]) polynomials. This observation makes functions g n important and, what is more exciting, allows possible generalization of both AW integral and AW polynomials, i.e., go beyond n=4.

Similar observations were made in fact in [2] when commenting on formula (10.11.19). Hence one can say that we are developing a certain idea of [2].

Let us notice that this is a second attempt to generalize AW polynomials. The other one was made in [3] by generalizing certain properties of generating functions of q-Hermite, bqH, ASC, C2H and AW polynomials.

On the other hand, by the observation that these functions are symmetric in variables a ( n ) we enter the fascinating world of symmetric functions.

The paper is organized as follows. Next Section 1.2 presents notation that will be used and basic families of orthogonal polynomials that will appear in the sequel. We also present here important properties of these polynomials.

Section 2 is devoted to expanding functions g n in the series of the form

g n ( x | a ( n ) , q ) = A n ( a ( n ) , q ) f h (x|q) j 0 T j ( n ) ( a ( n ) , q ) ( q ) j h j (x|q),

where { h n } denote q-Hermite polynomials, { T j ( n ) } are the sequences of certain symmetric functions and finally { A n } are the values of the integrals

1 1 g n ( x | a ( n ) , q ) dx,

and symbol ( q ) j is explained at the beginning of the next subsection.

We do this effectively for n=0,,4, obtaining known results in a new way. In Section 3 we show that sequences defined above do exist, and we present the way how to obtain them recursively. We are unable, however, to present nice compact forms of these sequences resembling those obtained for n4, thus posing several open questions (see Section 3.2) and leaving the field to younger and more talented researchers.

The partially legible, although not very compact, form was obtained for 1 1 g 5 (x| a ( 5 ) ,q)dx (see (3.4)).

For q=0, the case important for the rapidly developing so-called free probability, we give a simple, compact form for 1 1 g 5 (x| a ( 5 ) ,0)dx (see Theorem 2(ii)) paving the way to conjecture the compact form of (3.4).

Tedious proofs are shifted to Section 4.

1.2 Preliminaries

q is a parameter. We will assume that 1<q1 unless otherwise stated. Let us define [ 0 ] q =0, [ n ] q =1+q++ q n 1 , [ n ] q != j = 1 n [ j ] q , with [ 0 ] q !=1 and

[ n k ] q = { [ n ] q ! [ n k ] q ! [ k ] q ! , n k 0 , 0 , otherwise .

We will use the so-called q-Pochhammer symbol for n1,

( a ; q ) n = j = 0 n 1 ( 1 a q j ) , ( a 1 , a 2 , , a k ; q ) n = j = 1 n ( a j ; q ) n ,

with ( a ; q ) 0 =1.

Often ( a ; q ) n as well as ( a 1 , a 2 , , a k ; q ) n will be abbreviated to ( a ) n and ( a 1 , a 2 , , a k ) n if that will not cause misunderstanding.

It is easy to notice that ( q ) n = ( 1 q ) n [ n ] q ! and that

[ n k ] q = { ( q ) n ( q ) n k ( q ) k , n k 0 , 0 , otherwise .
(1.1)

The case q=1 will be considered only when it might make sense and will be understood as the limit q 1 .

Remark 1 Notice that [ n ] 1 =n, [ n ] 1 !=n!, [ n k ] 1 = ( n k ) , ( a ; 1 ) n = ( 1 a ) n and [ n ] 0 = { 1 if  n 1 , 0 if  n = 0 , [ n ] 0 !=1, [ n k ] 0 =1, for 0kn, ( a ; 0 ) n = { 1 if  n = 0 , 1 a if  n 1 .

We will need the following sets of polynomials.

The Rogers-Szegö polynomials that are defined by the equality

w n (x|q)= k = 0 n [ n k ] q x k
(1.2)

for n0 and w 1 (x|q)=0. They will play an auxiliary role in the sequel.

In particular one shows (see, e.g., [4]) that the polynomials defined by

h n (x|q)= e i n θ w n ( e 2 i θ | q ) ,
(1.3)

where x=cosθ, satisfy the following 3-term recurrence:

h n + 1 (x|q)=2x h n (x|q) ( 1 q n ) h n 1 (x|q),
(1.4)

with h 1 (x|q)=0, h 0 (x|q)=1.

These polynomials are the so-called continuous q-Hermite polynomials. A lot is known about their properties. For good reference, see [1, 4] or [5]. In particular we know that for |q|<1,

sup | x | 1 | h n (x|q)| w n (1|q).

Remark 2 Notice that h n (x|0) equals the n th Chebyshev polynomial of the second kind. More about these polynomials, one can find in, e.g., [2]. To analyze the case q=1, let us consider rescaled polynomials h n , i.e., H n (x|q)= h n (x 1 q /2|q)/ ( 1 q ) n / 2 . Then equation (1.4) takes a form

H n + 1 (x|q)=x H n (x|q) [ n ] q H n 1 (x|q),

which shows that H n (x|q)= H n (x), where { H n } denote the so-called probabilistic Hermite polynomials, i.e., polynomials orthogonal with respect to the measure with density equal to exp( x 2 /2)/ 2 π . This observation suggests that although the case q=1 lies within our interest, it requires special approach. In fact it will be solved completely in Section 3. For now we will assume that |q|<1.

In the sequel the following identities discovered by Carlitz (see Exercise 12.3(b), (c) of [4]), true for |q|,|t|<1,

k = 0 w k ( 1 | q ) t k ( q ) k = 1 ( t ) 2 , k = 0 w k 2 ( 1 | q ) t k ( q ) k = ( t 2 ) ( t ) 4 ,
(1.5)

will enable us to show absolute and uniform convergence of practically all series considered in the sequel.

We have also the so-called linearization formula [[4], Eq. (13.1.25)], which can be dated back in fact to Rogers and Carlitz (see [[2], Eq. (10.11.10)] with β=0 or [6] for Rogers-Szegö polynomials), as follows:

h n (x|q) h m (x|q)= j = 0 min ( n , m ) [ m j ] q [ n j ] q ( q ) j h n + m 2 k (x|q),
(1.6)

that will be our basic tool.

We will use the following two formulae of Carlitz presented in [7] that concern properties of Rogers-Szegö polynomials. Let us define two sets of functions

ζ n ( x | a , q ) = m 0 a m ( q ) m w n + m ( x | q ) , λ n , m ( x , y | a , q ) = k 0 a k ( q ) k w n + k ( x | q ) w m + k ( y | q ) ,

defined for |x|,|y|1, |a|<1 and n, m being nonnegative integers. Carlitz proved ([[7], Eq. (3.2)], after correcting an obvious misprint) that

ζ n (x|a,q)= ζ 0 (x|a,q) μ n (x|a,q),
(1.7)
ζ 0 (x|a,q)= 1 ( a , a x ) ,
(1.8)

where functions μ n are polynomials that are defined by

μ n (x|a,q)= j = 0 n [ n j ] q ( a ) j x j ,
(1.9)

and that ([[7], Eq. (1.4)], case m=0 also given in [[4], Exercise 12.3(d)])

λ m , n ( x , y | a , q ) λ 0 , 0 ( x , y | a , q ) = j = 0 m k = 0 n [ n k ] q [ m j ] q ( a x ) j ( a y ) k ( x y a ) k + j ( x y a 2 ) k + j x m j y n k ,
(1.10)

with

λ 0 , 0 (x,y|a,q)= ( x y a 2 ) ( a , a x , a y , a x y ) .
(1.11)

It is elementary to prove the following two properties of the polynomials μ n , hence we present them without proof.

Proposition 1

x n μ n ( x 1 | a , q ) = j = 0 n [ n j ] q ( a ) j q ( j 2 ) w n j (x|q),
(1.12)
w n (x|q)= k = 0 n [ n k ] q a k x n k μ n k ( x 1 | a , q ) .
(1.13)

To perform our calculations, we will also need the following two functions.

The generating function of the q-Hermite polynomials that is given by the formula below (see [[1], Eq. (14.26.1)]):

φ h (x|t,q) = d f j 0 t j ( q ) j h j (x|q)= 1 k = 0 v ( x | t q k ) ,
(1.14)

where v(x|t)=12tx+ t 2 . Notice that v(x|t)0 for |x|1 and that from (1.5) it follows that series in (1.3) converges for |t|<1. Notice also that from (1.5) it follows that

sup | x | 1 φ h (x|t,q)=1/ ( | t | ) 2 .
(1.15)

The density of the measure with respect to which polynomials h n are orthogonal is given in, e.g., [[1], Eq. (14.26.2)]. Following it we have

1 1 h n (x|q) h m (x|q) f h (x|q)dx= ( q ) n δ n m ,

where δ m n denotes Kronecker’s delta, and

f h (x|q)= 2 ( q ) 1 x 2 π k = 1 l ( x | q i ) ,
(1.16)

where l(x|a)= ( 1 + a ) 2 4a x 2 . Notice that

sup | x | 1 f h (x,q)2 ( q ) ( q ) 2 /π,
(1.17)

following (1.16) since l(x|q) ( 1 + q ) 2 for |x|1.

Remark 3 We have

f h (x|0)=2 1 x 2 /π, φ h (x|a,0)=1/ ( 1 2 a x + a 2 )

for |x|,|a|<1.

After proper rescaling and normalization similar to the one performed in Remark 2, the case q=1 leads to

exp ( x 2 / 2 ) / 2 π ,exp ( a x a 2 / 2 )

for x,aR, as respectively the density of orthogonalizing measure and the generating function. For details, see [8] or [9].

2 Main results

Since in our approach symmetric polynomials will appear, let us introduce the following set of symmetric polynomials of k variables:

S n ( k ) ( a 1 ,, a k |q)= j 1 , , j k 1 0 j 1 + + j k 1 n [ j 1 , , n m = 1 k 1 j m ] q a 1 j 1 a k 1 j k 1 a k n j 1 j k 1 ,
(2.1)

where we denoted by [ j 1 , j 2 , , n m = 1 k 1 j m ] q the so-called q-multinomial coefficient defined by [ n 1 , , n m ] q = ( q ) n 1 + + n m / k = 1 m ( q ) n k .

Remark 4 Notice that S n ( k ) ( a 1 ,, a k |1)= ( j = 1 k a j ) n .

Proof Obvious since ( q ) n m = 0 k 1 ( q ) j m ( q ) n j 1 j k 1 | q = 1 = n ! ( n m = 1 k 1 j m ) ! m = 1 k 1 j m ! . □

Proposition 2 Let q(1,1), then:

  1. (i)
    n 0 t n ( q ) n S n ( k ) ( a 1 ,, a k |q)= 1 j = 1 k ( a i t ) .
    (2.2)
  2. (ii)

    For |t|<1 and j=1,,k,

    S n ( k ) ( a 1 ,, a k |q)= m = 0 n [ n m ] q S m ( j ) ( a 1 ,, a j ) S n m ( k j ) ( a j + 1 ,, a k |q).
    (2.3)

If q=1, then

n 0 t n n ! S n ( k ) ( a 1 ,, a k |1)=exp ( t j = 0 k a j ) .
  1. (iii)
    | S n ( k ) ( a 1 ,, a k |q)| ( max 1 j k | a j | ) n S n ( k ) (1,,1|q).

Proof (i) Notice that

n 0 t n ( q ) n S n ( k ) ( a 1 ,, a k |q)= n 0 j 1 , , j k 1 0 j 1 + + j k 1 n ( t a 1 ) j 1 ( t a k 1 ) j k 1 ( t a k ) n j 1 j k 1 m = 0 k 1 ( q ) j m ( q ) n j 1 j k .

Secondly recall that 1 ( a ) = j 0 a j ( q ) j . Now the assertion is easy. (ii) follows either from direct calculation or (i) and the properties of generating functions. (iii) We use (2.1). □

Recall (i.e., [4] or [1]) that there exist sets of orthogonal polynomials forming a part of the so-called AW scheme that are orthogonal with respect to measures with densities mentioned below. Although our main interest is in providing a simple proof of the so-called AW integral, we will list related densities for better exposition and for indicating the ways of possible generalization of AW integrals and polynomials.

So let us mention first the so-called big q-Hermite polynomials { h n ( x | a , q ) } n 1 whose orthogonalizing measure has density for |a|<1. The density f b h of the orthogonalizing measure has a form (see [[1], Eq. (14.18.2)]) which can be written with the help of functions f h and φ h , namely

f b h (x|a,q)= f h (x|q) φ h (x|a,q),
(2.4)
1 1 h n (x|a,q) h m (x|a,q) f b h (x|a,q)dx= ( q ) n δ m n .
(2.5)

The form of polynomials h n (x|a,q) and their relation to q-Hermite polynomials is not important for our considerations. It can be found, e.g., in [[1], Eq. (14.26.1)] or in [[10], Eqs. (2.11), (2.12)]. So, for the sake of completeness, let us remark that from (2.4) it follows immediately that for |x|1, |a|<1,

f b h (x|a,q)= f h (x|q) n 0 a n ( q ) n h n (x|q).

Here and below, where we will present similar expansions, convergence is almost uniform since all these expansions are in fact the Fourier series and that the Rademacher-Menshov theorem can be applied following (1.5).

Let us notice immediately that following (2.4) we have

1 1 h n (x|q) f b h (x|a,q)dx= a n .

Secondly let us mention the so-called Al-Salam-Chihara polynomials { Q n ( x | a , b , q ) } n 1 that are orthogonal with respect to the measure that for |a|,|b|<1 has the density of the form (compare [[1], Eq. (14.8.2)])

f Q (x|a,b,q)= ( a b ) f h (x|q) φ h (x|a,q) φ h (x|b,q).
(2.6)

We have the following lemma that illustrates our method and we will give a very simple proof of the well-known Poisson-Mehler formula as a corollary.

Lemma 1 For |x|1, |a|,|b|<1, we have

f Q (x|a,b,q)= f h (x|q) j = 0 S j ( 2 ) ( a , b ) ( q ) j h j (x|q).
(2.7)

Proof Following (2.6) and (1.14) we have

f Q (x|a,b,q)= ( a b ) f h (x|q) j , k 0 a j b k ( q ) j ( q ) k h j (x|q) h k (x|q).

Now we use (1.6) and (1.1) and change the order of summation to get

f Q ( x | a , b , q ) = ( a b ) f h ( x | q ) m 0 ( a b ) m ( q ) m j , k m a j m b k m ( q ) j m ( q ) k m h j k + m k ( x | q ) = ( a b ) f h ( x | q ) m 0 ( a b ) m ( q ) m n , i 0 a n b i ( q ) i ( q ) n h n + i ( x | q ) = f h ( x | q ) s 0 h s ( x | q ) ( q ) s n = 0 s [ s j ] q a n b s n .

 □

As an immediate corollary of our result, we have

1 1 h n (x|q) f Q (x|a,b,q)dx= S n ( 2 ) (a,b|q).
(2.8)

Remark 5 Let a=ρ e i η , b=ρ e i η and denote y=cosη. Then

  1. (i)

    S n ( 2 ) (a,b|q)= ρ n h n (y|q),

  2. (ii)

    v(x|a)v(x|b)= ( 1 ρ 2 ) 2 4xyρ(1+ ρ 2 )+4 ρ 2 ( x 2 + y 2 ).

Proof (i) is an immediate consequence of (1.3). (ii) We have v(x|a)v(x|b)=(12ρx e i η + ρ 2 e 2 i η )(12ρx e i η + ρ 2 e 2 i η ). □

As a slightly more complicated corollary implied by Lemma 1, we have the following famous Poisson-Mehler (PM) expansion formula.

Corollary 1 For |x|,|y|<1, |ρ|<1, we have

( ρ 2 ) k = 0 ( 1 ρ 2 q 2 k ) 2 4 x y ρ q k ( 1 + ρ 2 q 2 k ) + 4 ρ 2 q 2 k ( x 2 + y 2 ) = j 0 ρ j ( q ) j h j ( x | q ) h j ( y | q ) .
(2.9)

Proof We take a=ρ e i η , b=ρ e i η and denote y=cosη. Now we use (2.6) and Remark 5(ii) to get the left-hand side multiplied by f h . Then we apply Lemma 1 and Remark 5(i) to get the right-hand side of our PM formula also multiplied by f h . Finally we cancel out f h which is positive on (1,1). □

Remark 6 The calculations we have performed while proving Lemma 1 are very much like those performed in [4] while proving Theorem 13.1.6 concerning the Poisson kernel (or Poisson-Mehler) formula. There exist many proofs of the PM formula (see, e.g., [11] or a recently obtained very short one in [12]). In fact formula (2.9) can be dated back to Carlitz who in [13] formulated it for Rogers-Szegö polynomials. The one presented above, which seems to be one of the shortest, was obtained as a by-product and, as it has already been mentioned, is almost the same as the one presented in [4].

Notice that considering (2.8) with a=ρ e i η , b=ρ e i η and y=cosη leads in view of Remark 5(i) to

1 1 h n (x|q) f Q (x|a,b,q)dx= ρ n h n (y|q),

a nice symmetric formula that appeared in [14] in a probabilistic context. Its probabilistic interpretation was exploited further in [8].

Third in our sequence of families of polynomials that constitute AW scheme is the so-called continuous dual Hahn (C2H) polynomials. Again their relationship to other sets of polynomials is not important. From [[1], Eq. (14.3.2)] it follows that the density of measure that makes them orthogonal is given by the following formula:

f C H (x|a,b,c,q)= ( a b , a c , b c ) f h (x|q) φ h (x|a,q) φ h (x|b,q) φ h (x|c,q).

We have the following lemma.

Lemma 2

f C H (x|a,b,c,q)= f h (x|q) n 0 σ n ( 3 ) ( a , b , c | q ) ( q ) n h n (x|q),

where

σ n ( 3 ) (a,b,c|q)= j = 0 n [ n j ] q q ( j 2 ) ( a b c ) j S n j ( 3 ) (a,b,c|q).
(2.10)

Proof Proof is shifted to Section 4. □

Remark 7 Notice that for |t|<1,

n 0 t n ( q ) n σ n ( 3 ) (a,c,b|q)= ( a b c t ) ( a t , b t , c t ) .

Proof Using (2.10) we have

n 0 t n ( q ) n σ n ( 3 ) ( a , c , b | q ) = n 0 t n ( q ) n j = 0 n [ n j ] q q ( j 2 ) ( a b c ) j S n j ( 3 ) ( a , b , c | q ) = j = 0 ( a b c t ) j ( q ) j q ( j 2 ) n j t n j ( q ) n j S n j ( 3 ) ( a , b , c | q ) .

Now it remains to change the index of summation in the second sum, use (2.2) and use the fact that j = 0 ( a b c t ) j ( q ) j q ( j 2 ) = ( a b c t ) . □

Corollary 2 For |a|,|b|,|c|<1,

1 1 h n (x|q) f C H (x|a,b,c,q)dx= σ n ( 3 ) (a,b,c|q).

Proof Elementary. □

The fourth family of polynomials that constitute AW scheme are the celebrated Askey-Wilson polynomials. Again their form and relationship to other families of polynomials of AW scheme are not important for our considerations. Recently a relatively rich study of these relationships was done in [10], hence it may serve as the reference. We need only the form of AW density. It is given, e.g., in [[1], Eq. (14.1.2)] and, after necessary adaptation to our notation, is presented below,

f A W ( x | a , b , c , d , q ) = ( a b , a c , a d , b c , b d , c d ) ( a b c d ) × f h ( x | a ) φ h ( x | a , q ) φ h ( x | b , q ) φ h ( x | c , q ) φ h ( x | d , q )

for |x|1, |a|,|b|,|c|,|d|<1. Our main result concerns this density and is the following.

Theorem 1 For |x|1, |a|,|b|,|c|,|d|<1,

f A W (x|a,b,c,d,q)= f h (x|q) n 0 σ n ( 4 ) ( a , b , c , d | q ) ( q ) n h n (x|q),
(2.11)

where

σ n ( 4 ) ( a , b , c , d | q ) = j = 0 n [ n j ] q ( b d ) j ( a b c d ) j S n j ( 2 ) ( b , d | q ) × k = 0 j [ j k ] q ( c b ) k a k ( a d ) j k c j k ,
(2.12)

are symmetric functions of a, b, c, d.

Proof Proof is shifted to Section 4. □

As immediate corollaries we have the following fact.

Corollary 3 For max(|a|,|b|,|c|,|d|)<1,

1 1 h n (x) f A W (x|a,b,c,d,q)dx= σ n ( 4 ) (a,b,c,d|q).
(2.13)

Proof Follows directly from (2.11). □

Remark 8 Notice that from (2.11) in fact the value of AW integral follows since we see that 1 1 f A W (x|a,b,c,d|q)dx=1, which means that the integral

1 2 π 1 1 1 1 x 2 n 0 l ( x | q n ) v ( x | a q n ) v ( x | b q n ) v ( x | c q n ) v ( x | d q n ) d x = ( a b c d ) ( q , a b , a c , a d , b c , b d , c d ) .
(2.14)

Equation (2.14) is nothing else but the celebrated AW integral. Notice also that recently there appeared at least two papers [15, 16] where (2.14) was derived from much more advanced theorems.

Remark 9 Notice also that (2.13) allows calculation of all moments of AW density. This is so since one knows the form of polynomials h n . Moments of AW density were calculated by Corteel and Williams in 2010 in [17] using combinatorial means. For complex a, b, c, d but forming conjugate pairs, this formula was also obtained independently about the same time. Namely it was done in [9] where also an elegant expansion of σ n ( 4 ) ( ρ 1 e i η , ρ 1 e i η , ρ 2 e i θ , ρ 2 e i θ |q) in terms of h n (y|q) and h n (z|q), where cosη=y and cosθ=z, was presented.

3 Generalization and open questions

3.1 Generalization

The results presented above allow the following generalization. The cases |q|<1 and q=1 will be treated separately. First let us consider |q|<1.

Let us denote a ( k ) =( a 1 ,, a k ), k=0,1, . We will assume that |x|1 and that all parameters a i have absolute values less than 1. Let us denote

g n ( x | a ( n ) , q ) = f h (x|q) j = 1 n φ h (x| a i ,q),

where functions f h and φ h were defined by (1.16) and (1.14) respectively.

We remark following (1.15) and (1.17) that

g n ( x | a ( n ) , q ) 2 ( q ) ( q ) 2 π j = 1 n 1 ( | a j | ) 2
(3.1)

for |x|1, and | a i |<1 for j=1,,n.

We have the following general result.

Lemma 3 For every n0, there exist A n ( a ( n ) ,q) a symmetric function of a ( n ) and a sequence of symmetric in a ( n ) functions { T j ( n ) ( a ( n ) , q ) } j 0 such that for | a k |<1, k=1,,n,

g n ( x | a ( n ) , q ) = A n ( a ( n ) , q ) f h (x|q) j 0 T j ( n ) ( a ( n ) , q ) ( q ) j h j (x|q).
(3.2)

Moreover,

j 0 ( T j ( n ) ( a ( n ) , q ) ) 2 <.
(3.3)

Proof Let G= L 2 (1,1,F, f h ) be the space of functions h:1,1R such that 1 1 h 2 (x) f h (x|q)dx. Notice that this space is spanned by the polynomials { h j ( x | q ) } j 0 . Visibly, under our assumptions and by (1.15), j = 1 n φ h (x| a i ,q)G. Now notice that { T j ( n ) ( a ( n ) , q ) } j 0 are coefficients of the Fourier expansion of the function j = 1 n φ h (x| a i ,q) in G with respect to { h j ( x | q ) } j 0 . Since

1 1 f h (x|q) j 0 T j ( n ) ( a ( n ) , q ) ( q ) j h j (x|q)dx=1,

A n ( a ( n ) ,q) is the value of 1 1 g n (x| a ( n ) ,q)dx. Inequality (3.3) follow properties of the Fourier expansion, more precisely Perseval’s identity. The fact that A n and { T j ( n ) } j 0 are symmetric follows the observations that j = 1 n φ h (x| a i ,q) is symmetric. □

Using formula (1.9) we can write g n in the following way where h j are q-Hermite polynomials defined by (1.4). Functions A n ( a ( n ) ,q) and { T j ( n ) ( a ( n ) , q ) } j 0 have the following interpretation:

[ 1 , 1 ] h j (x|q) g n ( x | a ( n ) , q ) dx= A n ( a ( n ) , q ) T j ( n ) ( a ( n ) , q )

for n,j0.

We have the following easy proposition giving recursions that are satisfied by functions A n and T j ( n ) .

Proposition 3 Let us define a new sequence of functions { H s ( a ( n ) , q ) } n , s 0 of n variables as follows:

m 0 a n m ( q ) m T s + m ( n 1 ) ( a ( n 1 ) , q ) = H s ( n ) ( a ( n ) , q ) m 0 a n m ( q ) m T m ( n 1 ) ( a ( n 1 ) , q ) .

Then

  1. (i)
    A n ( a ( n ) , q ) = A n 1 ( a ( n 1 ) , q ) m 0 a n m ( q ) m T m ( n 1 ) ( a ( n 1 ) , q ) ,
  2. (ii)
    T j ( n ) ( a ( n ) , q ) = s = 0 j [ j s ] q H s ( n 1 ) ( a ( n 1 ) , q ) ( a n ) j s .

Proof Proof is shifted to Section 4. □

Remark 10 The integral 1 1 g n (x| a ( n ) ,q)dx was calculated in [18] (see also Theorem 15.3.1 in [4]) by combinatorial methods. The obtained formula is, however, very complicated. Besides, the above mentioned Theorem 15.3.1 of [4] does not provide expansion (3.2) which is automatically obtained in our approach.

Remark 11 Notice also that following Proposition 3(i) we get for | a j |<1, j=1,,5,

1 1 g 5 ( x | a ( 5 ) , q ) dx= ( j 4 a j ) ( q ) 1 k < m 4 ( a k a m ) j 0 a 5 j ( q ) j σ j ( 4 ) ( a 1 , a 2 , a 3 , a 4 |q).
(3.4)

For q=0 the calculations presented in (3.4) can be carried out completely and the concise form can be obtained. This is possible due to the following simplified form of (2.12).

Theorem 2 Under | a j |<1, j=1,,5, we have

  1. (i)
    σ n ( 4 ) ( a 1 , a 2 , a 3 , a 4 | 0 ) = S n ( 2 ) ( a 2 , a 4 | 0 ) + ( 1 a 2 d ) ( 1 a 1 a 4 ) ( 1 a 1 a 2 a 3 a 4 ) a 3 S n 1 ( 3 ) ( a 2 , a 3 , a 4 | 0 ) + ( 1 a 2 a 4 ) ( 1 a 3 a 2 ) ( 1 a 1 a 2 a 3 a 4 ) a 1 S n 1 ( 3 ) ( a 1 , a 2 , a 4 | 0 ) + ( 1 a 2 a 4 ) ( 1 a 2 a 3 ) ( 1 a 1 a 4 ) a 1 a 3 ( 1 a 1 a 2 a 3 a 4 ) S n 2 ( 4 ) ( a 1 , a 2 , a 3 , a 4 | 0 ) ,
  2. (ii)
    1 1 g 5 ( x | a ( 5 ) , 0 ) dx= 1 χ 4 ( a ( 5 ) ) + χ 5 ( a ( 5 ) ) χ 1 ( a ( 5 ) ) χ 5 2 ( a ( 5 ) ) 1 j < k 5 ( 1 a j a k ) ,

where χ 1 ,, χ 5 denote respectively first five elementary symmetric functions of the vector a ( 5 ) . That is, χ j ( a ( k ) )= 1 n 1 < n 2 < n j k m = 1 j a n m .

Proof Proof is shifted to Section 4. □

For q=1, the problem of finding sequences A n ( a ( n ) |1) and { T j ( n ) ( a ( n ) , 1 ) } j 0 can be solved completely and trivially. Namely we have the following.

Proposition 4

A n ( a ( n ) | 1 ) = exp ( 1 j < k n a j a k ) , T j ( n ) ( a ( n ) , 1 ) = ( k = 1 n a k ) j .

Proof Using Remark 3 we get

g n ( x | a ( n ) , 1 ) = exp ( x 2 / 2 + x j = 1 n a j 1 2 j = 1 n a j 2 ) / 2 π = 1 2 π exp ( 1 2 ( ( j = 1 n a j ) 2 j = 1 n a j 2 ) ) × exp ( x 2 / 2 + x j = 1 n a j 1 2 ( j = 1 n a j ) 2 ) = exp ( 1 j < k n a j a k ) exp ( x 2 / 2 ) 2 π j 0 ( k = 1 n a k ) j j ! H j ( x ) .

 □

3.2 Unsolved problems and open questions

3.2.1 Questions

  • What are the compact forms of functions { T j ( n ) ( a ( n ) , q ) } j 0 , n 5 and { A n ( a ( n ) , q ) } n 5 ?

  • What are the compact forms of these functions for q=0 (free probability case)?

  • Following formula for 1 1 g 5 (x| a ( 5 ) ,0)dx given in assertion (ii) of Theorem 2 is it true that

    1 1 g 5 ( x | a ( 5 ) , q ) dx= ( χ 4 ( a ( 5 ) ) χ 5 ( a ( 5 ) ) χ 1 ( a ( 5 ) ) + χ 5 2 ( a ( 5 ) ) ) 1 j < k 5 ( a j a k ) ?

Notice that for a 5 =0 it would reduce to AW integral.

  • It would be valuable to get values { A n ( a ( n ) ,q)} for n=8,12 and so on for complex values of parameters a ( n ) but forming conjugate pairs. It would be also fascinating to find polynomials that would be orthogonalized by densities obtained in this way.

This problem follows the probabilistic interpretation of Askey-Wilson density rescaled with complex parameters. Such an interpretation of finite Markov chains of length at least 3 was presented in [9, 10]. Let { X 1 , X 2 , X 3 } denote this finite Markov chain. Recall that then AW density can be interpreted as the conditional density of X 2 | X 1 , X 3 .

It would be exciting to find out if, for say n=8, a similar probabilistic interpretation could be established. That is, if we could define five-dimensional random vector ( X 1 ,, X 5 ) with normalized function g 8 (x| a ( 8 ) ,q) as the conditional density X 3 | X 1 , X 2 , X 4 , X 5 . Note that then the chain ( X 1 ,, X 5 ) could not be Markov.

Similar questions apply to the case n=12,16, .

3.2.2 Unsolved related problems and direction of further research

  1. 1.

    In [2] we find Theorem 10.8.2 which is due to Gasper and Rahman (1990) and which can be stated in our notation. For max 1 j 5 | a j |<1, |q|<1, we have

    1 1 g 5 ( x | a ( 5 ) , q ) φ h ( x | j = 1 5 a j , q ) dx= j = 1 5 ( k = 1 , k j 5 a k ) 1 j < k 5 ( a j a k ) .

This result suggests considering the following functions:

G n , m ( x | a ( n ) , b ( m ) , q ) = f h (x|q) j = 1 n φ h ( x | a i , q ) k = 1 m φ h ( x | b k , q ) ,

where a ( n ) and b ( m ) are certain vectors of dimensions respectively n and m, find its integrals over [1,1] and expansions similar to (3.2).

  1. 2.

    Recently a paper [19] on q-Laplace transform, where many analogies to ordinary case were indicated, has appeared. What would a q-Laplace transform of the distributions that were considered above be?

4 Proofs

Proof of Lemma 2 We have

k , n , m 0 a n ( q ) n b m ( q ) m c k ( q ) k h n ( x | q ) h m ( x | q ) h k ( x | q ) = 1 ( a b ) j 0 h j ( x | q ) ( q ) j m = 0 c m ( q ) m k = 0 j [ j k ] q c k S m + j k ( 2 ) ( a , b | q ) .

Since obviously S n ( 2 ) (a,b|q)= a n w n (b/a|q), we get

k , n , m 0 a n ( q ) n b m ( q ) m c k ( q ) k h n ( x | q ) h m ( x | q ) h k ( x | q ) = 1 ( a b ) j 0 h j ( x | q ) ( q ) j m = 0 c m ( q ) m k = 0 j [ j k ] q c k a m + j k w m + j k ( b / a | q ) = 1 ( a b ) j 0 h j ( x | q ) ( q ) j k = 0 j [ j k ] q c k a j k m = 0 ( a c ) m ( q ) m w m + j k ( b / a | q ) .

Now we apply formula (1.7) and get

k , n , m 0 a n ( q ) n b m ( q ) m c k ( q ) k h n ( x | q ) h m ( x | q ) h k ( x | q ) = 1 ( a b , b c , a c ) j 0 h j ( x | q ) ( q ) j k = 0 j [ j k ] q c k a j k μ j k ( b / a | a c , q ) 1 ( b c ) ( b c ) = 1 ( a b , b c , a c ) j 0 h j ( x | q ) ( q ) j l = 0 j [ n l ] q c n l a l ( b a ) j ( a b ) j μ j ( ( a b ) 1 | a c , q ) .

Now we use (1.12) and Proposition 2(ii) and get

k , n , m 0 a n ( q ) n b m ( q ) m c k ( q ) k h n ( x | q ) h m ( x | q ) h k ( x | q ) = 1 ( a b , b c , a c ) j 0 h j ( x | q ) ( q ) j l = 0 j [ j l ] q c j l b l k = 0 l [ l k ] q ( a c ) k q ( k 2 ) w l k ( a b | q ) = 1 ( a b , b c , a c ) j 0 h j ( x | q ) ( q ) j k = 0 j [ j k ] q ( a c ) k q ( k 2 ) l = k j [ j k l k ] q c j l b l w l k ( a b | q ) = 1 ( a b , b c , a c ) j 0 h j ( x | q ) ( q ) j k = 0 j [ j k ] q ( a c ) k q ( k 2 ) m = 0 j k [ j k m ] q c j k m b k + m w m ( a / b | q ) = 1 ( a b , b c , a c ) j 0 h j ( x | q ) ( q ) j k = 0 j [ j k ] q ( a b c ) k q ( k 2 ) m = 0 j k [ j k m ] q c j k m S m ( 2 ) ( a , b | q ) .

 □

Proof of Theorem 1 Applying (2.7) we get

k , n , m , j 0 a n ( q ) n b m ( q ) m c k ( q ) k d j ( q ) j h n ( x | q ) h m ( x | q ) h k ( x | q ) h j ( x | q ) = 1 ( a b , c d ) m , k 0 S m ( 2 ) ( a , b ) S k ( 2 ) ( c , d ) ( q ) m ( q ) k h m ( x | q ) h k ( x | q ) = 1 ( a b , c d ) m , k 0 S m ( 2 ) ( a , b ) S k ( 2 ) ( c , d ) ( q ) m ( q ) k × j = 0 min ( m , k ) [ m j ] q [ k j ] q ( q ) j h m + k 2 j ( x | q ) = 1 ( a b , c d ) j 0 ( a c ) j ( q ) j m , k j a m j c k j w m ( b / a | q ) w k ( d / c | q ) ( q ) m j ( q ) k j h m j + k j ( x | q ) ,

and further

k , n , m , j 0 a n ( q ) n b m ( q ) m c k ( q ) k d j ( q ) j h n ( x | q ) h m ( x | q ) h k ( x | q ) h j ( x | q ) = 1 ( a b , c d ) j 0 ( a c ) j ( q ) j s , t 0 a s c t w s + j ( b / a | q ) w t + j ( d / c | q ) ( q ) s ( q ) t h s + t ( x | q ) = 1 ( a b , c d ) j 0 ( a c ) j ( q ) j n 0 h n ( x | q ) ( q ) n × k = 0 n [ n k ] q a k c n k w k + j ( b / a | q ) w j + n k ( d / c | q ) = 1 ( a b , c d ) n 0 h n ( x | q ) ( q ) n k = 0 n [ n k ] q a k c n k × j 0 ( a c ) j ( q ) j w k + j ( b / a | q ) w j + n k ( d / c | q ) .

Now we apply Carlitz formulae (1.10) and (1.11) to get

k , n , m , j 0 a n ( q ) n b m ( q ) m c k ( q ) k d j ( q ) j h n ( x | q ) h m ( x | q ) h k ( x | q ) h j ( x | q ) = ( a b c d ) ( a b , c d , a c , b c , a d , b d ) n 0 h n ( x | q ) ( q ) n k = 0 n [ n k ] q a k c n k × s = 0 k t = 0 n k [ k s ] q [ n k t ] q ( c b ) s ( a d ) t ( b d ) s + t ( a b c d ) s + t ( b a ) k s ( d c ) n k t = ( a b c d ) ( a b , c d , a c , b c , a d , b d ) n 0 h n ( x | q ) ( q ) n k = 0 n [ n k ] q × s = 0 k t = 0 n k [ k s ] q [ n k t ] q ( c b ) s ( a d ) t ( b d ) s + t ( a b c d ) s + t a s b k s c t d n k t .

Thus it remains to show that for every n0,

k = 0 n [ n k ] q s = 0 k t = 0 n k [ k s ] q [ n k t ] q ( c b ) s ( a d ) t ( b d ) s + t ( a b c d ) s + t a s b k s c t d n k t = j = 0 n [ n j ] q ( b d ) j ( a b c d ) j S n j ( 2 ) ( b , d | q ) k = 0 j [ j k ] q ( c b ) k a k ( a d ) j k c j k .

This fact is a result of the following calculations:

k = 0 n [ n k ] q s = 0 k t = 0 n k [ k s ] q [ n k t ] q ( c b ) s ( a d ) t ( b d ) s + t ( a b c d ) s + t a s b k s c t d n k t = s , t 0 , s + t n ( q ) n ( q ) s ( q ) t ( q ) n s t ( c b ) s ( a d ) t ( b d ) s + t ( a b c d ) s + t a s c t k = s n t n [ n t s k s ] q b k s d n k t = s , t 0 , s + t n ( q ) n ( q ) s ( q ) t ( q ) n s t ( c b ) s ( a d ) t ( b d ) s + t ( a b c d ) s + t a s c t × m = 0 n t s n s [ n t s m ] q b m d n s m t = s , t 0 , s + t n ( q ) n ( q ) s ( q ) t ( q ) n s t ( c b ) s ( a d ) t ( b d ) s + t ( a b c d ) s + t a s c t S n t s ( 2 ) ( b , d | q ) .

Now we introduce new indices of summation j=t+s, k=s. We have then

s , t 0 , s + t n ( q ) n ( q ) s ( q ) t ( q ) n s t ( c b ) s ( a d ) t ( b d ) s + t ( a b c d ) s + t a s c t S n t s ( 2 ) ( b , d | q ) = j = 0 n [ n j ] q ( b d ) j ( a b c d ) j S n j ( 2 ) ( b , d | q ) k = 0 j [ j k ] q ( c b ) k a k ( a d ) j k c j k .

 □

Proof of Proposition 3 Notice that for n=0 our formulae are true since we have g 1 (x| a 1 ,q)= f h (x|q) φ h (x| a 1 ,q)= f h (x|q) m 0 a 1 m ( q ) m h m (x|q). So T m ( 1 ) ( a 1 ,q)= a 1 m and A 1 ( a 1 ,q)=1. Next notice that

g n + 1 ( x | a ( n + 1 ) , q ) = g n ( x | a ( n ) , q ) φ h (x| a n + 1 ,q),

where we understand a ( n + 1 ) =( a 1 ,, a n , a n + 1 ). So by induction assumption the left-hand side of (3.2) is equal to

A n + 1 ( a ( n + 1 ) , q ) f h (x|q) j 0 T j ( n + 1 ) ( a ( n + 1 ) , q ) ( q ) j h j (x|q),

while the right-hand side to

A n ( a ( n ) , q ) f h (x|q) j , k 0 T j ( n ) ( a ( n ) , q ) a n + 1 k ( q ) j ( q ) k h j (x|q) h k (x|q).

We apply again (1.6) to get

j , k 0 T j ( n ) ( a ( n ) , q ) a n + 1 k ( q ) j ( q ) k h j ( x | q ) h k ( x | q ) = j , k 0 T j ( n ) ( a ( n ) , q ) a n + 1 k ( q ) j ( q ) k m = 0 j k [ k m ] q [ j m ] q ( q ) m h j + k 2 m ( x | q ) = m 0 a n + 1 m ( q ) m k , j m a n + 1 k m T j ( n ) ( a ( n ) , q ) ( q ) k m ( q ) j m h j + k 2 m ( x | q ) = m 0 a n + 1 m ( q ) m s , t 0 a n + 1 s T t + m ( n ) ( a ( n ) , q ) ( q ) s ( q ) t h s + t ( x | q ) .

Next we introduce new indices of summation r=s+t and j=s and get

j , k 0 T j ( n ) ( a ( n ) , q ) a n + 1 k ( q ) j ( q ) k h j ( x | q ) h k ( x | q ) = m 0 a n + 1 m ( q ) m r = 0 h r ( x | q ) ( q ) r j = 0 r [ r j ] q a n + 1 j T m + r j ( n ) ( a ( n ) , q ) = r = 0 h r ( x | q ) ( q ) r j = 0 r [ r j ] q a n + 1 j m 0 a n + 1 m ( q ) m T m + r j ( n ) ( a ( n ) , q ) = m 0 a n + 1 m ( q ) m T m ( n ) ( a ( n ) , q ) r = 0 h r ( x | q ) ( q ) r j = 0 r [ r j ] q a n + 1 j H r j ( n ) ( a ( n ) , q ) = A n + 1 ( a ( n + 1 ) , q ) A n ( a ( n ) , q ) r = 0 h r ( x | q ) ( q ) r j = 0 r [ r j ] q a n + 1 j H r j ( n ) ( a ( n ) , q ) .

 □

Proof of Theorem 2 We use (2.12) and utilizing Remark 1 we get

σ n ( 4 ) ( a , b , c , d | 0 ) = S n ( 2 ) ( b , d | 0 ) + ( 1 b d ) ( 1 a b c d ) j = 1 n S n j ( 2 ) ( b , d | q ) × ( ( 1 a d ) c j + ( 1 c b ) a j + ( 1 c b ) ( 1 a d ) a c k = 1 j 1 a k 1 c j 1 k ) .

And further

σ n ( 4 ) ( a , b , c , d | 0 ) = S n ( 2 ) ( b , d | 0 ) + ( 1 b d ) ( 1 a b c d ) j = 1 n S n j ( 2 ) ( b , d | q ) ( ( 1 a d ) c j + ( 1 c b ) a j + ( 1 c b ) ( 1 a d ) a c S j 2 ( 2 ) ( a , c | 0 ) ) = S n ( 2 ) ( b , d | 0 ) + ( 1 b d ) ( 1 a b c d ) j = 1 n S n j ( 2 ) ( b , d | q ) ( ( 1 a d ) c j + ( 1 c b ) a j ) + ( 1 b d ) ( 1 c b ) ( 1 a d ) a c ( 1 a b c d ) j = 2 n S n j ( 2 ) ( b , d | q ) S j 2 ( 2 ) ( a , c | 0 ) .

Now we use formula (2.3). Then we replace a by a 1 , b by a 2 and so on. Finally we use formulae (3.4) and (2.2) remembering that ( 0 ) n =1 leads to our integral formula. □

References

  1. Koekoek R, Lesky PA, Swarttouw RF Springer Monographs in Mathematics. In Hypergeometric Orthogonal Polynomials and Their q-Analogues. Springer, Berlin; 2010. With a foreword by Tom H. Koornwinder. MR2656096 (2011e:33029)

    Chapter  Google Scholar 

  2. Andrews GE, Askey R, Roy R Encyclopedia of Mathematics and Its Applications 71. In Special Functions. Cambridge University Press, Cambridge; 1999. ISBN:0-521-78988-5. MR1688958 (2000g:33001) (2002k:33011)

    Chapter  Google Scholar 

  3. Szabłowski PJ: On peculiar properties of generating functions of some orthogonal polynomials. J. Phys. A, Math. Theor. 2012., 45: Article ID 365207. arXiv:1204.0972

    Google Scholar 

  4. Ismail MEH Encyclopedia of Mathematics and Its Applications 98. In Classical and Quantum Orthogonal Polynomials in One Variable. Cambridge University Press, Cambridge; 2005. MR2191786 (2007f:33001). With two chapters by Walter Van Assche. With a foreword by Richard A. Askey

    Chapter  Google Scholar 

  5. Szabłowski PJ: On the q -Hermite polynomials and their relationship with some other families of orthogonal polynomials. Demonstr. Math. 2013, 66(4):679-708. arXiv:1101.2875

    Google Scholar 

  6. Carlitz L: Some polynomials related to theta functions. Ann. Mat. Pura Appl. (4) 1956, 41: 359-373. MR0078510 (17,1205e) 10.1007/BF02411676

    Article  MathSciNet  Google Scholar 

  7. Carlitz L: Generating functions for certain Q -orthogonal polynomials. Collect. Math. 1972, 23: 91-104. MR0316773 (47 #5321)

    MathSciNet  Google Scholar 

  8. Bryc W, Matysiak W, Szabłowski PJ: Probabilistic aspects of Al-Salam-Chihara polynomials. Proc. Am. Math. Soc. 2005, 133(4):1127-1134. (electronic). MR2117214 (2005m:33033) 10.1090/S0002-9939-04-07593-8

    Article  Google Scholar 

  9. Szabłowski PJ: On the structure and probabilistic interpretation of Askey-Wilson densities and polynomials with complex parameters. J. Funct. Anal. 2011, 261(3):635-659. arXiv:1011.1541. MR2799574 10.1016/j.jfa.2011.04.002

    Article  MathSciNet  Google Scholar 

  10. Szabłowski PJ: Befriending Askey-Wilson polynomials. Infin. Dimens. Anal. Quantum Probab. Relat. Top. 2014., 17(3): Article ID 1450015. arXiv:1111.0601

    Google Scholar 

  11. Bressoud DM: A simple proof of Mehler’s formula for q -Hermite polynomials. Indiana Univ. Math. J. 1980, 29(4):577-580. MR0578207 (81f:33009) 10.1512/iumj.1980.29.29043

    Article  MathSciNet  Google Scholar 

  12. Szabłowski PJ: Expansions of one density via polynomials orthogonal with respect to the other. J. Math. Anal. Appl. 2011, 383(1):35-54. arXiv:1011.1492. MR2812716 10.1016/j.jmaa.2011.04.087

    Article  MathSciNet  Google Scholar 

  13. Carlitz L: Some polynomials related to theta functions. Duke Math. J. 1957, 24: 521-527. MR0090672 (19,849e) 10.1215/S0012-7094-57-02459-6

    Article  MathSciNet  Google Scholar 

  14. Bryc W: Stationary random fields with linear regressions. Ann. Probab. 2001, 29(1):504-519. MR1825162 (2002d:60014) 10.1214/aop/1008956342

    Article  MathSciNet  Google Scholar 

  15. Liu Z-G: An identity of Andrews and the Askey-Wilson integral. Ramanujan J. 2009, 19(1):115-119. MR2501242 (2010g:33007) 10.1007/s11139-008-9122-4

    Article  MathSciNet  Google Scholar 

  16. Ma XR: A new proof of the Askey-Wilson integral via a five-variable Ramanujan’s reciprocity theorem. Ramanujan J. 2011, 24(1):61-65. MR2765601 10.1007/s11139-010-9221-x

    Article  MathSciNet  Google Scholar 

  17. Corteel S, Williams LK: Staircase tableaux, the asymmetric exclusion process, and Askey-Wilson polynomials. Proc. Natl. Acad. Sci. USA 2010, 107(15):6726-6730. MR2630104 10.1073/pnas.0909915107

    Article  MathSciNet  Google Scholar 

  18. Ismail MEH, Stanton D, Viennot G: The combinatorics of q -Hermite polynomials and the Askey-Wilson integral. Eur. J. Comb. 1987, 8(4):379-392. MR0930175 (89h:33015)

    Article  MathSciNet  Google Scholar 

  19. Chung WS, Kim T, Kwon HI: On the q -analog of the Laplace transform. Russ. J. Math. Phys. 2014, 21(2):156-168. MR3215667 10.1134/S1061920814020034

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The author is very grateful to an unknown referee for pointing out additional references and just evaluation of the paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Paweł J Szabłowski.

Additional information

Competing interests

The author declares that he has no competing interests.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0), which permits use, duplication, adaptation, distribution, and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Szabłowski, P.J. Askey-Wilson integral and its generalizations. Adv Differ Equ 2014, 316 (2014). https://doi.org/10.1186/1687-1847-2014-316

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-1847-2014-316

Keywords