1. Introduction
Bernoulli numbers
are defined by
A generalization of Bernoulli numbers are Bernoulli polynomials
, defined by
These numbers (polynomials) are fascinating objects, appearing in many mathematical branches such as number theory, combinatorics and analysis. The basic properties of Bernoulli numbers and polynomials are discussed in [
1,
2].
Closely related to Bernoulli polynomials are the Euler and Genocchi polynomials. These polynomials are defined for
by
Finding recurrences and convolutions for these polynomials is still an active field of research. Many interesting identities for Bernoulli, Euler and Genocchi polynomials can be found in the articles [
3,
4,
5,
6,
7,
8,
9,
10] for instance. See [
11,
12,
13,
14] for some properties of generalizations of these polynomials.
The popularity and importance of Bernoulli numbers and polynomials in number theory comes also from their connection to the Riemann zeta function
where
is the Riemann zeta function [
15]. A great deal of proof for this relation has been provided over the years. See [
16] for references. Recently, Merca [
16] proved the following relation between Bernoulli numbers:
This relation can be used to derive a recurrence relation for
. Moreover, in his next article on the topic, Merca [
17] used recurrence relations for Bernoulli polynomials
to derive two new infinite families of linear recurrence relations for the Riemann zeta function at positive even integer arguments. Merca’s elegant results are based on the following relations (Theorems 2.1 and 3.1 in [
17]): Let
n be a positive integer and
. Then
and
In fact, identities Equations (
1) and (
2) have been widely known and used already in the 19th century as immediate consequences of the simple functional relations
It may be very difficult to identify the first pioneers who discovered them after all this time. We refer to the notable books by Saalschütz [
18], Nielsen [
19] and Hansen [
20] as a resource in which a large number of classical identities, mainly developed in the 18th and the 19th centuries, can be found. In addition, Equation (
1) can be extended to [
21]
valid for all integers
. Thus, Equation (
1) is the special case for
. Next, we can define the function
by
Then, the following identity has been known for a long time:
The identity Equation (
4) reduces to Equation (
2) when
and
. It is easy to see that
satisfies the following functional equation.
Proposition 1. For all the following functional equation holds: In addition, we can examine a calculation of the sum
. We have
In view of such an identity, we recognize that Equation (
3) is an obvious consequence of Equation (
2). Finally, we remark that if
is odd, then
, i.e., the function
is an odd or asymmetric function with respect to
y.
We conclude this section by recalling the definition of
, which comes from [
22].
Definition 1. For integers the generalized Bernoulli polynomials of order are defined by the generating function The numbers are called generalized Bernoulli numbers of order r and m.
The polynomials belong to the family of Appell polynomials. We mention that they are defined for , i.e., for . From the definition, it is obvious that and are the generalized Bernoulli polynomials of order m. Moreover, are the Bernoulli numbers.
The goal of the present article is to derive several convolutions for generalized Bernoulli polynomials of order
,
. First, we will generalize Merca’s results for Bernoulli polynomials to the more general class of polynomials. This will be performed in
Section 2. In
Section 3, we will prove the analogue identities for generalized Euler–Genocchi polynomials
. A range of additional convolutions for
and
will be given in
Section 4. Among other things, we will rediscover identity Equation (
1) as a special case of our findings. In
Section 5 and
Section 6 we will state some additional remarks concerning applications and future work.
2. Notes on Merca’s Identities
Our first result is an extension of Theorem 2.1 of [
17].
Theorem 1. Let r and m be positive integers and . Then, Especially, with , we have Proof. For
we have from Equation (
6)
On the other hand, using Cauchy’s rule, it is obvious that
Comparing the coefficients for in the two power series proves the formula. □
For Theorem 1 reduces to Merca’s Theorem 2.1. For our theorem gives a convolutional relation for generalized Bernoulli polynomials:
Corollary 1. For the following relation holds for generalized Bernoulli polynomials: Corollary 2. For the following relation holds: Especially for the generalized Bernoulli polynomials we have the identity Proof. Set in Theorem 1. □
Next, for
, we define the function
Then, we note the following functional equation:
Proposition 2. For all the following functional equation holds: Proof. Replacing
y with
in Equation (
12), using Equation (
7), we get the result. □
We can also calculate
and
These calculations confirm the following facts.
- (i)
If is odd, then , i.e., the function is an odd or asymmetric function with respect to y.
- (ii)
If is even, then , i.e., the function is an even or symmetric function with respect to y.
The above observations lead to the next corollary, which provides an extension of Theorem 3.1 of [
17] to the class
.
Corollary 3. Let r and m be positive integers and . Then,and We conclude this section with the following results.
Corollary 4. Let r and m be positive integers and . Then,and Proof. Replace y by with in Corollary 3 and simplify. □
Corollary 5. Let r and m be positive integers and . Then,and Proof. Set in Corollary 3 and simplify. □
3. Analogue Relations for Generalized Euler–Genocchi Polynomials
The definition of generalized Euler–Genocchi polynomials of order
also comes from the paper [
22], where many basic properties of the polynomials are discussed.
Definition 2. Let r and m be integers with and . The generalized Euler–Genocchi polynomials of order , , , are defined by the generating functionwith for . The numbers are called the generalized Euler–Genocchi numbers of order r and m. We see that
and
are the generalized Euler and Genocchi polynomials, respectively, where
and
Finally, we mention that the degenerated case gives for all .
The first analogue result of Merca’s identities is stated in the next theorem.
Theorem 2. Let r and m be integers with and , and . Then, Especially, with , we have Proof. Due to the high degree of similarity in the proofs, we only sketch the proofs. The identity basically follows from
□
Corollary 6. For the following relations hold:and Proof. Set and in Theorem 2. □
Corollary 7. For the following relation holds: Proof. Set in Theorem 2. □
Theorem 3. Let r and m be integers with and , and . Then,and Proof. The proof follows the same arguments as the proof of Theorem 3. □
The special cases where y is replaced by and are obvious. We continue skipping the presentation of these explicit results.
4. More Convolutions for and
In this section, several other convolutions for and are derived. The first two theorems contain convolutions involving and powers of 2.
Theorem 4. Let r and m be positive integers and . Thenwhere is the generalized Euler polynomial of order m. Proof. For
we have from Equation (
6)
On the other hand, we observe that
Comparing the coefficients for in the two power series proves the formula. □
Remark 1. From the above proof, it is clear that we can also write Corollary 8. Let r and m be positive integers and . Then,and Proof. Set
and
in (
30), respectively. □
Evidently, the sums in the Corollary contain some interesting special cases. The evaluations with
, and
and
, respectively, yield the following identities for Bernoulli numbers:
and
where we have employed the following relations
and
It is difficult to say whether the Bernoulli identities Equations (
34)–(
37) are original. We could not find them in the book [
20]. Hence, they are maybe not classical. However, they may have appeared elsewhere before. Furthermore, setting
,
and
in Equation (
30) gives
where we have used Equation (
31). Hence, we rediscover Merca’s identity Equation (
1).
Theorem 5. Let r and m be positive integers and . Then,where is the generalized Euler polynomial of order m. Proof. The identity follows from
□
Corollary 9. For the generalized Bernoulli polynomials of order satisfy the following relation: Proof. Replace
x with
and use the reciprocal relation (see [
22])
□
Setting and using the fact that , we obtain:
Corollary 10. For the Bernoulli polynomials satisfy the following relation:and Inserting
in Equation (
42) or
in Equation (
43) yields
and
for each
. We can see that
or
produce Merca’s identity Equation (
1). It is also worth mentioning the special cases of the above results for
y being a power of 2.
We now focus on presenting other types of convolutions. Some types follow straightforwardly from the definitions Equations (
6) and (
20). For instance, it is fairly easy to deduce that for each integer
and
and
Setting
corresponds to the representation
Theorem 6. For and we haveand Proof. The first identity follows from
The other one can be proved similarly. □
Theorem 7. For and , we have the following convolutionwhere denotes the falling factorial defined by Proof. Since
we have the relation
□
Replacing
x with
and using (
41), we immediately get the alternating version of Theorem 7.
Corollary 11. For and we have the following convolution For
the above results reduce to convolutions for generalized Bernoulli polynomials:
and
These results generalize the known convolutions for Bernoulli polynomials, which are obtained for . The analogue convolution for is given next.
Theorem 8. For and , the following convolution result holds: For , the result becomes Corollary 12. For and the following convolution result holds: For the result becomes Proof. This result follows from the reciprocal relation for
(see [
22])
□
Theorem 9. For and the following convolution result holds: Upon replacing
x with
and
y with
and using Equations (
41) and (
57), we also get the alternating version of the previous result.
Corollary 13. For and the following convolution result holds: The case
produces relations involving Bernoulli and Genocchi polynomials:
and
5. Probabilistic Interpretation of Bernoulli and Euler–Genocchi Polynomials
In this section, we indicate a possible application of the polynomials discussed in this work.
Consider a probability measure space
, where
is a non-empty space,
is a
-algebra of events and
P is a probability measure on
. Let
X be a random variable which is a measurable real function on the probability space
, and let
be a probability density function of
X. Then mathematical expectation and moments of order
n of
X are defined by
with
. The moment-generating function of
X is defined by
The relation between the moment generating function
and and moments
is given by
Suppose that (
6), (
20), (
21) and (
22) are moment-generating functions of random variables
. Then,
Another interpretation is the next example. Let
X be a discrete random variable on
. Then, we can define a probability distribution for
X by
Next, replacing
k by
in the identity
we get
which, upon differentiating with respect to
x, yields
Inserting
gives
which shows that
In an analogous fashion, the quantity can be interpreted probabilistically.
6. Conclusions and Future Work
In this paper, mainly focusing on convolutions, we established additional properties of the generalized Bernoulli and Euler–Genocchi polynomials
and
, respectively. These properties provide generalizations of some known facts about generalized Bernoulli and Euler polynomials, respectively. In the future, we intend to work in two different directions. First, it seem desirable to find some new kinds of closed-form expressions for our polynomials (such as combinatorial, integral, hypergeometric and determinantal ones). Such expressions will provide us with new and significant properties of these polynomials. Second, it is possible to study the Apostol-type generalized polynomials
associated with the complex parameter
, which are defined by the generating function
Then, it is fairly easy to identify the relations and . Therefore, by means of it is possible to discuss both and , at once.