Askey scheme

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In mathematics, the Askey scheme is a way of organizing orthogonal polynomials of hypergeometric or basic hypergeometric type into a hierarchy. For the classical orthogonal polynomials discussed in Andrews & Askey (1985),[1] the Askey scheme was first drawn by Labelle (1985)[2] and by Askey and Wilson (1985),[3] and has since been extended by Koekoek & Swarttouw (1998)[4] and Koekoek, Lesky & Swarttouw (2010)[5] to cover basic orthogonal polynomials.

Askey scheme for hypergeometric orthogonal polynomials

[edit | edit source]

Koekoek, Lesky & Swarttouw (2010)[6] give the following version of the Askey scheme:

4F3(4)
Wilson | Racah
3F2(3)
Continuous dual Hahn | Continuous Hahn | Hahn | dual Hahn
2F1(2)
Meixner–Pollaczek | Jacobi | Pseudo Jacobi | Meixner | Krawtchouk
2F0(1)  /  1F1(1)
Laguerre | Bessel | Charlier
2F0(0)
Hermite

Here pFq(n) indicates a hypergeometric series representation with n parameters

Askey scheme for basic hypergeometric orthogonal polynomials

[edit | edit source]

Koekoek, Lesky & Swarttouw (2010)[7] give the following scheme for basic hypergeometric orthogonal polynomials:

4ϕ3
Askey–Wilson | q-Racah
3ϕ2
Continuous dual q-Hahn | Continuous q-Hahn | Big q-Jacobi | q-Hahn | dual q-Hahn
2ϕ1
Al-Salam–Chihara | q-Meixner–Pollaczek | Continuous q-Jacobi | Big q-Laguerre | Little q-Jacobi | q-Meixner | Quantum q-Krawtchouk | q-Krawtchouk | Affine q-Krawtchouk | Dual q-Krawtchouk
2ϕ0/1ϕ1
Continuous big q-Hermite | Continuous q-Laguerre | Little q-Laguerre | q-Laguerre | q-Bessel | q-Charlier | Al-Salam–Carlitz I | Al-Salam–Carlitz II
1ϕ0
Continuous q-Hermite | Stieltjes–Wigert | Discrete q-Hermite I | Discrete q-Hermite II

Completeness

[edit | edit source]

While there are several approaches to constructing still more general families of orthogonal polynomials, it is usually not possible to extend the Askey scheme by reusing hypergeometric functions of the same form. For instance, one might naively hope to find new examples given by

pn(x)=q+1Fq(n,n+μ,a1(x),,aq1(x)b1,,bq;1)

above q=3 which corresponds to the Wilson polynomials. This was ruled out in Cheikh, Lamiri & Ouni (2009)[8] under the assumption that the ai(x) are degree 1 polynomials such that

i=1q1(ai(x)+r)=i=1q1ai(x)+π(r)

for some polynomial π(r).

References

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  3. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  4. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  5. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  6. ^ Koekoek, Lesky & Swarttouw (2010, p.183)
  7. ^ Koekoek, Lesky & Swarttouw (2010, p.413)
  8. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).

Further reading

[edit | edit source]
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).