- Research
- Open Access
- Published:
New results on higher-order Daehee and Bernoulli numbers and polynomials
Advances in Difference Equations volume 2016, Article number: 32 (2016)
Abstract
We derive a new matrix representation for higher-order Daehee numbers and polynomials, higher-order λ-Daehee numbers and polynomials, and twisted λ-Daehee numbers and polynomials of order k. This helps us to obtain simple and short proofs of many previous results on higher-order Daehee numbers and polynomials. Moreover, we obtain recurrence relations, explicit formulas, and some new results for these numbers and polynomials. Furthermore, we investigate the relation between these numbers and polynomials and Stirling, Nörlund, and Bernoulli numbers of higher-order. Some numerical results and program are introduced using Mathcad for generating higher-order Daehee numbers and polynomials. The results of this article generalize the results derived very recently by El-Desouky and Mustafa (Appl. Math. Sci. 9(73):3593-3610, 2015).
1 Introduction
For \(\alpha\in\mathbb{N}\), the Bernoulli polynomials of order α are defined by (see [1–15])
When \(x=0\), \(B_{n}^{(\alpha) }=B_{n}^{(\alpha)} (0)\) are the Bernoulli numbers of order α defined by
The Daehee polynomials are defined by (see [11, 12] and [15])
In the special case \(x=0\), \(D_{n}=D_{n} (0)\) are called the Daehee numbers defined by
The Stirling numbers of the first and second kind are defined, respectively, by
where \(s_{1}(n,0)=\delta_{n,0}\), \(s_{1}(n,k)=0\), for \(k>n\), and
where \(s_{2}(n,0)=\delta_{n,0}\), \(s_{2}(n,k)=0\) for \(k>n\), and \(\delta _{n,k}\) is the Kronecker delta.
The Stirling numbers of the second kind have the generating function (see [2, 3, 5, 6] and [7])
2 Higher-order Daehee numbers and polynomials
In this section, we derive explicit formulas and recurrence relations for the higher-order Daehee numbers and polynomials of the first and second kinds. Also, we give a relation between these numbers and Nörlund numbers. Furthermore, we introduce the matrix representation of some results for higher-order Daehee numbers and polynomials obtained by Kim et al. [8] in terms of Stirling numbers, Nörlund numbers, and Bernoulli numbers of higher order and give simple and short proofs of these results.
Kim et al. [8] defined the Daehee numbers of the first kind of order k by the generating function
An explicit formula for \(D_{n}^{(k) }\) is given by the following theorem.
Theorem 1
For \(n\in\mathbb{Z}\), \(k \in\mathbb{N}\), we have
Proof
From Eq. (8) we have
Using the Cauchy rule for a product of series, we obtain
Letting \(r-k=n\) in the right-hand side, we have
Equating the coefficients of \(t^{n+k}\) on both sides yields (9). This completes the proof. □
Remark 1
It is worth noting that setting \(k=1\) in (9), we get Eq. (2.2) of [1] as a particular case.
Kim et al. ([8], Theorem 1) proved that (see [16]), for \(n \in\mathbb{Z}\) and \(k\in\mathbb{N}\),
We can represent the Daehee numbers of the first kind of order k by an \((n+1)\times(k+1)\) matrix, \(0\leq k \leq n\), as follows:
The following theorem gives a recurrence relation for Daehee numbers of the first kind of order k.
Theorem 2
For \(n\in\mathbb{Z}\) and \(k \in\mathbb{N}\), we have
where \(D_{0}^{(k)}=1\), \(D_{n}^{(0)}=0\) for \(n\geq1\), \(k=0,1,\ldots,n\).
Proof
The recurrence relation for the Stirling numbers of the first kind is given by
Replacing n by \(n+k\), we get
By using relation (10) we have
hence,
This completes the proof. □
A Mathcad program is written and executed to generate the higher-order Daehee numbers using the recurrence relation (11); see the Appendix.
For example, if \(0\leq n \leq3\) and \(0 \leq k \leq n\), then we have
Kim et al. ([8], Theorem 4) proved the following result: for \(n \in\mathbb{Z}\) and \(k\in\mathbb{N}\),
Remark 2
We can write this relation in the matrix form as follows:
where \({\mathbf{D}}^{(k) }\) is an \((n+1)\times(k+1)\) matrix (\(0\leq k\leq n\)) for the Daehee numbers of the first kind of order k, and \({\mathbf{S}}_{2}\) is an \((n+1)\times(n+1)\) lower triangular matrix for the Stirling numbers of the second kind, and \({\mathbf{B}}^{(k) }\) is an \((n+1)\times(k+1)\) matrix for the Bernoulli numbers of order k.
For example, setting \(0\leq n \leq3\) and \(0 \leq k \leq n\) in (13), we have
Kim et al. ([8], Theorem 3) introduced the following result: for \(n\in\mathbb{Z}\) and \(k\in\mathbb{N}\),
We can write this relation in the matrix form as follows:
where \({\mathbf{S}}_{1}\) is an \((n+1)\times(n+1)\) lower triangular matrix for the Stirling numbers of the first kind.
For example, setting \(0\leq n \leq3\) and \(0 \leq k \leq n\) in (15), we have
Remark 3
Using the matrix form (15), we easily derive a short proof of Theorem 4 in Kim et al. [8]. Multiplying both sides by the Stirling number of second kind, we get
where I is the identity matrix of order \((n+1)\).
Kim et al. [8] defined the Daehee polynomials of order k by the generating function as follows:
Liu and Srivastava [14] defined the Nörlund numbers of the second kind \(b_{n}^{(x) }\) as follows:
Next, we give a relation between the Daehee polynomials of order k and the Nörlund numbers of the second kind \(b_{n}^{(x)}\) in the following theorem.
Theorem 3
For \(m\in\mathbb{Z}\) and \(k\in\mathbb{N}\), we have
Proof
From Eq. (17) by multiplying both sides by \((1+t)^{z}\) we have
Replacing x by −k in (19), we have
From (16) and (20) we have (18). This completes the proof. □
Corollary 1
Setting \(k=1\) in (18), we have
Setting \(z=0\) in (18), we have the following relation between Daehee numbers of higher order and Nörlund numbers of the second kind.
Corollary 2
For \(k\in\mathbb{N}\), by setting \(z=0\) in (18) we obtain
The following relation between Bernoulli numbers and Bernoulli polynomials of order k is given by Kimura [13]:
Therefore, we can represent (23) in the matrix form
where \({\mathbf{B}}^{(k)} (x)\) is an \((n+1)\times(k+1)\) matrix (\(0\leq k \leq n\)) for Bernoulli polynomials of order k,
where the column k represents the Bernoulli polynomials of order k, \({\mathbf{B}}^{(k)}\) is an \((n+1)\times(k+1)\) matrix (\(0\leq k \leq n\)) for Bernoulli numbers of order k, and the matrix \({\mathbf{P}}(x)\), the Pascal matrix, is the \((n+1)\times(n+1)\) lower triangular matrix defined by
For example, setting \(0 \leq n \leq3\) and \(0 \leq k \leq n\) in (24), we have
Kim et al. ([8], Theorem 5) introduced the following result: for \(n\in\mathbb{Z}\) and \(k\in\mathbb{N}\),
We can write this relation in the matrix form as follows:
where \({\mathbf{D}}^{(k) } (x)\) is the \((n+1)\times(k+1)\) matrix for the Daehee polynomials of the first kind with order k, and \({\mathbf {B}}^{(k) } (x)\) is the \((n+1)\times(k+1)\) matrix for the Bernoulli polynomials of order k.
For example, setting \(0 \leq n \leq3\) and \(0 \leq k \leq n\) in (26), we have
Kim et al. ([8], Theorem 7) introduced the following result: for \(n\in\mathbb{Z}\) and \(k\in\mathbb{N}\),
We can write Eq. (27) in the matrix form as follows:
For example, setting \(0 \leq n \leq3\) and \(0 \leq k \leq n\) in (28), we have
Remark 4
We can prove Theorem 7 in Kim et al. [8] by using the matrix form (26) as follows. Multiplying both sides of (26) by the Stirling number of second kind, we have
Kim et al. [8] defined the Daehee numbers of the second kind of order k by the generating function as follows:
Kim et al. ([8], Theorem 8) introduced the following result: for \(n\in\mathbb{Z}\) and \(k \in\mathbb{N}\),
where \({n \brack l}=(-1)^{n-l} s_{1} (n,l)=|s_{1}(n,k)|=\mathfrak {s}(n,k)\), and \(\mathfrak{s}(n,k)\) are the signless Stirling numbers of the first kind; see [3] and [5, 6].
We can write this theorem in the matrix form as follows:
where \(\hat{{\mathbf{D}}}^{(k) }\) is the \((n+1)\times(k+1)\) matrix of Daehee numbers of the second kind of order k, and \({\boldsymbol{\mathfrak {S}}}\) is the \((n+1)\times(n+1)\) lower triangular matrix for the signless Stirling numbers of the first kind.
For example, setting \(0 \leq n \leq3\) and \(0 \leq k \leq n\) in (31), we have
Kim et al. ([8], Theorem 9) introduced the following result: for \(n\in\mathbb{Z}\) and \(k\in\mathbb{N}\),
We can write Eq. (32) in the matrix form as follows:
where \(\tilde{\mathbf{S}}_{2}\) is the \((n+1)\times(n+1)\) lower triangular matrix for signed Stirling numbers of the second kind defined by
For example, setting \(0\leq n \leq3\) and \(0 \leq k \leq n\) in (33), we have
Remark 5
We can prove Theorem 9 in Kim et al. [8] by using the matrix form (31) as follows. Multiplying both sides of (31) by the matrix of sign Stirling numbers of second kind \(\tilde{\mathbf{S}}_{2}\), we have
which gives Eq. (33), where we used the identity \(\tilde {\mathbf{S}}_{2} {\boldsymbol{\mathfrak{S}}}={\mathbf{I}}\).
Kim et al. [8] defined the Daehee polynomials of the second kind of order k by the generating function as follows:
Kim et al. ([8], Eq. (31)) introduced the following result: for \(n\in\mathbb{Z}\) and \(k\in\mathbb{N}\),
Equation (35) is equivalent to
We can write Eq. (36) in the matrix form as follows:
where \(\hat{{\mathbf{D}}}^{(k) } (x) \) is the \((n+1)\times(k+1)\) matrix of the Daehee polynomials of the second kind of order k, and \({\mathbf {B}}^{(k) } (x)\) is the \((n+1)\times(k+1)\) matrix of the Bernoulli polynomials.
For example, setting \(0 \leq n \leq3\) and \(0 \leq k \leq n\) in (37), we have
Kim et al. ([8], Theorem 11) introduced the following result: for \(n\in\mathbb{Z}\) and \(k\in\mathbb{N}\),
We can write Eq. (38) in the matrix form as follows:
For example, setting \(0\leq n \leq3\) and \(0 \leq k \leq n\) in (39), we have
Remark 6
We can prove Eq. (39) ([8], Theorem 11), directly by using the matrix form (37) as follows. Multiplying both sides of (37) by \(\tilde {\mathbf{S}}_{2}\), we get
and, thus, we have Eq. (39).
3 The λ-Daehee numbers and polynomials of higher order
In this section we introduce the matrix representation for the λ-Daehee numbers and polynomials of higher order given by Kim et al. [9]. Hence, we can derive these results in matrix representation and prove these results simply by using the given matrix forms.
The λ-Daehee polynomials of the first kind of order k can be defined by the generating function
When \(x=0\), \(D_{n,\lambda}^{(k)}=D_{n, \lambda}^{(k)} (0)\) are called the λ-Daehee numbers of order k:
It is easy to see that \(D_{n}^{(k) } (x) = D_{n,1}^{(k) } (x)\) and \(D_{n,\lambda} (x)=D_{n,\lambda}^{(1) } (x)\).
Kim et al. ([9], Theorem 3) obtained the following results: for \(n\geq0\) and \(k \in\mathbb{N}\),
and
We can write these results in the following matrix forms:
and
where, \({\mathbf{D}}_{\lambda}^{(k)} (x)\) is the \((n+1)\times(k+1)\) matrix for the λ-Daehee polynomials of the first kind of order k, \({\mathbf{B}}^{(k)} (x/\lambda)\) is the \((n+1)\times(k+1)\) matrix for the Bernoulli polynomials of order k with \(x\rightarrow x/\lambda \), and Λ is the \((n+1)\times(n+1)\) diagonal matrix with elements \((\boldsymbol{\Lambda})_{ii}=\lambda^{i}\), \(i=j=0,1,\ldots,n\).
For example, setting \(0 \leq n \leq3\) and \(0\leq k \leq n\) in (44), we have
where
Remark 7
In fact, we can prove Eq. (45) by simply by multiplying Eq. (44) by \({\mathbf{S}}_{2}\) as follows:
The following theorem gives a relation between the Daehee polynomials of higher order and λ-Daehee polynomials of higher order.
Theorem 4
For \(m \geq0\), we have
Proof
From (16), replacing \((1+t)\) by \((1+t)^{\lambda}\), we have
Thus, from (40) we get
Using the Cauchy rule for a product of series, we obtain
Equating the coefficients of \(t^{m}\) on both sides yields (46). This completes the proof. □
Setting \(x=0\) in (46), we have the following corollary as a particular case.
Corollary 3
For \(m \geq0\), we have
Kim et al. [9] defined the λ-Daehee polynomials of the second kind of order k as follows:
Kim et al. ([9], Theorem 5) proved that
and
Also, Kim et al. ([9], Eq. (35)) introduced the following result:
Remark 8
We can write (49) and (50), respectively, in the following matrix forms:
and
where \(\hat{\mathbf{D}}_{\lambda}(x)\) is the \((n+1)\times(n+1)\) matrix for the λ-Daehee polynomials of the second kind of order k, and \(\boldsymbol{\Lambda}_{1}\) is the \((n+1)\times(n+1)\) diagonal matrix with elements \((\boldsymbol{\Lambda}_{1} )_{ii}=(-\lambda)^{i}\) for \(i=j=0,1,\ldots,n\).
For example, setting \(0\leq n \leq3\) and \(0 \leq k \leq n\) in (52), we have
where
Remark 9
We can prove Eq. (50) easily by using the matrix form, multiplying Eq. (52) by \({\mathbf{S}}_{2}\) as follows:
4 The twisted λ-Daehee numbers and polynomials of higher order
Kim et al. [10] defined the twisted λ-Daehee polynomials of the first kind of order k by the generating function
In the special case \(x=0\), \(D_{n,\xi, \lambda}^{(k) } = D_{n,\xi}^{(k)} (0|\lambda)\) are called the twisted λ-Daehee numbers of the first kind of order k:
The twisted Bernoulli polynomials of order \(r\in\mathbb{N}\) are defined by the generating function (see [4])
The relation between the twisted λ-Daehee polynomials and λ-Daehee polynomials of order k is given in the following corollary.
Corollary 4
For \(n \geq0\) and \(k\in\mathbb{N}\), we have
Proof
Replacing t with ξt in (40), we have
Hence, by virtue of (54) and (58) we get (57). This completes the proof. □
If we put \(x=0\) and \(\lambda=1\) in (57), then we have, respectively,
Kim et al. ([10], Theorem 1) proved the following relation: for \(m\in\mathbb{Z} \) and \(k\in\mathbb{N}\),
and
where \(B_{m,\xi^{\lambda}}^{(k) } (\frac{x}{\lambda} )\) is defined by Kim et al. ([10], Eq. (15)) as follows:
Remark 10
We can write (59) in the matrix form
where \({\mathbf{D}}_{\xi}^{(k)} (x|\lambda)\) is the \((n+1)\times(k+1)\) matrix for the twisted Daehee numbers of the first kind of order k, and Ξ is the \((n+1)\times(n+1)\) diagonal matrix with elements \((\boldsymbol{\Xi})_{ii}=\xi^{i}\) for \(i=j=0,1,\ldots,n\).
For example, setting \(0\leq n \leq3\) and \(0\leq k \leq n\) in (62), we have
where
Remark 11
In fact, it seems that the statement in (60) is not correct (the second equation of Kim et al. [10], Theorem 1). From (62), multiplying both sides by \(\boldsymbol{\Xi}^{-1}\), we have
then multiplying both sides by \({\mathbf{S}}_{2}\), we have
From (60) and (63) it is clear that there is a contradiction.
In the following theorem we obtained a corrected relation.
Theorem 5
For \(m\in\mathbb{Z}\) and \(k\in\mathbb{N}\), we have
Proof
From Eq. (54), replacing t by \((e^{t}-1)/ \xi\), we have
Substituting (7) into (65), we have
Equating the coefficients of \(t^{m}\) on both sides gives (64). This completes the proof. □
Moreover, we can represent Eq. (64) in the following matrix form as in (63):
For example, setting \(0 \leq n \leq3\) and \(0 \leq k \leq n\) in (68), we have
where
Kim et al. [10] introduced the twisted λ-Daehee polynomials of the second kind of order k as follows:
Setting \(x=0\), \(\hat{D}_{n,\xi,\lambda}^{(k) }= \hat{D}_{n,\xi}^{(k)} (0|\lambda)\), we have the twisted Daehee numbers of second kind of order k:
Kim et al. ([10], Theorem 2) proved that, for \(m\in\mathbb{Z}\) and \(k\in\mathbb{N}\),
and
Using Eq. (51), we can write (71) in the matrix form
where \(\hat{\mathbf{D}}_{\xi}^{(k)} (x| \lambda)\) is the \((n+1)\times (k+1)\) matrix for the twisted Daehee numbers of the second kind of order k.
For example, setting \(0\leq n \leq3\) and \(0\le k \leq n\) in (73), we have
where
From (73), multiplying both sides by \(\boldsymbol{\Xi}^{-1}\), we have
and multiplying both sides by \({\mathbf{S}}_{2}\), we have
From (72) and (74) we have a contradiction.
Remark 12
In fact, it clear that (72) is not correct (the second equation of Kim et al. [10], Theorem 2).
We give the correction of (72) in the following theorem.
Theorem 6
For \(m\in\mathbb{Z}\) and \(k\in\mathbb{N}\), we have
Proof
From Eq. (69), replacing t by \((e^{t}-1)/\xi\), we have
Substituting Eq. (7) into Eq. (76), we have
From Eq. (1) and Eq. (77) we have
Equating the coefficients of \(t^{m}\) on both sides gives (75). This completes the proof. □
Moreover, by using Eq. (51) we can represent Eq. (75) in the following matrix form:
where \(\boldsymbol{\Lambda} \mathbf{B}^{(k) } (k+\frac{x}{\lambda} )= \boldsymbol{\Lambda}_{1} {\mathbf{B}}^{(k)} (-\frac{x}{\lambda} )\).
For example, setting \(0\leq n \leq3\) and \(0 \leq k \leq n\) in (79), we have
where
For more details and very recent results on these numbers, see [17].
5 Conclusions
We derived generalization of higher-order Daehee numbers and polynomials. Moreover, new matrix representations for these numbers and polynomials are obtained. This enabled us to obtain simple and short proofs of many previous results on higher-order Daehee numbers and polynomials. Furthermore, we investigated the relations between these numbers and polynomials and Stirling numbers, Nörlund numbers, and Bernoulli numbers of higher-order. Finally, some numerical results are given.
References
El-Desouky, BS, Mustafa, A: New results and matrix representation for Daehee and Bernoulli numbers and polynomials. Appl. Math. Sci. 9(73), 3593-3610 (2015). doi:10.12988/ams.2015.53282
Carlitz, L: A note on Bernoulli and Euler polynomials of the second kind. Scr. Math. 25, 323-330 (1961)
Comtet, L: Advanced Combinatorics. Reidel, Dordrecht (1974)
Dolgy, DV, Kim, T, Lee, B, Lee, SH: Some new identities on the twisted Bernoulli and Euler polynomials. J. Comput. Anal. Appl. 14(3), 441-451 (2013)
El-Desouky, BS: The multiparameter non-central Stirling numbers. Fibonacci Q. 32(3), 218-225 (1994)
El-Desouky, BS, Cakić, NP, Mansour, T: Modified approach to generalized Stirling numbers via differential operators. Appl. Math. Lett. 23, 115-120 (2010)
Gould, HW: Explicit formulas for Bernoulli numbers. Am. Math. Mon. 79, 44-51 (1972)
Kim, DS, Kim, T, Lee, SH, Seo, JJ: Higher-order Daehee numbers and polynomials. Int. J. Math. Anal. 8(6), 273-283 (2014). doi:10.12988/ijma.2014.4118
Kim, DS, Kim, T, Lee, SH, Seo, JJ: A note on the lambda Daehee polynomials. Int. J. Math. Anal. 7(62), 3069-3080 (2013). doi:10.12988/ijma.2013.311264
Kim, DS, Kim, T, Lee, SH, Seo, JJ: A note on twisted λ-Daehee polynomials. Appl. Math. Sci. 7(141), 7005-7014 (2013). doi:10.12988/ams.2013.311635
Kim, DS, Kim, T: Daehee numbers and polynomials. Appl. Math. Sci. 7(120), 5969-5976 (2013). doi:10.12988/ams.2013.39535
Kim, T, Simsek, Y: Analytic continuation of the multiple Daehee q-l-functions associated with Daehee numbers. Russ. J. Math. Phys. 15, 58-65 (2008)
Kimura, N: On universal higher order Bernoulli numbers and polynomials. Report of the research, Institute of Industrial Technology, Nihon University, Number 70 (2003). ISSN:0386-1678
Liu, GD, Srivastava, HM: Explicit formulas for the Nörlund polynomials \(B_{n}^{(x)}\) and \(b_{n}^{(x) }\). Comput. Math. Appl. 51, 1377-1384 (2006)
Ozden, H, Cangul, N, Simsek, Y: Remarks on q-Bernoulli numbers associated with Daehee numbers. Adv. Stud. Contemp. Math. (Kyungshang) 18, 41-48 (2009)
Wang, W: Generalized higher order Bernoulli number pairs and generalized Stirling number pairs. J. Math. Anal. Appl. 364, 255-274 (2010)
Araci, S, Agyuz, E, Acikgoz, M: On a q-analog of some numbers and polynomials. J. Inequal. Appl. 2015, 19 (2015). doi:10.1186/s13660-014-0542-y
Acknowledgements
The authors would like to thank the referees for their valuable comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
The authors, BSE-D and AM with the consultation of each other carried out this work and drafted the manuscript together. Both authors read and approved the final manuscript.
Appendix
Appendix
Mathcad program for higher-order Daehee numbers using the recurrence relation (11):
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided 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.
About this article
Cite this article
El-Desouky, B.S., Mustafa, A. New results on higher-order Daehee and Bernoulli numbers and polynomials. Adv Differ Equ 2016, 32 (2016). https://doi.org/10.1186/s13662-016-0764-z
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13662-016-0764-z
MSC
- 05A19
- 11C20
- 11B73
- 11T06
Keywords
- Daehee numbers
- Daehee polynomials
- higher-order Daehee numbers
- higher-order Daehee polynomials
- higher-order Bernoulli polynomials
- matrix representation