- Research
- Open access
- Published:
A new family of orthogonal polynomials in three variables
Journal of Inequalities and Applications volume 2020, Article number: 170 (2020)
Abstract
In this paper we introduce a six-parameter generalization of the four-parameter three-variable polynomials on the simplex and we investigate the properties of these polynomials. Sparse recurrence relations are derived by using ladder relations for shifted univariate Jacobi polynomials and bivariate polynomials on the triangle. Via these sparse recurrence relations, second order partial differential equations are presented. Some connection relations are obtained between these polynomials. Also, new results for the four-parameter three-variable polynomials on the simplex are given. Finally, some generating functions are derived.
1 Introduction
The classical univariate Jacobi polynomials \(P_{n}^{(a,b)}(x)\) defined by the Rodrigues formula,
are orthogonal with respect to the weight function \(w_{a,b}(x)=(1-x)^{a}(1+x)^{b}\) on the interval \((-1,1)\) for \(a,b>-1\). The Jacobi polynomials on the interval \((0,1)\), also referred as shifted univariate Jacobi polynomials [8], which we denote by \(\widetilde{P}_{n}^{(a,b)}(x):=P_{n}^{ ( a,b ) } ( 2x-1 )\),
are orthogonal on the interval \(( 0,1 ) \) with respect to the weight function \(\widetilde{w}_{a,b}(x)=(1-x)^{a}x^{b}\) where \(a,b>-1\). Indeed, we have
where
with \(m,n\in\mathbb{N}_{0}:=\mathbb{N}\cup \{ 0 \}\), and \(\delta_{m,n}\) is the Kronecker delta [10, 13].
In 1975, Koornwinder [6] gave a general method to derive multivariate orthogonal polynomials from univariate orthogonal polynomials. One of the examples of Koornwinder’s method is the Jacobi polynomials on the triangle
which are orthogonal on the two-dimensional simplex
with respect to the weight function \(w_{a,b,c} (x,y)=x^{a}y^{b}(1-x-y)^{c}\) for \(a,b,c>-1\),
In [9], Olver et al. introduced a bivariate four-parameter variant of the Koornwinder polynomials on the triangle defined by
where \(a, b, c, d>-1\), n and k are integers satisfying \(0\leq k\leq n\). These polynomials are orthogonal on the two-dimensional simplex \({\mathbb{T}}^{2}\), defined in (5), with respect to the weight function
Indeed, it follows that
In the case \(d=0\), (8) gives the bivariate Koornwinder polynomials on the triangle defined in (4). Olver et al. [9] obtained sparse recurrence relations by using some differential relations mapping \(P_{n,k}^{(a,b,c,d)} ( x,y )\) to scalar multiple of \(P_{\widetilde{n},\widetilde{k}}^{ ( \widetilde{a},\widetilde {b},\widetilde{c},\widetilde{d} ) } ( x,y )\), where the new parameters in \(P_{\widetilde{n},\widetilde{k}}^{ ( \widetilde{a},\widetilde{b},\widetilde{c},\widetilde{d} ) } ( x,y )\) are n, k, a, b, c, or d, respectively, or these values incremented or decremented by 1. This approach allows one to derive new recurrence relations for the bivariate (classical) Koornwinder polynomials \(P_{n,k}^{ (a,b,c ) } ( x,y )\) (see [9]).
Let
be the three-dimensional simplex. In [3], Dunkl and Xu introduced the following family of three-variable polynomials:
where \(n_{1}, n_{2}, n_{3}, n\in\mathbb{N}_{0}\) and \(n_{1}+n_{2}+n_{3}=n\). These polynomials are orthogonal on the simplex \({\mathbb{T}}^{3}\) with respect to the weight function
for \(\alpha,\beta,\gamma,\delta>-1\) (see, for details, [3]).
In this paper, we consider a six-parameter variant of the three-variable polynomials (10) defined as
where \(n_{1}, n_{2}, n_{3}, n\in\mathbb{N}_{0}\) and \(n_{1}+n_{2}+n_{3}=n\). The polynomials in (11) are orthogonal with respect to the weight function
for \(\alpha,\beta,\gamma,\delta,a,b>-1\) on the simplex \({\mathbb {T}}^{3}\) defined in (9). More precisely,
where \(h_{n}^{ ( a,b ) }\) is given in (3). In the case \(a=b=0\), (11) gives the orthogonal polynomials given by (10) on the simplex \({\mathbb{T}}^{3} \) in [3].
By the motivation of the bivariate four-parameter variant of the Koornwinder polynomials (7) defined by Olver et al. and the six-parameter variant of the three-variable polynomials given by (11), we can define a 2d-parameter variant of the multivariate polynomials on the simplex.
In general, let \(\mathbf{x}_{j}\) and \(\mathbf{n}^{j}\) be defined as
and
Also, let \(\mathbf{x}= ( x_{1},\dots,x_{d} ) \), \(\mathbf {n}= ( n_{1},\dots,n_{d} ) \), \(\vert \mathbf{n} \vert =n_{1}+\cdots+n_{d}=n\), \(\boldsymbol{\alpha} = ( \alpha_{1},\dots,\alpha_{2d} ) \) and
A 2d-parameter variant of the d-variable polynomials on the simplex
is defined by
where \(P_{n_{j}}^{ ( a_{j},b_{j} ) } ( x_{j} ) \) indicates the classical univariate Jacobi polynomial defined in (1), and \(a_{j}=2 \vert \mathbf{n}^{j+1} \vert + \vert \boldsymbol{\alpha }^{j+1} \vert + \vert \widetilde{\boldsymbol{\alpha }}^{d+j+1} \vert +d-j\), \(b_{j}=\alpha_{j}\). These polynomials are orthogonal with respect to the weight function \(W_{\alpha} ( \mathbf{x} ) =x_{1}^{\alpha_{1}}\cdots x_{d}^{\alpha_{d}} ( 1- \vert x_{d} \vert ) ^{\alpha_{d+1}}\prod_{j=1}^{d-1} ( 1- \vert x_{j} \vert ) ^{\alpha_{d+j+1}}\) for \(\alpha_{j}>-1\), \(j=1,2,\dots,2d\) where \(\vert \mathbf{x}_{j} \vert =x_{1}+\cdots+x_{j}\). In fact, it follows that
where \(\delta_{\mathbf{n,m}}\) is Kronecker delta, \(\mathbf {dx}=dx_{1}\cdots dx_{d}\) and
In the case \(\alpha_{j}=0\) (\(j=d+2,\dots,2d\)), (13) gives the classical orthogonal polynomials on the simplex \({\mathbb{T}}^{d} \) in [3].
In this paper, we apply the techniques used in [9] to the six-parameter variant of the three-variable polynomials on the simplex \({\mathbb{T}}^{3}\) rather than multivariate case, which is not easy to apply these techniques for the multivariate case. The relations obtained by these techniques give new results for the well-known three-variable polynomials with four parameters on the simplex \({\mathbb{T}}^{3}\). The structure of this paper is as follows. In the next section, we recall some differential relations and the corresponding sparse recurrence relations given in [9] for univariate (shifted) Jacobi polynomials \(\widetilde{P}_{n}^{ ( a,b )}(x)\) and the bivariate polynomials \(P_{n,k}^{ ( a,b,c,d )} ( x,y )\). Some extra relations are also presented for the bivariate polynomials, which are new to the best of our knowledge. In Sect. 3, we give the corresponding differential relations for the polynomials (11) on the simplex \({\mathbb{T}}^{3}\). In Sect. 4, sparse recurrence relations for the polynomials (10) are deduced. Finally, in Sect. 5, some generating functions are obtained.
2 Preliminaries
In [9], Olver et al. obtained 24 differential relations and the corresponding sparse recurrence relations for a bivariate four-parameter variant of the Koornwinder polynomials defined by (7) on the triangle by using 12 differential relations and the corresponding sparse recurrence relations satisfied by univariate (shifted) Jacobi polynomials given by (2). In this paper, by using the techniques of reference [9] entirely, we present 36 sparse recurrence relations for a six-parameter variant of the three-variable polynomials. As a result of these sparse recurrence relations, we derive second order differential equations. For this purpose, we recall the results given in [9]. Let
Then the following sparse recurrence relations for Jacobi polynomials hold true:
Moreover, the following second order differential relations are satisfied:
From the above relations we also have the following second order differential equations for the univariate shifted Jacobi polynomials:
The first, second and the last two relations give exactly the second order differential equation for the univariate shifted Jacobi polynomials. Moreover, the third, fourth, seventh, and eighth relations give the second order differential equation for the univariate shifted Jacobi polynomials multiplied by x, while the fifth, sixth, ninth, and tenth relations give the second order differential equation for the univariate shifted Jacobi polynomials multiplied by \(1-x\).
By using these 12 relations, in [9] 24 relations for the bivariate orthogonal polynomials \(P_{n,k}^{(a,b,c,d)} ( x,y )\) defined in (7) are derived. These 24 relations map \(P_{n,k}^{(a,b,c,d)} ( x,y )\) to a scalar multiple of \(P_{\widetilde{n},\widetilde{k}}^{ ( \widetilde{a},\widetilde {b},\widetilde{c},\widetilde{d} ) } ( x,y )\), where the new parameters in \(P_{\widetilde{n},\widetilde{k}}^{ (\widetilde{a},\widetilde{b},\widetilde{c},\widetilde{d} ) } (x,y ) \) are n, k, a, b, c or d, respectively, incremented or decremented by 0 or 1. Following the notations in [9], let
and
The sparse recurrence relations are given as follows:
and
Moreover, the following second order differential relations hold:
and
The polynomials \(P_{n,k}^{(a,b,c,d)} ( x,y ) \) defined in (7) satisfy the differential equations
and
Equation (15) is given in [9]. From \(L_{2}u-\frac {1}{1-x}L_{1}u=0\), it also leads to
Remark 1
For second order differential equations in the first set given above, the first, second and the last two equations give exactly the second order equation in the form of (15). The third, fourth, seventh and eighth equations give Eq. (15) multiplied by y. The fifth, sixth, ninth and tenth equations give Eq. (15) multiplied by \(1-x-y\).
For second order differential equations in the second set given above, the first, second and the last two equations give exactly the second order equation in the form of (17). The third, fourth, seventh and eighth equations give Eq. (17) multiplied by x. The fifth, sixth, ninth and tenth equations give Eq. (17) multiplied by \(1-x\).
Remark 2
The partial differential equation (17) has also a monic solution [1], given by
which can be also written as
in terms of the shifted Jacobi polynomials \(\widetilde{P}_{n}^{ ( a,b ) }(x)\) defined in (2). Notice that in this representation of the monic solution of the partial differential equation (17) the parameters of the shifted Jacobi polynomials depend on the degree i.e. they are varying orthogonal polynomials [14].
3 Differential relations for \(P_{n}^{(\alpha,\beta,\gamma ,\delta,a,b) }(x,y,z) \)
By using the 12 differential relations given in Sect. 2 for the univariate shifted Jacobi polynomials \(\widetilde{P}_{n}^{ ( a,b ) }(x)\) defined in (2) and the 24 differential relations also given in Sect. 2 for the polynomials \(P_{n,k}^{(a,b,c,d)} (x,y ) \) defined in (7), we obtain 36 differential relations for \(P_{n_{1},n_{2},n_{3}}^{(\alpha ,\beta,\gamma,\delta,a,b)}(x,y,z)\) defined in (11), which map \(P_{n_{1},n_{2},n_{3}}^{ (\alpha,\beta,\gamma,\delta,a,b ) }(x,y,z) \) to a scalar multiple of \(P_{\widetilde{n_{1}},\widetilde {n_{2}},\widetilde{n_{3}}}^{ ( \widetilde{\alpha},\widetilde{\beta},\widetilde{\gamma },\widetilde{\delta},\widetilde{a},\widetilde{b} ) }(x,y,z)\) where the parameters in the new family \(P_{\widetilde {n_{1}},\widetilde{n_{2}},\widetilde{n_{3}}}^{ ( \widetilde {\alpha},\widetilde{\beta},\widetilde{\gamma},\widetilde{\delta },\widetilde{a},\widetilde{b} ) }(x,y,z) \) are \(n_{1}\), \(n_{2}\), \(n_{3}\), α, β, γ, δ, a, b incremented or decremented by 0 or 1.
Let
and
and
where \(n_{1}+n_{2}+n_{3}=n\), \(\alpha+\beta+\gamma+\delta+a+b=e\) and \(w=1-x-y-z\).
The differential relations above are chosen so that the recurrence relations in the next theorem are obtained for \(\mathcal{N}_{i,0}\) (or \(\mathcal{N}_{i,0}^{+}\)) and \(\mathcal{N}_{0,i}\) (or \(\mathcal {N}_{0,i}^{+}\)) by applying \(\mathcal{M}_{i,0}\) (or \(\mathcal {M}_{i,0}^{+}\)) and \(\mathcal{M}_{0,i}\) (or \(\mathcal{M}_{0,i}^{+}\)) to the first part,
respectively, and for \(\mathcal{O}_{i,0}\) (or \(\mathcal {O}_{i,0}^{+}\)) by applying \(\widetilde{\mathcal{L}}_{i}\) (or \(\widetilde{\mathcal{L}}_{i}^{+}\)) to the second part \(P_{n_{3}}^{ ( \delta,\gamma ) } ( \frac {2z}{1-x-y}-1 ) \) in the polynomial \(P_{n_{1},n_{2},n_{3}}^{ (\alpha,\beta,\gamma,\delta,a,b ) }(x,y,z) \) for \(1\leq i\leq6\).
Theorem 1
The following sparse recurrence relations for\(P_{n_{1},n_{2},n_{3}}^{(\alpha,\beta,\gamma,\delta ,a,b) }(x,y,z)\)hold true:
Moreover,
Also,
where\(n_{1}+n_{2}+n_{3}=n\)and\(\alpha+\beta+\gamma+\delta+a+b=e\).
Proof
Let us denote
If we apply \(\mathcal{M}_{0,1}\) to both sides of \(P_{n_{1},n_{2},n_{3}}^{(\alpha,\beta,\gamma,\delta,a,b) }(x,y,z)\), we have
From the relation
it follows that
Similarly, in view of \(\mathcal{M}_{i,0}\), \(\mathcal {M}_{i,0}^{+}\), \(\mathcal{M}_{0,i}\), \(\mathcal{M}_{0,i}^{+}\), \(\widetilde {\mathcal{L}}_{i}\) and \(\widetilde{\mathcal{L}}_{i}^{+}\), \(1\leq i\leq 6\), the other recurrence relations are obtained. □
From these relations we have
and
and
Theorem 2
The polynomials\(P_{n_{1},n_{2},n_{3}}^{(\alpha,\beta,\gamma,\delta ,a,b) }(x,y,z) \)defined in (11) satisfy the following second order partial differential equations:
and
Proof
The first equation is obtained from
and the second and third equations follow from \(\mathcal {N}_{01}\mathcal{N}_{01}^{+}\) and \(\mathcal{O}_{10}\mathcal {O}_{10}^{+}\), respectively. From
we obtain the last equation. □
Remark 3
For \(a=b=0\), the first equation reduces to the partial differential equation [3] for the polynomials \(P_{n_{1},n_{2},n_{3}}^{ ( \alpha,\beta,\gamma,\delta ) }(x,y,z) \) defined in (10)
Remark 4
For the second order differential equations in the first set given above, the first, second and the last two equations give the second order equation in the form of (21). The third, fourth, seventh and eighth equations give Eq. (21) multiplied by y. The fifth, sixth, ninth and tenth equations give Eq. (21) multiplied by \(1-x-y\). For the second order differential equations in the second set, the first, second and the last two equations give the second order equation in the form of (23). The third, fourth, seventh and eighth equations give Eq. (23) multiplied by x. The fifth, sixth, ninth and tenth equations give Eq. (23) multiplied by \(1-x\). Moreover, for the second order differential equations given in the third set, the first, second and the last two equations give the second order equation in the form of (22). The third, fourth, seventh and eighth equations give Eq. (22) multiplied by z. The fifth, sixth, ninth and tenth equations give Eq. (22) multiplied by \(1-x-y-z\).
Remark 5
The partial differential equation (23) has also a monic solution, given by
which can be written as
in terms of shifted Jacobi polynomials.
Theorem 3
The following connection relation holds true:
where\(P_{n_{1},n_{2},n_{3}}^{(\alpha,\beta,\gamma,\delta,a,b) }(x,y,z) \)are defined in (11), \(e=\alpha+\beta+\gamma+\delta +a+b\), \(n=n_{1}+n_{2}+n_{3}\), and\(( \lambda ) _{n}\)denotes the Pochhammer symbol defined by\(( \lambda ) _{n}=\lambda ( \lambda+1 ) \cdots (\lambda +n-1 )\); \(n\in\mathbb{N}_{0}\), \(( \lambda ) _{0}=1\).
Proof
It follows from the connection relation between the univariate Jacobi polynomials that [2, 5]
□
Theorem 4
The following connection relation holds true:
where\(P_{n_{1},n_{2},n_{3}}^{(\alpha,\beta,\gamma,\delta,a,b) }(x,y,z) \)are defined in (11).
Proof
The result is a consequence of the connection relation between univariate Jacobi polynomials (see [7] and [4])
□
Theorem 5
For\(n\geq0\), the three term recurrence relation holds:
where\(n=n_{1}+n_{2}+n_{3}\)and\(e=\alpha+\beta+\gamma+\delta+a+b\).
Proof
It is enough to use the three term recurrence relation [10, p. 263, Eq. (1)] for the univariate Jacobi polynomials. □
4 Sparse recurrence relations for \(P_{n_{1},n_{2},n_{3}}^{ (\alpha,\beta,\gamma,\delta )}(x,y,z) \)
By combining the results given in the previous section, it is possible to derive sparse recurrence relations between Koornwinder polynomials in three variables with different parameters and their partial derivatives. We denote \(w=1-x-y-z\) in the following results.
Corollary 6
The partial derivatives of\(P_{n_{1},n_{2},n_{3}}^{ ( \alpha ,\beta,\gamma,\delta ) }(x,y,z) \)can be expressed in terms of Koornwinder polynomials in three variables with incremented parameters as follows:
and
Proof
The first relation comes from the equality
when \(a=b=0\). Equation (27) is obtained when \(a=b=0\) since
The relation given by \(\mathcal{O}_{1,0}\) in Theorem 1 for \(a=b=0\) gives (28). Finally, for the last relation, it is enough to combine the first and the third relations. □
The derivatives of weighted versions of \(P_{n_{1},n_{2},n_{3}}^{ (\alpha,\beta,\gamma,\delta ) }(x,y,z) \) verify the following sparse recurrence relations.
Corollary 7
The following relations hold true:
and
Proof
The first relation is a consequence of
The second one comes from the relation
The third relation holds from the relation
By taking into account the first and the third relations, we obtain the last relation. □
It is possible to write \(xP_{n_{1},n_{2},n_{3}}^{ ( \alpha,\beta ,\gamma,\delta ) }(x,y,z)\), \(yP_{n_{1},n_{2},n_{3}}^{ ( \alpha,\beta,\gamma,\delta ) }(x,y,z)\), \(zP_{n_{1},n_{2},n_{3}}^{ ( \alpha,\beta,\gamma,\delta ) } (x,y,z ) \), and \(wP_{n_{1},n_{2},n_{3}}^{ ( \alpha ,\beta,\gamma,\delta ) } (x,y,z ) \) in terms of Koornwinder polynomials with different parameters as follows.
Corollary 8
The following relations are satisfied:
and
Proof
The first relation follows from \(( \mathcal {N}_{3,0}^{+}+\mathcal{N}_{5,0} ) u= ( 2n+\alpha+\beta +\gamma+\delta+3 ) xu\). The second relation is satisfied by the equality
The third relation comes from
The last one is obtained from the relation
□
5 Generating functions for the polynomials with 2d-parameters on the d-dimensional simplex
Using the generating functions of the classical univarite Jacobi polynomials, we can derive the generating functions for the polynomials \(P_{\mathbf{n}}^{ ( \boldsymbol{\alpha} ) } ( \mathbf{x} ) \) defined by (13) on the d-dimensional simplex. For this purpose, we first recall the following generating functions for the classical univariate Jacobi polynomials ([11], p. 82 (1) (2), p. 165 Problem 9):
and
Theorem 9
The polynomials\(P_{\mathbf{n}}^{ ( \alpha_{1},\dots,\alpha _{d+1},\alpha_{d+2}-2n_{2}-1,\dots,\alpha_{2d}-2n_{d}-1 ) } ( \mathbf{x} ) \)have a generating function as follows:
for\(\vert t ( 1- \vert x_{j-1} \vert ) \vert <1\) (\(j=1,2,\dots,d\)) where
Proof
If we use the definition of polynomials \(P_{\mathbf{n}}^{ ( \boldsymbol{\alpha} ) } ( \mathbf{x} ) \) given by (13) by taking \(\alpha_{d+j+1}\rightarrow\alpha_{d+j+1}-2n_{j+1}-1\), \(1\leq j\leq d-1\), it follows from the generating function (38) that
for \(\vert t ( 1- \vert x_{j-1} \vert ) \vert <1\) (\(j=1,2,\dots,d\)) where
□
Corollary 10
In the case\(d=3\), the polynomials\(P_{n_{1},n_{2},n_{3}}^{ ( \alpha,\beta,\gamma,\delta,a-2n_{2}-1,b-2n_{3}-1 ) } ( x,y,z ) \)with six parameters have a generating function as follows:
for\(\vert t \vert <\min \{ 1,\frac{1}{1-x},\frac {1}{1-x-y} \}\)where
Theorem 11
The polynomials\(P_{\mathbf{n}}^{ ( \alpha_{1}-n_{1},\alpha _{2},\dots,\alpha_{d+1},\alpha_{d+2}-2n_{2}-1,\dots,\alpha _{2d}-2n_{d}-1 ) } ( \mathbf{x} ) \)are generated by
for\(\vert t ( 1- \vert x_{j-1} \vert ) \vert <1\) (\(j=2,3,\dots,d\)) and\(\vert t \vert <\min \{ 1,\frac {1}{x_{1}} \} \)where\(\vert \boldsymbol{\alpha} \vert = \alpha_{1}+\cdots+\alpha_{2d}\)and, \(a_{j}\)and\(\rho _{j}\)are defined as in (41).
Proof
By taking \(\alpha_{1}\rightarrow\alpha_{1}-n_{1} \); \(\alpha_{d+j+1}\rightarrow\alpha_{d+j+1}-2n_{j+1}-1\), \(1\leq j\leq d-1\) in the definition of the polynomials \(P_{\mathbf{n}}^{ ( \boldsymbol{\alpha} ) } ( \mathbf{x} ) \), given by (13), we can write
and from (38) and (39) it follows that
for \(\vert t ( 1- \vert x_{j-1} \vert ) \vert <1\) (\(j=2,3,\dots,d\)) and \(\vert t \vert <\min \{ 1,\frac {1}{x_{1}} \} \) where \(a_{j}\) and \(\rho_{j}\) are given by (41). □
Corollary 12
In the case\(d=3\), the polynomials\(P_{n_{1},n_{2},n_{3}}^{ ( \alpha-n_{1},\beta,\gamma,\delta,a-2n_{2}-1,b-2n_{3}-1 ) } ( x,y,z ) \)with six parameters are generated by
for\(\vert t \vert <\min \{ 1,\frac{1}{x},\frac{1}{1-x},\frac{1}{1-x-y} \} \)where\(\rho_{2}\)and\(\rho_{3}\)are as in (42).
Theorem 13
For the polynomials\(P_{\mathbf{n}}^{ ( \alpha_{1}-n_{1},\dots ,\alpha _{d}-n_{d},\alpha_{d+1},\alpha_{d+2}-n_{2}-1,\alpha _{d+3}-n_{3}-1,\dots,\alpha _{2d}-n_{d}-1 ) } ( \mathbf{x} ) \), a generating function is given by
for\(\vert t \vert <\min \{ \frac{1}{1- \vert x_{j-1} \vert },\frac{1}{x_{j}} \}\), \(j=1,2,\dots,d\).
Proof
If we get \(\alpha_{i}\rightarrow\alpha_{i}-n_{i}\), \(1\leq i\leq d\); \(\alpha_{d+j+1}\rightarrow\alpha_{d+j+1}-n_{j+1}-1\), \(1\leq j\leq d-1\) in the definition of \(P_{\mathbf{n}}^{ ( \boldsymbol{\alpha} ) } ( \mathbf{x} ) \), from (39) we obtain the desired generating function. □
Corollary 14
For the case\(d=3\), the polynomials\(P_{n_{1},n_{2},n_{3}}^{ ( \alpha-n_{1},\beta-n_{2},\gamma-n_{3},\delta ,a-n_{2}-1,b-n_{3}-1 ) } ( x,y,z ) \)with six parameters are generated by
for\(\vert t \vert <\min \{ 1,\frac{1}{1-x},\frac{1}{1-x-y},\frac{1}{x},\frac{1}{y},\frac{1}{z} \} \).
Theorem 15
The polynomials\(P_{\mathbf{n}}^{ ( \alpha_{1}-n_{1},\dots ,\alpha_{d}-n_{d},\alpha_{d+1}-n_{d},\alpha_{d+2}-n_{1}-1,\alpha_{d+3}-n_{2}-1,\dots,\alpha_{2d}-n_{d-1}-1 ) } ( \mathbf{x} ) \)are generated by
for\(\vert t \vert <\min \{ \frac{1}{x_{j}},\frac {1}{x_{j}+ \vert x_{j-1} \vert -1} \}\), \(j=1,2,\dots,d\).
Proof
It is enough to take \(\alpha_{i}\rightarrow\alpha_{i}-n_{i}\), \(1\leq i\leq d\); \(\alpha_{d+1}\rightarrow\alpha_{d+1}-n_{d}\); \(\alpha_{d+j+1}\rightarrow\alpha_{d+j+1}-n_{j}-1\), \(1\leq j\leq d-1\) in the definition of \(P_{\mathbf{n}}^{ ( \boldsymbol{\alpha} ) } ( \mathbf {x} ) \) and then use (40). □
Corollary 16
In the case\(d=3\), the polynomials\(P_{n_{1},n_{2},n_{3}}^{ ( \alpha-n_{1},\beta-n_{2},\gamma-n_{3},\delta -n_{3},a-n_{1}-1,b-n_{2}-1 ) } ( x,y,z ) \)with six parameters are generated by
for\(\vert t \vert <\min \{ \frac{1}{x},\frac {1}{y},\frac {1}{z},\frac{1}{x-1},\frac{1}{x+y-1},\frac{1}{x+y+z-1} \}\).
References
Area, I., Godoy, E., Ronveaux, A., Zarzo, A.: Bivariate second-order linear partial differential equations and orthogonal polynomial solutions. J. Math. Anal. Appl. 387(2), 1188–1208 (2012)
Askey, R.: Orthogonal Polynomials and Special Functions. CBMS Regional Conf. Ser. in Appl. Math., vol. 21. SIAM, Philadelphia (1975)
Dunkl, C.F., Xu, Y.: Orthogonal Polynomials of Several Variables. Cambridge University Press, New York (2001)
Ismail, M.E.H.: Classical and Quantum Orthogonal Polynomials in One Variable. Encylopedia Math. Appl., vol. 98. Cambridge University Press, Cambridge (2005)
Koepf, W., Schmersau, D.: Representations of orthogonal polynomials. J. Comput. Appl. Math. 90, 57–94 (1998)
Koornwinder, T.H.: Two variable analogues of the classical orthogonal polynomials. In: Askey, R.A. (ed.) Theory and Application of Special Functions. Proceedings of an Advanced Seminar, pp. 435–495. Academic Press, New York (1975)
Lewanowicz, S.: The hypergeometric functions approach to the connection problem for the classical orthogonal polynomials. Technical report, Inst. of Computer Sci., Univ. of Wroclaw (2003)
Luke, Y.L.: The Special Functions and Their Approximations, vol. II. Academic Press, New York (1969)
Olver, S., Townsend, A., Vasil, G.M.: Recurrence relations for a family of orthogonal polynomials on a triangle. In: Spectral and High Order Methods for Partial Differential Equations ICOSAHOM 2018. Lecture Notes in Computational Science and Engineering, vol. 134. Springer, Berlin (2020). arXiv:1801.09099
Rainville, E.D.: Special Functions. Macmillan, New York (1960)
Srivastava, H.M., Manocha, H.L.: A Treatise on Generating Functions. Halsted Press, Chichester, Wiley, New York (1984)
Suetin, P.K.: Orthogonal Polynomials in Two Variables. Gordon & Breach, Moscow (1988)
Szegö, G.: Orthogonal Polynomials. Amer. Math. Soc. Colloq. Publ., vol. 23, 4th edn. Am. Math. Soc., Providence (1975)
Zarzo, A.: Ecuaciones Diferenciales de Tipo Hipergeométrico Propiedades algebraicas y espectrales de sus soluciones. Aplicaciones Mecano-Cuánticas. Ph.D. thesis, Universidad de Granada (1995)
Acknowledgements
The authors are grateful to both reviewers for helpful suggestions that improved the manuscript.
Availability of data and materials
Not applicable (data sharing not applicable to this article as no data sets were generated or analyzed during the current study).
Funding
The research of R. Aktaş was done while she was visiting Universidade de Vigo, Spain, and the research has been supported by The Scientific and Technological Research Council of Turkey (TUBİTAK), Grant 1059B191802162. The work of the second author has been partially supported by the Agencia Estatal de Investigación (AEI) of Spain under Grant MTM2016-75140-P, and was cofinanced by the European Community fund FEDER.
Author information
Authors and Affiliations
Contributions
The authors contributed equally and significantly in writing this paper. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, 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 licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Aktaş, R., Area, I. & Güldoğan, E. A new family of orthogonal polynomials in three variables. J Inequal Appl 2020, 170 (2020). https://doi.org/10.1186/s13660-020-02434-5
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13660-020-02434-5