A Characterization Theorem
Total Page:16
File Type:pdf, Size:1020Kb
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Journal of Computational and Applied Mathematics 233 (2009) 621–629 Contents lists available at ScienceDirect Journal of Computational and Applied Mathematics journal homepage: www.elsevier.com/locate/cam On Askey-scheme and d-orthogonality, I: A characterization theorem Y. Ben Cheikh a,∗, I. Lamiri b, A. Ouni c a Faculté des Sciences de Monastir, Département de Mathématiques, 5019 Monastir, Tunisia b École Supérieure des Sciences et des Technologies de Hammam Sousse, 4011 Hammam Sousse, Tunisia c Institut préparatoire aux études d'ingénieur de Monastir, 5019 Monastir, Tunisia article info a b s t r a c t Article history: This is the first in a series of papers dealing with generalized hypergeometric d-orthogonal Received 30 October 2007 polynomials extending the polynomial families in the Askey-scheme. In this paper, we give a characterization theorem to introduce new examples of generalized hypergeometric Keywords: d-orthogonal polynomials to be studied in the forthcoming works. For d D 1, we obtain d-orthogonality an unification of some known characterization theorems in the orthogonal polynomials Generalized hypergeometric polynomials theory. Askey-scheme ' 2009 Elsevier B.V. All rights reserved. Gould–Hooper polynomials Humbert polynomials 1. Introduction The generalized hypergeometric functions pFq.z/ with p numerator and q denominator parameters are defined by ([1], for instance) 1 T U m .ap/ X ap m z pFq I z VD ; (1.1) .bq/ Tb U mW mD0 q m C where a designates the set a a a , Ta U D Qr a and a D Γ .a p/ . z being a variable in the set of . p/ 1; 2;:::; p r p iD1. i/p . /p Γ .a/ C complex numbers. A generalized hypergeometric function pFq.z/ is reduced to a polynomial of degree n called generalized hypergeometric polynomial if m numerator parameters take the forme ∆.m; −n/, where ∆.r; α/ abbreviates the array of the r parameters: αCj−1 D r , j 1;:::; r. Around 1980 the Askey-scheme of generalized hypergeometric polynomials [2] becomes widely known as a convenient graphical way to see the hierarchy of hypergeometric orthogonal polynomials. The Askey-scheme soon got a q-analogue, which was made possible by the discovery of the Askey–Wilson polynomials. Recently, other similar tables to the Askey- scheme [3,4] were coming after the study of the so-called Krall-type orthogonal polynomials (perturbations of linear functional via the addition of Dirac delta functions) and the multiple orthogonal polynomials. On other hand, in the last years, a generalization of the notion of orthogonality, the so-called d-orthogonality, have been intensively studied. It is then natural to look for a similar table to the Askey-scheme in the context of the d-orthogonality notion. This notion was introduced in [5] and completed in [6] as follows. Let P be the vector space of polynomials with coefficients in C and let P 0 be its algebraic dual. We denote by hu; f i the effect of the functional u 2 P 0 on the polynomial f 2 P . A polynomial sequence fPngn≥0 is called a polynomial set (PS, for shorter) if and only if deg Pn D n for all non-negative integer n. Let d be a ∗ Corresponding author. E-mail addresses: [email protected] (Y. Ben Cheikh), [email protected] (I. Lamiri), [email protected] (A. Ouni). 0377-0427/$ – see front matter ' 2009 Elsevier B.V. All rights reserved. doi:10.1016/j.cam.2009.02.029 622 Y. Ben Cheikh et al. / Journal of Computational and Applied Mathematics 233 (2009) 621–629 positive integer. We say that the PS fPngn≥0 is d-orthogonal (d-OPS, for shorter) with respect to the d-dimensional functional t vector Γ D .Γ0; Γ1;:::; Γd−1/ if it satisfies the following orthogonality relations: hΓ ; P P i D 0; r > nd C k; n 2 D f0; 1; 2;:::g; k r n N (1.2) hΓk; PnPndCki 6D 0; n 2 N; for each integer k belonging to f0; 1;:::; d − 1g. nDn0 In the finite case where Pn is defined for n D 0;:::; n0; n0 2 N; the polynomial sequence fPng D is a PS if deg Pn D n D n 0 D f gn n0 for n 0;:::; n0. Furthermore, we say that the PS Pn nD0 is a d-OPS with respect to the d-dimensional functional vector t Γ D .Γ0; Γ1;:::; Γd−1/ if it satisfies (1.2) with n D 0;:::; n0. For d D 1, the d-orthogonality is reduced to the orthogonality in the general sense defined in [7,8]. The d-orthogonality conditions (1.2) are equivalent to the fact that the polynomials Pn, n ≥ 0, satisfy a .d C 1/-order recurrence relation of the type [6]: C Xd 1 xPn.x/ D αk;d.n/Pn−dCk.x/; n 2 N; (1.3) kD0 with the regularity conditions αdC1;d.n)α0;d.n/ 6D 0, n ≥ d; and the convention, P−n D 0; n ≥ 1. This result, for d D 1, is reduced to the so-called Favard Theorem [8]. The d-orthogonality notion seems to appear rather naturally in some approximation problems, in particular in simultaneous rational approximation of several functions defined by their series expansions. This new concept of orthogonality appears as a special case of the general multiple orthogonality (see, for instance, [9–16]). This generalization has received much attention these past years. That, many polynomials generalizing known orthogonal ones were introduced by solving certain characterization problems in the context of the d-orthogonality (see, for instance, [17–29]). In this work, our interest is to give a characterization theorem for classes of generalized hypergeometric polynomials containing, as particular cases, all polynomials belonging to the Askey-scheme. That allows us: (i) To introduce new examples of generalized hypergeometric d-orthogonal polynomials which are useful to construct similar table to the Askey-scheme in the context of d-orthogonality. (ii) To derive new characterization theorems, based on generalized hypergeometric representations, for some known d-orthogonal polynomials as Gould–Hopper polynomials [30], Humbert polynomials [31], a generalization of Laguerre polynomials studied in [22] and a generalization of Charlier polynomials studied in [19]. Notice that the known characterization theorems for these polynomial sets are related to special types of generating functions. (iii) To unify many known characterization theorems for generalized hypergeometric orthogonal polynomials. That concerns, for instance, Hermite, Laguerre, Jacobi, Bessel, Charlier and Meixner polynomials. (iv) To state, as for as we known, for the first time characterization theorems for Wilson, Racah, Hahn, Continuous Hahn, Dual Hahn, Continuous dual Hahn, Meixner–Pollaczek and Krawtchouk polynomials. 2. Main result 2.1. A characterization theorem In the sequel, we use the following notations: • m; l; p; q 2 N; such that m ≥ 2. • c; µ, ai; bj 2 CI i D 1;:::; p; j D 1;:::; qI such that ai 6D bj and µ 62 −N. • D Qp C D Qq C N.x/ iD1.x ai/; D.x/ jD1.x bj/: • λi.x/; i D 1;:::; s being s polynomials of degree 1 and fλi.x/; i D 1;:::; sg being a s-separable product set, Qs C D C D Qs i.e. there exists a monic polynomial π of degree s such that: iD1 .λi.x/ r/ λ(x/ π.r/ with λ(x/ iD1 λi.x/. Let us consider the following classes of generalized hypergeometric PSs. D f gn n0 f g1 Class A1: The set of PS Pn nD0 or Pn nD0 defined by: n ∆.m; −n/; .ap/ 1 Pn.xI m;.ap/; .bq// D x mCpFq I ; .bq/ xm D f gn n0 f g1 Class A2: The set of PS Pn nD0 or Pn nD0 defined by: − C µ I D n; ∆.l; n µ), .ap/I Pn .x l;.ap/; .bq// lCpC1Fq x ; .bq/ D f gn n0 f g1 Class A3: The set of PS Pn nD0 or Pn nD0 defined by: − C 1 µ I D n; ∆.l; n µ), (λs.x//; .ap/I Pn (λ(x/ l; c;.ap/; .bq// lCsCpC1Fq ; .bq/ c Y. Ben Cheikh et al. / Journal of Computational and Applied Mathematics 233 (2009) 621–629 623 D f gn n0 f g1 Class B: The set of PS Pn nD0 or Pn nD0 defined by: − 1 µ I D n ∆.m; n/; .ap/ I Pn .x m;.ap/; .bq// .µ/n x mCpFmCq−1 ; ∆.m − 1; 1 − µ − n/; .bq/ xm D f gn n0 f g1 Class C: The set of PS Pn nD0 or Pn nD0 defined by: ∆ .m; −n/ ;.ap/ 1 Pn(λ(x/I c; m;.ap/; .bq// D [λs.x/]n mCpFsmCq I : ∆ .m; 1 − .λs.x// − n/ ;.bq/ c Put A D A1 [ A2 [ A3: Every PS in the Askey-scheme belongs to the class A (see Table 2). The polynomials defined by the class B are reduced to the Gegenbauer ones [32] for m D 2 and p D q D 0. The polynomials defined by the class C are reduced to the Charlier ones [32] for m D s D 1 and p D q D 0. Our interest here is to solve the following characterization problem: P: Find all d-OPSs in A [ B [ C. Such a characterization takes into account the fact that PS which are obtainable from one there by a linear change of variable are assumed equivalent. A solution of this problem is given by the following.