Abstract
Some examples of Appell–Dunkl sequences are shown using determined operators. Specifically, Appell–Dunkl sequences whose generating functions are of the form \(E_{\alpha }(xt)/(1\pm t^m)\), where the function \(E_{\alpha }(xt)\) is given in terms of Bessel functions. Particular cases of these examples are also generated by means of the inverse of the Dunkl operator.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
An Appell sequence \(\{P_n(x)\}_{n=0}^{\infty }\) is a sequence of polynomials such that
It is well known that Appell sequences may be also defined by means of a generating function
where A(t) is a function analytic at \(t=0\) with \(A(0)\ne 0\). Typical examples of Appell polynomials are: \(\{x^n\}_{n=0}^{\infty }\) with \(A(t)=1\); Hermite polynomials (see [1]), \(\{{\text {He}}_n(x)\}_{n=0}^{\infty }\), with \(A(t)=e^{-t^2/2}\); Bernoulli polynomials (see [7, 11]), \(\{B_n(x)\}_{n=0}^{\infty }\), with \(A(t)=t/(e^t-1)\); or Euler polynomials (see [7, 11]), \(\{E_n(x)\}_{n=0}^{\infty }\), with \(A(t)=2/(e^t+1)\). These polynomials have been widely studied in the last two centuries because they have many applications to number theory, numerical analysis, combinatorics and other areas.
In [12], they use an operator of the type
where \({\widehat{D}}=d/dx\) and \(\{c_k\}^{\infty }_{k=0}\) is a sequence of constants in order to obtain several examples of Appell polynomials. In particular, they get Appell sequences whose generating functions are \(e^{xt}/(1\pm t^m)\). The cases \(m=1\) or \(m=2\) are also studied by means of some integrals.
If in (1.1) the derivative operator is changed by the Dunkl operator \(\Lambda _{\alpha }\) defined by
where \(\alpha > -1\) is a fixed parameter (see [9, 17]), we obtain the Appell–Dunkl polynomials, \(\{P_{n,\alpha }(x)\}_{n=0}^{\infty }\), that satisfy
where the multiplicative constant \(\theta _{n,\alpha }\) (that will be defined later) in the place of n is used for convenience with the notation. Of course, in the case \(\alpha =-1/2\), the operator \(\Lambda _{\alpha }\) is the ordinary derivative and Appell–Dunkl sequences become the classical Appell sequences. Appell–Dunkl sequences can be also defined by means of a generating function
with A(t) an analytic function at \(t=0\), \(A(0)\ne 0\), and where \(E_{\alpha }(xt)\) is an analytic function defined in terms of Bessel functions that plays the role of the exponential in the classical case (1.2), and the coefficients \(\gamma _{n,\alpha }\) will be defined in the next section as a kind of factorial numbers. The generalizations of Bernoulli and Euler polynomials to the Dunkl context have been studied in [5, 6, 10, 15], and the extension of Hermite polynomials can be found in [17]. Appell–Dunkl sequences have been also considered, for instance, in [2, 3, 8].
There are not many explicit examples of Appell–Dunkl polynomials in the literature, except for those mentioned above. So, the main goal of this paper is to generate some examples of this kind of sequences using an operator analogous to (1.3) in the Dunkl context.
Using the inverse of the Dunkl operator, we are going to generate some examples of Appell–Dunkl sequences in a different way, in particular, one family where the polynomials of degree even and odd can be defined by means of determined generating functions in terms of Bessel functions. The even case provides us an example of the polynomials developed in [4]. A general study about the quadratic decomposition of Appell sequences has been studied in [14].
The structure of this paper is as follows. In Sect. 2, we see the required definitions and results of the Dunkl universe. Then, in Sect. 3 we give some families of Appell–Dunkl polynomials using the corresponding operators. Finally, in Sect. 4 some families of Appell–Dunkl polynomials, obtained also in Sect. 3, are established with the help of Dunkl primitives.
2 Dunkl definitions
For \(\alpha > -1\), let \(J_\alpha \) denote the Bessel function of order \(\alpha \), and for complex values of the variable z, let
(the function \({\mathcal {I}}_\alpha \) is a small variation of the so-called modified Bessel function of the first kind and order \(\alpha \), usually denoted by \(I_\alpha \); see [13, 16], or [18]). Let \({\mathcal {G}}_{\alpha }\) denote the function
With these two functions, the following analytic function is defined
For any \(\lambda \in {\mathbb {C}}\), we have
and
Let us note that, when \(\alpha = -1/2\), we have \(\Lambda _{-1/2} = d/dx\), \(E_{-1/2}(\lambda x) = e^{\lambda x}\), \({\mathcal {I}}_{\alpha }(z)=\cosh z\) and \({\mathcal {G}}_{\alpha }(z)=\sinh (z)\).
From the definition of \(E_{\alpha }(z)\), it is easy to check that
with
and where \((a)_n\) denotes the Pochhammer symbol
(with a a nonnegative integer); of course, \(\gamma _{n,-1/2} = n!\). From (2.4), we have
It also holds that
We also define
that becomes the ordinary binomial numbers in the case \(\alpha =-1/2\). To simplify the notation, we sometimes write \(\gamma _n=\gamma _{n,\alpha }\) and \(\theta _n=\theta _{n,\alpha }\).
Then, a sequence of Appell–Dunkl polynomials, \(\{P_{n,\alpha }(x)\}_{n=0}^{\infty }\), may be defined as a sequence that satisfies (1.5) where \(\theta _{n,\alpha }\) is given by (2.5), or as a sequence whose generating function is (1.6).
The inverse of the derivative operator, d/dx, leads to the concept of primitive of a function. It is well known that this primitive is unique except by an additive constant. In the Dunkl case, we could propose that a function F is a Dunkl primitive of f if \(\Lambda _{\alpha }F = f\). It would require that this function, F, was unique except by an additive constant. This may be reduced to prove that \(\Lambda _{\alpha }F=0\), \(F\in {\mathcal {C}}^{1}({\mathbb {R}})\), if and only if F is a constant. If the function F is even, as \(\Lambda _{\alpha }F=\frac{d}{dx} F\), then \(\Lambda _{\alpha }F=0\) implies that F is a constant. If F is an odd function and \(\Lambda _{\alpha }F=0\), then F should be of the form \(Cx^{-2\alpha -1}\) and would not be in \({\mathcal {C}}^1({\mathbb {R}})\) for \(\alpha >-1\). So, F has to be a constant. As every function, F, can be expressed uniquely in the way \(F_1+F_2\) where \(F_1\) is an even function and \(F_2\) is an odd function, and the operator \(\Lambda _{\alpha }\) transforms an even function in an odd function, and vice versa, we can define, for \(\alpha >-1\), the Dunkl integral of a function f as
where \(c \in {\mathbb {R}}\) is a constant.
As \(\Lambda _{\alpha }((\cdot )^{n+1})(x) = \theta _{n+1} x^n\), we have
and then, for a polynomial \(p(x) = \sum _{k=0}^{n} a_k x^k\), its Dunkl primitive is
Let us also note that, by (1.5), the Dunkl primitive of the Appell–Dunkl polynomial \(P_{n,\alpha }(x)\) is \(P_{n+1,\alpha }(x)/\theta _{n+1} + c\).
It is also interesting to note that, from (2.1) with \(\lambda =1\), we can write
and from (2.2)
An analogous to the formula of integration by parts in this context is proved.
Lemma 2.1
Let f and g be two functions in \(C^1({\mathbb {R}})\). Then
where
Proof
Let
and
so
Then, applying the Dunkl integral operator
and the proof is concluded. \(\square \)
3 Appell–Dunkl polynomials
In this section, some sequences of Appell–Dunkl polynomials are generated with the help of determined operators which are defined as follows.
Let \(\{c_k\}_{k=0}^{\infty }\) be a sequence of numbers with \(c_0\ne 0\) and \({\mathcal {A}}(\Lambda _{\alpha })\) the operator
This operator can be applied to \({\mathcal {C}}^{\infty }\) functions and assuming also that the series obtained is convergent. In particular, this is always true for polynomials because the operator \(\Lambda _{\alpha }\) applied to a polynomial of degree n generates a polynomial of degree \(n-1\), so the operator (3.1) applied to polynomials has only a finite quantity on not null summands.
Now, it may be stated the main result of this paper.
Theorem 3.1
Let \(\{c_k\}_{k=0}^{\infty }\) be a sequence of numbers with \(c_0\ne 0\) and let \({\mathcal {A}}(\Lambda _{\alpha })\) be the operator (3.1). Then the sequence of polynomials \(\{P_{n,\alpha }(x)\}_{n=0}^{\infty }\) given by
is an Appell–Dunkl sequence of polynomials. Moreover, the generating function of these polynomials is \(A(t)E_{\alpha }(xt)\) where the analytic function A(t) is given by
Proof
We will see that the sequence \(\{P_{n,\alpha }(x)\}_{n=0}^{\infty }\) satisfies the requirements of Definition 1.5.
and for \(n\ge 1\),
So, they are Appell–Dunkl polynomials.
Taking into account (2.3) and (3.2), the generating function, \(G_{\alpha }(x,t)\), of these polynomials can be obtained in the following way
\(\square \)
Remark 1
By the definition of \(\Lambda _{\alpha }\), (1.4), it is easy to see that
So, the Appell–Dunkl polynomials can be written as
3.1 Generating function \(E_{\alpha }(xt)/(1-t)\)
Let \(e_{n,\alpha }(x)\) be the nth truncated polynomials of \(E_{\alpha }(x)\), that is,
We denote
Then it may be proved the following result.
Theorem 3.2
The sequence \(\{P_{n,\alpha }^{(1-)}(x)\}_{n=0}^{\infty }\) is an Appell–Dunkl sequence of polynomials whose generating function is
Moreover, these polynomials satisfy the recurrence relation
Proof
We must simply apply Theorem 3.1 to the sequence of numbers \(c_k=\gamma _k\), \(k=0,\,1,\,2,\ldots \) Then substituting \(c_k\) in (3.4), we have
From (3.3), the generating function, \(G_{\alpha }^{(1-)}(x,t)\), for \(\{P_{n,\alpha }^{(1-)}(x)\}_{n=0}^{\infty }\) is given by
Using (3.2) with \(c_k=\gamma _k\), we obtain
In order to obtain the recurrence relation, note that
So, from the definition of \({\mathcal {A}}(\Lambda _{\alpha })\) with \(c_k=\gamma _k\)
Applying the Dunkl operator to \(P_{n,\alpha }^{(1-)}(x)\), (3.7) is obtained. \(\square \)
3.2 Generating function \(E_{\alpha }(xt)/(1+t)\)
We denote by \(P_{n,\alpha }^{(1+)}\) the following polynomial
Theorem 3.3
The sequence \(\{P_{n,\alpha }^{(1+)}(x)\}_{n=0}^{\infty }\) is an Appell–Dunkl sequence of polynomials whose generating function is
Moreover, these polynomials satisfy the recurrence relation
Proof
We apply Theorem 3.1 to the sequence of numbers \(c_k=(-1)^k\gamma _k\), \(k=0,\, 1,\ldots \). Then, substituting \(c_k\) in (3.4) we have
where \(e_{n,\alpha }(x)\) is the nth truncated of \(E_{\alpha }(x)\) defined in (3.5).
From (3.3), the generating function, \(G_{\alpha }^{(1+)}(x,t)\), for \(\{P_{n,\alpha }^{(1+)}(x)\}_{n=0}^{\infty }\) is given by
Using (3.2) with \(c_k=(-1)^k\gamma _k\), we obtain
In order to obtain the recurrence relation, note that
and from the definition of \({\mathcal {A}}(\Lambda _{\alpha })\) with \(c_k=(-1)^k\gamma _k\),
Applying the Dunkl operator to \(P_{n,\alpha }^{(1+)}(x)\), (3.9) is proved. \(\square \)
3.3 Generating function \(E_{\alpha }(xt)/(1-t^m)\)
We take the sequence \(\{c_l\}_{l=0}^{\infty }\) as
where \(m\in {\mathbb {N}}\) is a fixed number. We denote by \(P_{n,\alpha }^{(m-)}(x)\) the following polynomial
where [n/m] denotes the greatest integer less than or equal to n/m.
Then, we may prove the next result.
Theorem 3.4
The sequence \(\{P_{n,\alpha }^{(m-)}(x)\}_{n=0}^{\infty }\) is an Appell–Dunkl sequence of polynomials whose generating function is
Moreover, these polynomials satisfy the recurrence relation
Proof
When we apply Theorem 3.1 with the sequence (3.10), the sequence of Appell–Dunkl polynomials that appear is \(P_{n,\alpha }^{(m-)}(x)\).
From (3.3), the generating function for \(\{P_{n,\alpha }^{(m-)}(x)\}_{n=0}^{\infty }\) is given by
Thus, from (3.2) with \(c_l\) as in (3.10) we deduce that
In order to obtain the recurrence relation, note that
and from the definition of \({\mathcal {A}}(\Lambda _{\alpha })\) with \(c_l\) as in (3.10),
Applying m times the Dunkl operator to \(P_{n,\alpha }^{(m-)}(x)\), (3.11) is proved. \(\square \)
3.4 Generating function \(E_{\alpha }(xt)/(1+t^m)\)
Analogously, for each \(m\in {\mathbb {N}}\), taking \(\{c_l\}_{l=0}^{\infty }\) as
we denote
where [n/m] is the greatest integer less than or equal to n/m.
Then, we may prove the next result.
Theorem 3.5
The sequence \(\{P_{n,\alpha }^{(m+)}(x)\}_{n=0}^{\infty }\) is an Appell–Dunkl sequence of polynomials whose generating function is
Moreover, these polynomials satisfy the recurrence relation
Proof
The proof is analogous to Theorem 3.4. \(\square \)
4 Appell–Dunkl polynomials arising from certain Dunkl primitives
In this section, we are going to use the inverse operator of \(\Lambda _{\alpha }\), introduced in Section 2, to obtain in a different way the Appell–Dunkl sequences of polynomials \(\{P_{n,\alpha }^{(1\pm )}(x)\}_{n=0}^{\infty }\) and \(\{P_{n,\alpha }^{(2-)}(x)\}_{n=0}^{\infty }\).
In the classical case (see[12]), an integral of the form
always results a polynomial of degree n times the corresponding exponential function \(e^{\pm x}\). This is due to the formula of integration by parts. In the Dunkl case, it does not happen because in the analogous formula, (2.9) appears an extra term with the function h(x). However, if in (2.9) one of the functions f(x) or g(x) is an even function, the function h(x) is the null function.
4.1 Appell–Dunkl polynomials from \(\oint x^nE_{\alpha }(\pm x)\,d_{\alpha }x\)
The goal of this subsection is to obtain the sequences of polynomials \(\{P_{n,\alpha }^{(1\pm )}(x)\}_{n=0}^{\infty }\) using Dunkl integrals of the form
Theorem 4.1
Let \(\{P_{n,\alpha }^{(1-)}(x)\}_{n=0}^{\infty }\) and \(\{P_{n,\alpha }^{(1+)}(x)\}_{n=0}^{\infty }\) be the sequences of polynomials defined in (3.6) and (3.8), respectively. Then,
and
where \(C_{n,\alpha }(x)\) and \(D_{n,\alpha }(x)\) are auxiliary functions and c is a constant, not necessarily the same at each appearance.
Proof
We start taking the function \(E_{\alpha }(-x)\) in the integral (4.1). As we can see in the introduction of this section, it is very important to know whether the functions that appear in the integral are even or odd. So, we are going to distinguish whether \(n=2k\) or \(n=2k+1\). We begin supposing that \(n=2k\) and applying (2.9) taking into account (2.7), we obtain
because in this case \(h(x)=0\). If we apply again (2.9), we have that
and then,
Iterating this process 2k times, we can write
That is
where
If we suppose now that \(n=2k+1\) and apply (2.9) taking into account (2.7) and that \( h(x)=4x^{2k}{\mathcal {G}}_{\alpha }(x)\), we have
Applying (4.4), we obtain
Note that
Then (4.5) can be rewritten as
Therefore, (4.2) is obtained with
Analogously, if we consider (4.1) with \(E_{\alpha }(x)\), applying (2.9) n times, (4.3) is obtained where \(D_{n,\alpha }(x)\) will be a function similar to \(C_{n,\alpha }(x)\). \(\square \)
4.2 Appell–Dunkl polynomials from other Dunkl integrals
In this subsection, the sequence of polynomials \(\{P_{n,\alpha }^{(2-)}(x)\}_{n=0}^{\infty }\) is obtained by means of Dunkl integrals.
We define the following sequences of polynomials
and
Theorem 4.2
Let \(\{Q_{2k,\alpha }(x)\}_{k=0}^{\infty }\) and \(\{R_{2k+1,\alpha }(x)\}_{k=0}^{\infty }\) be the sequences of polynomials defined in (4.6). Then, it holds that
and
where c is a constant, not necessarily the same at each appearance.
Proof
We start studying the Dunkl integral
Note that \({\mathcal {I}}_{\alpha }(x)\) and \(x^{2k}\) are both even functions. This fact makes that when we apply the formula of integration by parts, (2.9), several times to the integral (4.10), the function h(x) is always the null function. Applying (2.9) twice and taking into account (2.8), we obtain
Iterating this method 2k times, we obtain (4.8).
Now, we take the following integral
In this case, both functions, \(x^{2k+1}\) and \({\mathcal {G}}_{\alpha }(x)\), are odd functions. So, the function h(x) when we apply (2.9) is again the null function. Applying (2.9) \(2k+1\) times, it holds (4.9). \(\square \)
Theorem 4.3
Let \(\{S_{n,\alpha }(x)\}_{n=0}^{\infty }\) be the sequence of polynomials defined in (4.7). Then, \(S_{n,\alpha }(x)=P_{n,\alpha }^{(2-)}(x)\). That is, \(\{S_{n,\alpha }(x)\}_{n=0}^{\infty }\) is an Appell–Dunkl sequence of polynomials whose generating function is
Proof
Note that by the definition of the polynomials, (4.6),
So, the sequence \(\{S_{n,\alpha }(x)\}_{n=0}^{\infty }\) is an Appell–Dunkl sequence of polynomials.
Finally, we have to obtain the generating function. If we apply twice the Dunkl operator to the polynomials \(Q_{2k,\alpha }(x)\) and \(R_{2k+1,\alpha }(x)\), from (4.12) we find
Now, we denote by \({\mathcal {A}}_2(\Lambda _{\alpha })\) the operator
If we apply this operator to \(x^{2k}\) instead of \(x^n\), we obtain that
From (2.2),
Then, following the same technique than in Theorem 3.1 to obtain the generating function
That is,
Analogously, applying the operator \({\mathcal {A}}_2(\Lambda _{\alpha })\) to \(x^{2k+1}\)
Then, we can take the following generating function
That is,
By joining (4.14) and (4.15), we obtain (4.11). \(\square \)
References
Abramowitz, M., Stegun, I.A.: Handbook of mathematical functions with formulas, graphs, and mathematical tables. National Bureau of Standards Applied Mathematics Series. Vol. 55. (1964)
Ben Cheikh, Y., Gaied, M.: Dunkl-Appell \(d\)-orthogonal polynomials. Integral Transf Spec. Funct. 18, 581–597 (2007)
Bouanani, A., Khériji, L., Ihsen Tounsi, M.: Characterization of \(q\)-Dunkl Appell symmetric orthogonal \(q\)-polynomials. Expo. Math. 28, 325–336 (2010)
Cholewinski, F.M.: The finite calculus associated with Bessel functions, Contemporary Mathematics, 75. American Mathematical Society, Providence, RI (1988)
Ciaurri, Ó., Durán, A., Pérez, M., Varona, J.L.: Bernoulli-Dunkl and Apostol-Euler-Dunkl polynomials with applications to series involving zeros of Bessel functions. J. Approx. Theory 235, 20–45 (2018)
Ciaurri, Ó., Mínguez Ceniceros, J., Varona, J.L.: Bernoulli-Dunkl and Euler-Dunkl polynomials and their generalizations. Rev. R. Acad. Cienc. Exactas Fís Nat. Ser. A Mat. RACSAM 113, 2853–2876 (2019)
Dilcher, K.: Bernoulli and Euler Polynomials, NIST handbook of mathematical functions (edited by F. W. F. Olver, D. W. Lozier, R. F. Boisvert and C. W. Clark), 587–599, National Institute of Standards and Technology, Washington, DC, and Cambridge University Press, Cambridge, 2010. Available online in http://dlmf.nist.gov/24
Dimovski, I.H., Hristov, V.Z.: Nonlocal operational calculi for Dunkl operators, SIGMA Symmetry Integrability Geom. Methods Appl. 5 (2009), Paper 030, 16 pp
Dunkl, C.F.: Differential-difference operators associated to reflection groups. Trans. Amer. Math. Soc. 311, 167–183 (1989)
Durán, A., Pérez, M., Varona, J.L.: Fourier-Dunkl system of the second kind and Euler-Dunkl polynomials. J. Approx. Theory 245, 23–39 (2019)
Graham, R., Knuth, D., Patashnik, O.: Concrete mathematics: a foundation for computer science, Second edition, Addison-Wesley, (1994)
Khan, S.A., Jagannathan, R.: On certain Appell polynomials and their generalizations based on the Tsallis \(q\)-exponential. Bull. Malays. Math. Sci. Soc. 45, 1453–1472 (2022)
Lebedev, N.N.: Special Functions and their Applications. Dover, New York (1972)
Loureiro, A.F., Maroni, P.: Quadratic decomposition of Appell sequences. Expo. Math. 26(2), 177–186 (2008)
Mínguez Ceniceros, J., Varona, J.L.: Asymptotic behavior of Bernoulli-Dunkl and Euler-Dunkl polynomials and their zeros. Funct. Approx. Comment. Math. 65, 211–226 (2021)
Olver, F.W.J., Maximon, L.C.: Bessel Functions, NIST handbook of mathematical functions (edited by F. W. F. Olver, D. W. Lozier, R. F. Boisvert and C. W. Clark), 215–286, National Institute of Standards and Technology, Washington, DC, and Cambridge University Press, Cambridge, 2010. Available online in http://dlmf.nist.gov/10
Rosenblum, M.: Generalized Hermite polynomials and the Bose-like oscillator calculus. Oper. Theory Adv. Appl. 73, 369–396 (1994)
Watson, G.N.: A Treatise on the Theory of Bessel Functions, 2nd edn. Cambridge Univ. Press, Cambridge (1944)
Funding
Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
We have no conflicts of interest to disclose.
Consent for publication
We confirm that this work is original and has not been published elsewhere, nor it is currently under consideration for publication elsewhere.
Additional information
Communicated by Emrah Kilic.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supported by PID2021-124332NB-C22 (Ministerio de Ciencia e Innovación).
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
Mínguez Ceniceros, J. Some Appell–Dunkl Sequences. Bull. Malays. Math. Sci. Soc. 46, 64 (2023). https://doi.org/10.1007/s40840-022-01455-1
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40840-022-01455-1