**1. Introduction**

Bernoulli numbers (*Bn*)*n*≥<sup>0</sup> are defined by

$$B(z) = \sum\_{n=0}^{\infty} B\_n \frac{z^n}{n!} = \frac{z}{e^z - 1} \qquad (|z| < 2\pi).$$

A generalization of Bernoulli numbers are Bernoulli polynomials *Bn*(*x*), *x* ∈ C, defined by

$$B(x,z) = \sum\_{n=0}^{\infty} B\_n(x) \frac{z^n}{n!} = \frac{z}{e^z - 1} e^{xz} \qquad (|z| < 2\pi).$$

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 |*z*| < *π* by

$$\sum\_{n=0}^{\infty} E\_{\text{ll}}(\mathbf{x}) \frac{z^n}{n!} = \frac{2}{e^z + 1} e^{\mathbf{x} z} \qquad \text{and} \qquad \sum\_{n=0}^{\infty} G\_{\text{ll}}(\mathbf{x}) \frac{z^n}{n!} = \frac{2z}{e^z + 1} e^{\mathbf{x} z}.$$

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–10] for instance. See [11–14] for some properties of generalizations of these polynomials.

**Citation:** Frontczak, R.; Tomovski, Ž. Convolutions for Bernoulli and Euler–Genocchi Polynomials of Order (*<sup>r</sup>*,*<sup>m</sup>*) and Their Probabilistic Interpretation. *Symmetry* **2022**, *14*, 1220. https://doi.org/10.3390/ sym14061220

Academic Editors: Ioan Ras , a and Sergei D. Odintsov

Received: 12 May 2022 Accepted: 6 June 2022 Published: 13 June 2022

**Publisher's Note:** MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

**Copyright:** © 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https:// creativecommons.org/licenses/by/ 4.0/).

The popularity and importance of Bernoulli numbers and polynomials in number theory comes also from their connection to the Riemann zeta function

$$
\zeta(2n) = (-1)^{n+1} \frac{(2\pi)^{2n}}{2 \cdot (2n)!} B\_{2n\nu}
$$

where

$$\zeta(s) = \sum\_{n=1}^{\infty} \frac{1}{n^s}, \qquad \Re(s) > 1,$$

is the Riemann zeta function [15]. A grea<sup>t</sup> 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:

$$\sum\_{k=0}^{n} \binom{n}{k} 2^k B\_k = (2 - 2^n) B\_n. \tag{1}$$

This relation can be used to derive a recurrence relation for *ζ*(<sup>2</sup>*n*). Moreover, in his next article on the topic, Merca [17] used recurrence relations for Bernoulli polynomials *Bn*(*x*) 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 *x*, *α* ∈ C. Then

$$\sum\_{k=0}^{n} \binom{n}{k} B\_k(\mathbf{x}) (a^{n-k} - (-1)^k (2\mathbf{x} - 1 + a)^{n-k}) = 0,\tag{2}$$

and

$$\sum\_{k=0}^{\left\lfloor \frac{n}{2} \right\rfloor} \binom{n}{2k} a^{2k} B\_{n-2k}(\mathbf{x}) = \sum\_{k=0}^{n} \binom{n}{k} (-1)^{n-k} \frac{(2\mathbf{x} - \mathbf{1} + \mathbf{a})^k + (2\mathbf{x} - \mathbf{1} - \mathbf{a})^k}{2} B\_{n-k}(\mathbf{x}). \tag{3}$$

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

$$B(2z)(e^z + 1) = 2B(z) \quad \text{and} \quad B(\mathbf{x}, z)e^{yz} = B(\mathbf{x}, -z)e^{(2x - 1 + y)z}.$$

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]

$$\sum\_{k=0}^{n} \binom{n}{k} m^k B\_k \sum\_{i=0}^{m-1} i^{n-k} = m B\_{n,k}$$

valid for all integers *m* ≥ 1. Thus, Equation (1) is the special case for *m* = 2. Next, we can define the function Φ(*m*) *n* (*<sup>x</sup>*, *y*), *m* ≥ 1, *x*, *y* ∈ C, by

$$\Phi\_n^{(m)}(x,y) = \sum\_{k=0}^n \binom{n}{k} m^k B\_k(x) y^{n-k}.$$

Then, the following identity has been known for a long time:

$$\Phi\_n^{(m)}(\mathbf{x}, \mathbf{y}) = \sum\_{k=0}^n \binom{n}{k} (-m)^k B\_k(\mathbf{x}) (2m\mathbf{x} - m + \mathbf{y})^{n-k}, \quad m \ge 1. \tag{4}$$

The identity Equation (4) reduces to Equation (2) when *m* = 1 and *y* = *α*. It is easy to see that Φ(*m*) *n* (*<sup>x</sup>*, *y*) satisfies the following functional equation.

**Proposition 1.** *For all m*, *n* ∈ N *the following functional equation holds:*

$$
\Phi\_n^{(m)}(x, -(2mx - m + y)) = (-1)^n \Phi\_n^{(m)}(x, y). \tag{5}
$$

In addition, we can examine a calculation of the sum Φ(*m*) *n* (*<sup>x</sup>*, *y*) + Φ(*m*) *n* (*<sup>x</sup>*, <sup>−</sup>*y*). We have

$$\Phi\_n^{(m)}(\mathbf{x}, \mathbf{y}) + \Phi\_n^{(m)}(\mathbf{x}, -\mathbf{y}) = \begin{cases} 2\sum\_{l=0}^{\lfloor n/2 \rfloor} \binom{n}{2l} m^{n-2l} B\_{n-2l}(\mathbf{x}) \mathbf{y}^{2l}, & \text{if } n-k=2l;\\ 0, & \text{otherwise.} \end{cases}$$

In view of such an identity, we recognize that Equation (3) is an obvious consequence of Equation (2). Finally, we remark that if *n* − *k* is odd, then Φ(*m*) *n* (*<sup>x</sup>*, *y*) = −Φ(*m*) *n* (*<sup>x</sup>*, <sup>−</sup>*y*), i.e., the function Φ(*m*) *n*(*<sup>x</sup>*, *y*) is an odd or asymmetric function with respect to *y*.

We conclude this section by recalling the definition of *<sup>B</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*), which comes from [22].

**Definition 1.** *For integers r*, *m* ≥ 1 *the generalized Bernoulli polynomials of order* (*r*, *m*) *are defined by the generating function*

$$B(r,m;\mathbf{x},z) = \sum\_{n=0}^{\infty} B\_n^{(r,m)}(\mathbf{x}) \frac{z^n}{n!} = \left(\frac{z^r}{e^z - 1}\right)^m e^{zz} \qquad (|z| < 2\pi). \tag{6}$$

*The numbers <sup>B</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (0) = *<sup>B</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n are called generalized Bernoulli numbers of order r and m.*

The polynomials *<sup>B</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*) belong to the family of Appell polynomials. We mention that they are defined for *n* ≥ *m*(*r* − <sup>1</sup>), i.e., *<sup>B</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *j* (*x*) = 0 for *j* < *m*(*r* − <sup>1</sup>). From the definition, it is obvious that *B*(1,1) *n* (*x*) = *Bn*(*x*) and *B*(1,*m*) *n* (*x*) = *B*(*m*) *n* (*x*) are the generalized Bernoulli polynomials of order *m*. Moreover, *B*(1,1) *n* = *Bn* are the Bernoulli numbers.

The goal of the present article is to derive several convolutions for generalized Bernoulli polynomials of order (*r*, *<sup>m</sup>*), *<sup>B</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*). 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 *<sup>A</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*). A range of additional convolutions for *<sup>B</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*) and *<sup>A</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*) will be given in Section 4. Among other things, we will rediscover identity Equation (1) as a special case of our findings. In Sections 5 and 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 x*, *y* ∈ C*. Then,*

$$\sum\_{k=0}^{n} \binom{n}{k} B\_k^{(r,m)}(\mathbf{x}) (y^{n-k} - (-1)^{m(r-1)+k} (2\mathbf{x} - m + y)^{n-k}) = 0. \tag{7}$$

*Especially, with y* = *m, we have*

$$\sum\_{k=0}^{n} \binom{n}{k} B\_k^{(r,m)}(x) (m^{n-k} - (-1)^{m(r-1)+k} (2x)^{n-k}) = 0. \tag{8}$$

**Proof.** For |*z*| < 2*π* we have from Equation (6)

$$\begin{split} & \left( \sum\_{n=0}^{\infty} B\_n^{(r,m)}(x) \frac{z^n}{n!} \right) \left( \sum\_{n=0}^{\infty} y^n \frac{z^n}{n!} \right) = \left( \frac{z^r}{e^z - 1} \right)^m e^{xz} e^{yz} \\ & \qquad = \frac{z^{rm}}{(-1)^m (e^{-z} - 1)^m} e^{-xz} e^{(y + 2x - m)z} \\ & \qquad = (-1)^{m(r-1)} \left( \frac{(-z)^r}{e^{-z} - 1} \right)^m e^{-xz} e^{(y + 2x - m)z} \\ & \qquad = (-1)^{m(r-1)} B(r, m; x, -z) e^{(y + 2x - m)z} \\ & \qquad = (-1)^{m(r-1)} \left( \sum\_{n=0}^{\infty} B\_n^{(r,m)}(x) (-1)^n \frac{z^n}{n!} \right) \left( \sum\_{n=0}^{\infty} (y + 2x - m)^n \frac{z^n}{n!} \right) \\ & \qquad = \sum\_{n=0}^{\infty} \left( \sum\_{k=0}^n \binom{n}{k} (-1)^{m(r-1) + k} B\_k^{(r,m)}(x) (y + 2x - m)^{n-k} \right) \frac{z^n}{n!}. \end{split}$$

On the other hand, using Cauchy's rule, it is obvious that

$$\left(\sum\_{n=0}^{\infty} B\_n^{(r,m)}(x) \frac{z^n}{n!} \right) \left(\sum\_{n=0}^{\infty} y^n \frac{z^n}{n!} \right) = \sum\_{n=0}^{\infty} \left( \sum\_{k=0}^n \binom{n}{k} B\_k^{(r,m)}(x) y^{n-k} \right) \frac{z^n}{n!}.$$

Comparing the coefficients for *z<sup>n</sup>* in the two power series proves the formula.

For (*r*, *m*)=(1, 1) Theorem 1 reduces to Merca's Theorem 2.1. For (*r*, *m*)=(1, *m*) our theorem gives a convolutional relation for generalized Bernoulli polynomials:

**Corollary 1.** *For x*, *y* ∈ C *the following relation holds for generalized Bernoulli polynomials:*

$$\sum\_{k=0}^{n} \binom{n}{k} B\_k^{(m)}(x) (y^{n-k} + (-1)^{k+1}(2x - m + y)^{n-k}) = 0. \tag{9}$$

**Corollary 2.** *For x* ∈ C *the following relation holds:*

$$B\_{\rm tr}^{(r,m)}(\mathbf{x}) = \sum\_{k=0}^{n} \binom{n}{k} (-1)^{m(r-1)+k} B\_{\rm k}^{(r,m)}(\mathbf{x}) (2\mathbf{x} - m)^{n-k}.\tag{10}$$

*Especially for the generalized Bernoulli polynomials we have the identity*

$$B\_n^{(m)}(x) = \sum\_{k=0}^n \binom{n}{k} (-1)^k B\_k^{(m)}(x) (2x - m)^{n-k}.\tag{11}$$

**Proof.** Set *y* = 0 in Theorem 1.

> Next, for *x*, *y* ∈ C, we define the function

$$F\_n^{(r,m)}(x,y) = \sum\_{k=0}^n \binom{n}{k} B\_k^{(r,m)}(x) y^{n-k}, \quad r, m \ge 1. \tag{12}$$

Then, we note the following functional equation:

**Proposition 2.** *For all r*, *m*, *n* ∈ N *the following functional equation holds:*

$$F\_{n}^{(r,m)}(\mathbf{x}, -(2m\mathbf{x} - m + y)) = (-1)^{n+m(r-1)} F\_{n}^{(r,m)}(\mathbf{x}, y). \tag{13}$$

**Proof.** Replacing *y* with −(<sup>2</sup>*<sup>x</sup>* − *m* + *y*)in Equation (12), using Equation (7), we ge<sup>t</sup> the result. We can also calculate

$$F\_n^{(r,m)}(\mathbf{x},y) + F\_n^{(r,m)}(\mathbf{x},-y) = \begin{cases} 2\sum\_{l=0}^{\lfloor n/2 \rfloor} \binom{n}{2l} B\_{n-2l}^{(r,m)}(\mathbf{x}) y^{2l}, & \text{if } n-k=2l;\\ 0, & \text{otherwise}, \end{cases}$$

and

$$F\_n^{(r,m)}(\mathbf{x}, \mathbf{y}) - F\_n^{(r,m)}(\mathbf{x}, -\mathbf{y}) = \begin{cases} 2\sum\_{l=0}^{\lfloor (n-1)/2 \rfloor} \binom{n}{2l+1} B\_{n-2l-1}^{(r,m)}(\mathbf{x}) y^{2l+1}, & \text{if } n-k = 2l+1;\\ 0, & \text{otherwise.} \end{cases}$$

These calculations confirm the following facts.


The above observations lead to the next corollary, which provides an extension of Theorem 3.1 of [17] to the class *<sup>B</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*).

**Corollary 3.** *Let r and m be positive integers and x*, *y* ∈ C*. Then,*

$$\begin{aligned} &\sum\_{k=0}^{\lfloor \frac{n}{2} \rfloor} \binom{n}{2k} y^{2k} B\_{n-2k}^{(r,m)}(x) \\ &= (-1)^{m(r-1)} \sum\_{k=0}^{n} \binom{n}{k} (-1)^{n-k} \frac{(2x-m+y)^k + (2x-m-y)^k}{2} B\_{n-k}^{(r,m)}(x) \end{aligned} \tag{14}$$

*and*

$$\begin{aligned} &\sum\_{k=0}^{\left\lfloor\frac{n-1}{2}\right\rfloor} \binom{n}{2k+1} y^{2k+1} B\_{n-2k-1}^{(r,m)}(\mathbf{x}) \\ &= (-1)^{m(r-1)} \sum\_{k=0}^{n} \binom{n}{k} (-1)^{n-k} \frac{(2\mathbf{x} - \mathbf{m} + \mathbf{y})^{k} - (2\mathbf{x} - \mathbf{m} - \mathbf{y})^{k}}{2} B\_{n-k}^{(r,m)}(\mathbf{x}). \end{aligned} (15)$$

We conclude this section with the following results.

**Corollary 4.** *Let r and m be positive integers and x*, *y* ∈ C*. Then,*

$$\begin{aligned} &\sum\_{k=0}^{\left\lfloor\frac{p}{2}\right\rfloor} \binom{n}{2k} (-1)^k y^{2k} B\_{n-2k}^{(r,m)}(\mathbf{x}) \\ &= (-1)^{m(r-1)} \sum\_{k=0}^n \binom{n}{k} (-1)^{n-k} B\_{n-k}^{(r,m)}(\mathbf{x}) \sum\_{p=0}^k \binom{k}{p} y^p \cos\left(\frac{\pi p}{2}\right) (2\mathbf{x}-m)^{k-p} \end{aligned} \tag{16}$$

*and*

$$\begin{aligned} &\sum\_{k=0}^{\left\lfloor\frac{n-1}{2}\right\rfloor} \binom{n}{2k+1} (-1)^k y^{2k+1} B\_{n-2k-1}^{(r,m)}(\mathbf{x}) \\ &= (-1)^{m(r-1)} \sum\_{k=0}^n \binom{n}{k} (-1)^{n-k} B\_{n-k}^{(r,m)}(\mathbf{x}) \sum\_{p=0}^k \binom{k}{p} y^p \sin\left(\frac{\pi p}{2}\right) (2\mathbf{x} - m)^{k-p} .\end{aligned} \tag{17}$$

**Proof.** Replace *y* by *iy* with *i* = √−1 in Corollary 3 and simplify. **Corollary 5.** *Let r and m be positive integers and x* ∈ C*. Then,*

$$\begin{aligned} \sum\_{k=0}^{\left[\frac{n}{2}\right]} \binom{n}{2k} (-1)^k m^{2k} B\_{n-2k}^{(r,m)}(x) \\ = (-1)^{m(r-1)} \sum\_{k=0}^n \binom{n}{k} (-1)^{n-k} 2^{k-1} (x^k + (x-m)^k) B\_{n-k}^{(r,m)}(x) \end{aligned} \tag{18}$$

*and*

$$\begin{split} & \sum\_{k=0}^{\left\lfloor \frac{n-1}{2} \right\rfloor} \binom{n}{2k+1} (-1)^k m^{2k+1} B\_{n-2k-1}^{(r,m)}(\mathbf{x}) \\ & = (-1)^{m(r-1)} \sum\_{k=0}^n \binom{n}{k} (-1)^{n-k} 2^{k-1} (\mathbf{x}^k - (\mathbf{x} - m)^k) B\_{n-k}^{(r,m)}(\mathbf{x}). \end{split} \tag{19}$$

**Proof.** Set *y* = *m* in Corollary 3 and simplify.

### **3. Analogue Relations for Generalized Euler–Genocchi Polynomials**

The definition of generalized Euler–Genocchi polynomials of order (*r*, *m*) also comes from the paper [22], where many basic properties of the polynomials are discussed.

**Definition 2.** *Let r and m be integers with r* ≥ 0 *and m* ≥ 1*. The generalized Euler–Genocchi polynomials of order* (*r*, *<sup>m</sup>*)*, <sup>A</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*)*, x* ∈ C*, are defined by the generating function*

$$A(r,m;\mathbf{x},\mathbf{z}) = \sum\_{n=0}^{\infty} A\_n^{(r,m)}(\mathbf{x}) \frac{\mathbf{z}^n}{n!} = \left(\frac{2\mathbf{z}^r}{\varepsilon^z + 1}\right)^m \mathfrak{e}^{\mathbf{x}\mathbf{z}} \qquad (|z| < \pi) \tag{20}$$

*with <sup>A</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *j* (*x*) = 0 *for j* < *rm. The numbers <sup>A</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (0) = *<sup>A</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n are called the generalized Euler–Genocchi numbers of order r and m.*

We see that *A*(0,*m*) *n* (*x*) = *E*(*m*) *n* (*x*) and *A*(1,*m*) *n* (*x*) = *G*(*m*) *n* (*x*) are the generalized Euler and Genocchi polynomials, respectively, where

$$\sum\_{n=0}^{\infty} E\_n^{(m)}(\mathbf{x}) \frac{z^n}{n!} = \left(\frac{2}{\varepsilon^z + 1}\right)^m \varepsilon^{xz} \qquad (|z| < \pi) \tag{21}$$

and

$$\sum\_{n=0}^{\infty} G\_n^{(m)}(\mathbf{x}) \frac{z^n}{n!} = \left(\frac{2z}{e^z + 1}\right)^m e^{xz} \qquad (|z| < \pi). \tag{22}$$

Finally, we mention that the degenerated case *m* = 0 gives *<sup>A</sup>*(*<sup>r</sup>*,<sup>0</sup>) *n* (*x*) = *x<sup>n</sup>* for all *r* ≥ 0. The first analogue result of Merca's identities is stated in the next theorem.

**Theorem 2.** *Let r and m be integers with r* ≥ 0 *and m* ≥ 1*, and x*, *y* ∈ C*. Then,*

$$\sum\_{k=0}^{n} \binom{n}{k} A\_k^{(r,m)}(x) (y^{n-k} - (-1)^{mr+k} (2x - m + y)^{n-k}) = 0. \tag{23}$$

*Especially, with y* = *m, we have*

$$\sum\_{k=0}^{n} \binom{n}{k} A\_k^{(r,m)}(x) (m^{n-k} - (-1)^{mr+k} (2x)^{n-k}) = 0. \tag{24}$$

**Proof.** Due to the high degree of similarity in the proofs, we only sketch the proofs. The identity basically follows from

$$A(r,m;x,z)e^{yz} = \left(\frac{2z^r}{e^z+1}\right)^m e^{xz} e^{yz} = (-1)^{mr} \left(\frac{2(-z)^r}{e^{-z}+1}\right)^m e^{-xz} e^{(2x+y-m)z}.$$

**Corollary 6.** *For x*, *y* ∈ C *the following relations hold:*

$$\sum\_{k=0}^{n} \binom{n}{k} E\_k^{(m)}(x) (y^{n-k} + (-1)^{k+1} (2x - m + y)^{n-k}) = 0 \tag{25}$$

*and*

$$\sum\_{k=0}^{n} \binom{n}{k} \mathcal{G}\_{k}^{(m)}(x) (y^{n-k} + (-1)^{m+k+1}(2x - m + y)^{n-k}) = 0. \tag{26}$$

**Proof.** Set *r* = 0 and *r* = 1 in Theorem 2.

**Corollary 7.** *For x* ∈ C *the following relation holds:*

$$A\_{n}^{(r,m)}(\mathbf{x}) = \sum\_{k=0}^{n} \binom{n}{k} (-1)^{mr+k} A\_{k}^{(r,m)}(\mathbf{x}) (2\mathbf{x} - m)^{n-k} \,. \tag{27}$$

**Proof.** Set *y* = 0 in Theorem 2.

**Theorem 3.** *Let r and m be integers with r* ≥ 0 *and m* ≥ 1*, and x*, *y* ∈ C*. Then,*

$$\begin{aligned} &\sum\_{k=0}^{\left\lfloor\frac{n}{2}\right\rfloor} \binom{n}{2k} y^{2k} A\_{n-2k}^{(r,m)}(x) \\ & = (-1)^{mr} \sum\_{k=0}^{n} \binom{n}{k} (-1)^{n-k} \frac{(2x-m+y)^k + (2x-m-y)^k}{2} A\_{n-k}^{(r,m)}(x) \end{aligned} \tag{28}$$

*and*

$$\begin{aligned} &\sum\_{k=0}^{\left\lfloor\frac{n-1}{2}\right\rfloor} \binom{n}{2k+1} y^{2k+1} A\_{n-2k-1}^{(r,m)}(\mathbf{x}) \\ &= (-1)^{mr} \sum\_{k=0}^{n} \binom{n}{k} (-1)^{n-k} \frac{(2x-m+y)^k - (2x-m-y)^k}{2} A\_{n-k}^{(r,m)}(\mathbf{x}). \end{aligned}$$

**Proof.** The proof follows the same arguments as the proof of Theorem 3.

The special cases where *y* is replaced by *iy* and *y* = *m* are obvious. We continue skipping the presentation of these explicit results.

**4. More Convolutions for** *B***(***<sup>r</sup>***,***<sup>m</sup>***)** *n* **(***x***) and** *<sup>A</sup>***(***<sup>r</sup>***,***<sup>m</sup>***)** *n* **(***x***)**

In this section, several other convolutions for *<sup>B</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*) and *<sup>A</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*) are derived. The first two theorems contain convolutions involving *<sup>B</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*) and powers of 2.

**Theorem 4.** *Let r and m be positive integers and x*, *y* ∈ C*. Then*

$$\sum\_{k=0}^{n} \binom{n}{k} 2^k B\_k^{(r,m)}(x) y^{n-k} = 2^{m(r-1)} \sum\_{k=0}^{n} \binom{n}{k} B\_k^{(r,m)}(2x+y) E\_{n-k}^{(m)}(0),\tag{30}$$

*where E*(*m*) *n* (*x*) *is the generalized Euler polynomial of order m.*

**Proof.** For |*z*| < 2*π* we have from Equation (6)

$$\begin{aligned} B(r,m;x,2z)e^{yz} &= \left(\sum\_{n=0}^{\infty} 2^n B\_n^{(r,m)}(x) \frac{z^n}{n!} \right) \left(\sum\_{n=0}^{\infty} y^n \frac{z^n}{n!} \right) \\ &= \sum\_{n=0}^{\infty} \left(\sum\_{k=0}^n \binom{n}{k} 2^k B\_k^{(r,m)}(x) y^{n-k} \right) \frac{z^n}{n!} .\end{aligned}$$

On the other hand, we observe that

$$\begin{array}{rcl} B(r,m;x,2z)e^{yz} &=& 2^{rm} \left(\frac{z^r}{e^{2z}-1}\right)^m e^{(2x+y)z} \\ &=& 2^{m(r-1)} \left(\frac{z^r}{e^z-1}\right)^m e^{(2x+y)z} \left(\frac{2}{e^z+1}\right)^m \\ &=& 2^{m(r-1)} \left(\sum\_{n=0}^\infty B\_n^{(r,m)}(2x+y) \frac{z^n}{n!}\right) \left(\sum\_{n=0}^\infty E\_n^{(m)}(0) \frac{z^n}{n!}\right) \end{array}$$

Comparing the coefficients for *z<sup>n</sup>* in the two power series proves the formula.

**Remark 1.** *From the above proof, it is clear that we can also write*

$$\begin{split} \sum\_{k=0}^{n} \binom{n}{k} 2^k B\_k^{(r,m)}(\mathbf{x}) y^{n-k} &= \ 2^{m(r-1)} \sum\_{k=0}^{n} \binom{n}{k} B\_k^{(r,m)}(\mathbf{x}+\mathbf{y}) E\_{n-k}^{(m)}(\mathbf{x}) \\ &= \ 2^{m(r-1)} \sum\_{k=0}^{n} \binom{n}{k} B\_k^{(r,m)}(\mathbf{x}) E\_{n-k}^{(m)}(\mathbf{x}+\mathbf{y}) \\ &= \ 2^{m(r-1)} \sum\_{k=0}^{n} \binom{n}{k} B\_k^{(r,m)}(\mathbf{y}) E\_{n-k}^{(m)}(\mathbf{x}). \end{split}$$

**Corollary 8.** *Let r and m be positive integers and x* ∈ C*. Then,*

$$2^n B\_n^{(r,m)}(\mathbf{x}) = 2^{m(r-1)} \sum\_{k=0}^n \binom{n}{k} B\_k^{(r,m)}(\mathbf{2x}) E\_{n-k}^{(m)}(\mathbf{0}),\tag{31}$$

$$\sum\_{k=0}^{n} \binom{n}{k} (-1)^{n-k} 2^k B\_k^{(r,m)}(\mathbf{x}) \mathbf{x}^{n-k} = 2^{m(r-1)} \sum\_{k=0}^{n} \binom{n}{k} B\_k^{(r,m)}(\mathbf{x}) E\_{n-k}^{(m)}(0) \tag{32}$$

*and*

$$\sum\_{k=0}^{n} \binom{n}{k} (-1)^{n-k} B\_k^{(r,m)}(\mathbf{x}) \mathbf{x}^{n-k} = 2^{m(r-1)-n} \sum\_{k=0}^{n} \binom{n}{k} B\_k^{(r,m)}(0) E\_{n-k}^{(m)}(0). \tag{33}$$

**Proof.** Set *y* = 0, *y* = −*x* and *y* = −2*x* in (30), respectively.

Evidently, the sums in the Corollary contain some interesting special cases. The evaluations with (*r*, *m*)=(1, <sup>1</sup>), and *x* = 0 and *x* = 1/2, respectively, yield the following identities for Bernoulli numbers:

$$\sum\_{k=0}^{n-1} \binom{n}{k} \frac{2 - 2^{n+2-k}}{n+1-k} B\_k B\_{n+1-k} = (2^n - 1) B\_{n\_\prime} \tag{34}$$

$$\sum\_{k=0}^{n-1} \binom{n}{k} (-1)^k \frac{2 - 2^{n+2-k}}{n+1-k} B\_k B\_{n+1-k} = (2 - 2^n - (-1)^n) B\_{\mathbb{N}\_\ell} \tag{35}$$

$$\sum\_{k=0}^{n-1} \binom{n}{k} (-1)^{n-k} (1 - 2^{k-1}) B\_k = (2^n - 1) B\_n \tag{36}$$

$$\sum\_{k=0}^{n} \binom{n}{k} (-1)^{n-k} 2^{2k} (2^{1-k} - 1) B\_k = -2^{n+1} \sum\_{k=0}^{n} \binom{n}{k} \frac{(2^{1-k} - 1)(2^{n+1-k} - 1)}{n+1-k} B\_k B\_{n+1-k} \tag{37}$$

where we have employed the following relations

$$E\_{n-1}(\mathbf{x}) = \frac{2}{n} (B\_n(\mathbf{x}) - \mathbf{2}^n B\_n(\mathbf{x}/\mathbf{2})),$$

and

$$B\_n(1/2) = (2^{1-n} - 1)B\_n.$$

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 *r* = *m* = 1, *x* = 0 and *y* = 1 in Equation (30) gives

$$\sum\_{k=0}^{n} \binom{n}{k} 2^k B\_k = \sum\_{k=0}^{n} \binom{n}{k} B\_k(1) E\_{n-k}(0) = 2^n B\_n(1/2),\tag{38}$$

where we have used Equation (31). Hence, we rediscover Merca's identity Equation (1).

**Theorem 5.** *Let r and m be positive integers and x*, *y* ∈ C*. Then,*

$$\sum\_{k=0}^{n} \binom{n}{k} 2^k B\_k^{(r,m)}(\mathbf{x}) y^{n-k} = 2^{m(r-1)} \sum\_{j=0}^{n} \binom{m}{j} (-1)^{m-j} 2^j \sum\_{k=0}^{n} \binom{n}{k} B\_k^{(r,m)}(\mathbf{0}) E\_{n-k}^{(m-j)}(\mathbf{2}\mathbf{x} - m + y), \tag{39}$$

*where E*(*m*) *n* (*x*) *is the generalized Euler polynomial of order m.*

**Proof.** The identity follows from

$$\begin{split} B(r,m;x,2z)e^{yz} &= \ 2^{rm} \left( \frac{z^{r}}{\epsilon^{2z}-1} \right)^{m} e^{(2x+y)z} \\ &= \ 2^{rm} e^{(2x-m+y)z} \left( \frac{z^{r}}{\epsilon^{z}-1} - \frac{z^{r}}{\epsilon^{2z}-1} \right)^{m} \\ &= \ 2^{rm} e^{(2x-m+y)z} \left( \sum\_{j=0}^{m} \binom{m}{j} (-1)^{m-j} \left( \frac{z^{r}}{\epsilon^{z}-1} \right)^{j} \left( \frac{z^{r}}{\epsilon^{z}-1} \right)^{m-j} \right) \\ &= \ 2^{rm} \left( \frac{z^{r}}{\epsilon^{z}-1} \right)^{m} e^{(2x-m+y)z} \left( \sum\_{j=0}^{m} \binom{m}{j} (-1)^{m-j} \left( \frac{1}{\epsilon^{z}+1} \right)^{m-j} \right) \\ &= \ 2^{rm} \left( \frac{z^{r}}{\epsilon^{z}-1} \right)^{m} \left( \sum\_{j=0}^{m} \binom{m}{j} (-1)^{m-j} 2^{j-m} \left( \frac{2}{\epsilon^{z}+1} \right)^{m-j} \epsilon^{(2x-m+y)z} \right) \\ &= \ 2^{r(m-1)} \sum\_{j=0}^{m} \binom{m}{j} (-1)^{m-j} 2^{j} \left( \frac{z^{r}}{\epsilon^{z}-1} \right)^{m} \left( \frac{2}{\epsilon^{z}+1} \right)^{m-j} \epsilon^{(2x-m+y)z}. \end{split}$$

**Corollary 9.** *For x*, *y* ∈ C *the generalized Bernoulli polynomials of order* (*r*, *m*) *satisfy the following relation:*

$$\begin{split} &\sum\_{k=0}^{n} \binom{n}{k} (-1)^{k-m(r-1)} 2^k B\_k^{(r,m)}(\mathbf{x}) y^{n-k} \\ & \qquad = 2^{m(r-1)} \sum\_{j=0}^{m} \binom{m}{j} (-1)^{m-j} 2^j \sum\_{k=0}^{n} \binom{n}{k} B\_k^{(r,m)}(0) E\_{n-k}^{(m-j)}(m+y-2\mathbf{x}). \end{split} \tag{40}$$

**Proof.** Replace *x* with *m* − *x* and use the reciprocal relation (see [22])

$$B\_n^{(r,m)}(m-\mathbf{x}) = (-1)^{n-m(r-1)}B\_n^{(r,m)}(\mathbf{x}).\tag{41}$$

Setting *r* = *m* = 1 and using the fact that *E*(0) *n* (*x*) = *<sup>x</sup>n*, we obtain:

**Corollary 10.** *For x*, *y* ∈ C *the Bernoulli polynomials satisfy the following relation:*

$$\sum\_{k=0}^{n} \binom{n}{k} 2^k B\_k(\mathbf{x}) y^{n-k} = \sum\_{k=0}^{n} \binom{n}{k} B\_k(2(2\mathbf{x} - \mathbf{1} + y)^{n-k} - E\_{n-k}(2\mathbf{x} - \mathbf{1} + y)) \tag{42}$$

*and*

$$\sum\_{k=0}^{n} \binom{n}{k} (-1)^{k} 2^{k} B\_{k}(\mathbf{x}) y^{n-k} = \sum\_{k=0}^{n} \binom{n}{k} B\_{k} (2(1+y-2\mathbf{x})^{n-k} - E\_{n-k}(1+y-2\mathbf{x})).\tag{43}$$

Inserting *x* = (1 − *y*)/2 in Equation (42) or *x* = (1 + *y*)/2 in Equation (43) yields

$$\sum\_{k=0}^{n} \binom{n}{k} 2^k B\_k \left(\frac{1-y}{2}\right) y^{n-k} = (2-2^n) B\_n \tag{44}$$

and

$$\sum\_{k=0}^{n} \binom{n}{k} (-1)^{k} 2^{k} B\_{k} \left( \frac{1+y}{2} \right) y^{n-k} = (2-2^{n}) B\_{n} \tag{45}$$

for each *y* ∈ C. We can see that *y* = 1 or *y* = −1 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 *p* ≥ 0 and *x*, *y* ∈ C

$$\sum\_{k=0}^{n} \binom{n}{k} B\_k^{(r,m)}(\boldsymbol{x}) B\_{n-k}^{(r,p)}(\boldsymbol{y}) = B\_n^{(r,m+p)}(\boldsymbol{x} + \boldsymbol{y})$$

and

$$\sum\_{k=0}^{n} \binom{n}{k} A\_k^{(r,m)}(\mathfrak{x}) A\_{n-k}^{(r,p)}(\mathfrak{y}) = A\_n^{(r,m+p)}(\mathfrak{x}+\mathfrak{y}).$$

Setting *p* = *x* = 0 corresponds to the representation

$$\sum\_{k=0}^{n} \binom{n}{k} B\_k^{(r,m)} \mathbf{x}^{n-k} = B\_n^{(r,m)}(\mathbf{x}) \quad \text{and} \quad \sum\_{k=0}^{n} \binom{n}{k} A\_k^{(r,m)} \mathbf{x}^{n-k} = A\_n^{(r,m)}(\mathbf{x}).$$

**Theorem 6.** *For m*, *p* ≥ 0 *and x*, *y* ∈ C *we have*

$$\begin{aligned} \sum\_{k=0}^{n} \binom{n}{k} B\_k^{(r,m)}(\mathbf{x}) B\_{n-k}^{(r,p)}(y) &= \\ \sum\_{k=0}^{n} \binom{n}{k} (-1)^{(r-1)(m+p)+k} B\_k^{(r,m+p)}(\mathbf{x}) (2\mathbf{x} + y - (m+p))^{n-k} \end{aligned} \tag{46}$$

*and*

$$\begin{array}{l} \sum\_{k=0}^{n} \binom{n}{k} A\_{k}^{(r,m)}(\mathbf{x}) A\_{n-k}^{(r,p)}(\mathbf{y}) = \\ \sum\_{k=0}^{n} \binom{n}{k} (-1)^{r(m+p)+k} A\_{k}^{(r,m+p)}(\mathbf{x}) (2\mathbf{x} + \mathbf{y} - (m+p))^{n-k} .\end{array} \tag{47}$$

**Proof.** The first identity follows from

$$\left(\frac{z^r}{e^z - 1}\right)^m e^{xz} \cdot \left(\frac{z^r}{e^z - 1}\right)^p e^{yz} = (-1)^{(r-1)(m+p)} \left(\frac{(-z)^r}{e^{-z} - 1}\right)^{m+p} e^{-xz} e^{(2x+y-(m+p))z}.$$

The other one can be proved similarly.

**Theorem 7.** *For r*, *m* ≥ 1 *and x*, *y* ∈ C*, we have the following convolution*

$$m\sum\_{k=0}^{n} \binom{n}{k} B\_k^{(r,m)}(\mathbf{x}) B\_{n-k}^{(r,1)}(y+1-m) = (\mathbf{x}+y-m)(n)\_r B\_{n-r}^{(r,m)}(\mathbf{x}+y-m)$$

$$-(n+1-r(m+1))(n)\_{r-1} B\_{n+1-r}^{(r,m)}(\mathbf{x}+y-m),\tag{48}$$

*where* (*n*)*r denotes the falling factorial defined by*

$$n(n)\_r = \begin{cases} 1, & r = 0; \\ n(n-1)\cdots(n-r+1), & r \ge 1. \end{cases} \tag{49}$$

**Proof.** Since

$$\frac{d}{dz}\frac{e^{(\mathbf{x}+\mathbf{y}-\mathbf{m})z}}{(e^z-1)^m} = (\mathbf{x}+\mathbf{y}-m)\frac{e^{(\mathbf{x}+\mathbf{y}-\mathbf{m})z}}{(e^z-1)^m} - m\frac{e^{(\mathbf{x}+\mathbf{y}+\mathbf{1}-\mathbf{m})z}}{(e^z-1)^{m+1}}.$$

we have the relation

$$m\left(\frac{z^r}{e^z - 1}\right)^{m+1} e^{(x+y+1-m)z} = (x+y-m)z^r \left(\frac{z^r}{e^z - 1}\right)^m e^{(x+y-m)z} - z^{r(m+1)} \frac{d}{dz} \frac{e^{(x+y-m)z}}{(e^z - 1)^m}.$$
 
$$\Box$$

Replacing *x* with *m* − *x* and using (41), we immediately ge<sup>t</sup> the alternating version of Theorem 7.

**Corollary 11.** *For r*, *m* ≥ 1 *and x*, *y* ∈ C *we have the following convolution*

$$m\sum\_{k=0}^{\mathbb{N}} \binom{n}{k} (-1)^{k-m(r-1)} B\_k^{(r,m)}(\mathbf{x}) B\_{n-k}^{(r,1)}(y+1-m) = (y-\mathbf{x})(n)\_r B\_{n-r}^{(r,m)}(y-\mathbf{x})$$

$$-(n+1-r(m+1))(n)\_{r-1} B\_{n+1-r}^{(r,m)}(y-\mathbf{x}).\tag{50}$$

For (*r*, *m*)=(1, *m*) the above results reduce to convolutions for generalized Bernoulli polynomials:

$$m\sum\_{k=0}^{N} \binom{n}{k} B\_k^{(m)}(\mathbf{x}) B\_{n-k}(y+1-m) \quad = \quad (\mathbf{x}+y-m)nB\_{n-1}^{(m)}(\mathbf{x}+y-m)$$

$$-(n-m)B\_n^{(m)}(\mathbf{x}+y-m), \tag{51}$$

and

$$m\sum\_{k=0}^{n} \binom{n}{k} (-1)^{k} B\_{k}^{(m)}(\mathbf{x}) B\_{n-k}(\mathbf{y} + 1 - m) = (\mathbf{y} - \mathbf{x}) n B\_{n-1}^{(m)}(\mathbf{y} - \mathbf{x}) - (n - m) B\_{n}^{(m)}(\mathbf{y} - \mathbf{x}).\tag{52}$$

These results generalize the known convolutions for Bernoulli polynomials, which are obtained for (*r*, *m*)=(1, <sup>1</sup>). The analogue convolution for *<sup>A</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*) is given next.

**Theorem 8.** *For r*, *m* ≥ 1 *and x*, *y* ∈ C*, the following convolution result holds:*

$$m\sum\_{k=0}^{n} \binom{n}{k} A\_k^{(r,m)}(\mathbf{x}) A\_{n-k}^{(r,1)}(\mathbf{y}+1-m) = 2(\mathbf{x}+\mathbf{y}-m)(n)\_r A\_{n-r}^{(r,m)}(\mathbf{x}+\mathbf{y}-m)$$

$$-2(n+1-r(m+1))(n)\_{r-1} A\_{n+1-r}^{(r,m)}(\mathbf{x}+\mathbf{y}-m). \tag{53}$$

*For r* = 0*, the result becomes*

$$m\Sigma\_{k-0}^{u}(\,^{(n)}\_{k}E\_{k}^{(m)}(\mathbf{x})E\_{n-k}(y+1-m) = 2(\mathbf{x}+y-m)E\_{n}^{(m)}(\mathbf{x}+y-m) - 2E\_{n+1}^{(m)}(\mathbf{x}+y-m). \tag{54}$$

**Proof.** Use

$$\begin{aligned} m \left( \frac{2\tau^r}{\varepsilon^2 + 1} \right)^{m+1} \mathfrak{c}^{(x+y+1-m)z} &= \\ 2(x+y-m)z^r \left( \frac{2\tau^r}{\varepsilon^2 + 1} \right)^m \mathfrak{c}^{(x+y-m)z} - 2^{m+1} z^{r(m+1)} \frac{d}{dz} \frac{\mathfrak{c}^{(x+y-m)z}}{(\mathfrak{c}^z + 1)^m} \end{aligned}$$

**Corollary 12.** *For r*, *m* ≥ 1 *and x*, *y* ∈ C *the following convolution result holds:*

$$m\sum\_{k=0}^{n} \binom{n}{k} (-1)^{k-rm} A\_k^{(r,m)}(\mathbf{x}) A\_{n-k}^{(r,1)}(y+1-m) = 2(y-\mathbf{x})(n)\_r A\_{n-r}^{(r,m)}(y-\mathbf{x})$$

$$-2(n+1-r(m+1))(n)\_{r-1} A\_{n+1-r}^{(r,m)}(y-\mathbf{x}).\tag{55}$$

*For r* = 0 *the result becomes*

$$m\sum\_{k=0}^{n} \binom{n}{k} (-1)^{k} E\_{k}^{(m)}(\mathbf{x}) E\_{n-k}(y+1-m) = 2(y-\mathbf{x})E\_{n}^{(m)}(y-\mathbf{x}) - 2E\_{n+1}^{(m)}(y-\mathbf{x}).\tag{56}$$

**Proof.** This result follows from the reciprocal relation for *<sup>A</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*) (see [22])

$$A\_n^{(r,m)}(m-\mathbf{x}) = (-1)^{n-mr} A\_n^{(r,m)}(\mathbf{x}).\tag{57}$$

.

**Theorem 9.** *For r*, *m* ≥ 1 *and x*, *y* ∈ C *the following convolution result holds:*

$$2^n B\_n^{(r,m)}\left(\frac{\chi+y}{2}\right) = 2^{m(r-1)} (n)\_{rm} \sum\_{k=0}^{n-rm} \binom{n-rm}{k} B\_k^{(r,m)}(x) A\_{n-rm-k}^{(r,m)}(y). \tag{58}$$

**Proof.** Use

$$\left(\frac{(2z)^r}{\varepsilon^{2z}-1}\right)^m e^{(x+y)z} = 2^{m(r-1)} z^{-rm} \left(\frac{z^r}{\varepsilon^z-1}\right)^m e^{xz} \left(\frac{2z^r}{\varepsilon^z+1}\right)^m e^{yz}.$$

Upon replacing *x* with *m* − *x* and *y* with *m* − *y* and using Equations (41) and (57), we also ge<sup>t</sup> the alternating version of the previous result.

**Corollary 13.** *For r*, *m* ≥ 1 *and x*, *y* ∈ C *the following convolution result holds:*

$$\begin{split} & \quad 2^n B\_n^{(r,m)} \left( m - \frac{x+y}{2} \right) \\ &= (-1)^{n-m(r-1)} 2^{m(r-1)} (n)\_{rm} \sum\_{k=0}^{n-rm} \binom{n-rm}{k} B\_k^{(r,m)}(x) A\_{n-rm-k}^{(r,m)}(y) . \end{split} \tag{59}$$

The case (*r*, *m*)=(1, 1) produces relations involving Bernoulli and Genocchi polynomials:

$$2^n B\_n\left(\frac{\chi+y}{2}\right) = n \sum\_{k=0}^{n-1} \binom{n-1}{k} B\_k(\mathbf{x}) G\_{n-1-k}(y) \tag{60}$$

$$2^n B\_n\left(1 - \frac{\mathbf{x} + \mathbf{y}}{2}\right) = (-1)^n n \sum\_{k=0}^{n-1} \binom{n-1}{k} B\_k(\mathbf{x}) \mathbf{G}\_{n-1-k}(\mathbf{y}).\tag{61}$$

### **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 (<sup>Ω</sup>, F, *<sup>P</sup>*), where Ω is a non-empty space, F is a *σ*-algebra of events and *P* is a probability measure on F. Let *X* be a random variable which is a measurable real function on the probability space (<sup>Ω</sup>, F, *<sup>P</sup>*), and let *p*(*x*) be a probability density function of *X*. Then mathematical expectation and moments of order *n* of *X* are defined by

$$E[X] = \int\_{-\infty}^{\infty} x p(x) \, dx \qquad \text{and} \qquad E[X^{\text{n}}] = \int\_{-\infty}^{\infty} x^{\text{n}} p(x) \, dx,$$

with *E*[*X*<sup>1</sup>] = *<sup>E</sup>*[*X*]. The moment-generating function of *X* is defined by

$$\mu(t) = E[e^{tX}] = \int\_{-\infty}^{\infty} e^{tx} p(\mathbf{x}) \, d\mathbf{x}, \qquad t \in \mathbb{R}.$$

The relation between the moment generating function *μ*(*t*) and and moments *E*[*Xn*] is given by

$$\mu(t) = \sum\_{k=0}^{\infty} \frac{t^k}{k!} E\left[X^k\right].$$

Suppose that (6), (20), (21) and (22) are moment-generating functions of random variables *X*1, *X*2,..., *X*5. Then,

$$\begin{array}{rcl} E[X\_1^n] &=& \frac{d^n}{dz^n} \left\{ \left(\frac{z^r}{\varepsilon^z - 1}\right)^m e^{xz} \right\} \Big|\_{z=0} = B\_n^{(r,m)}(x), \\ E[X\_2^n] &=& \frac{d^n}{dz^n} \left\{ \left(\frac{z}{\varepsilon^z - 1}\right)^m e^{xz} \right\} \Big|\_{z=0} = B\_n^{(m)}(x), \\ E[X\_3^n] &=& \frac{d^n}{dz^n} \left\{ \left(\frac{2z^r}{\varepsilon^z + 1}\right)^m e^{xz} \right\} \Big|\_{z=0} = A\_n^{(r,m)}(x), \\ E[X\_4^n] &=& \frac{d^n}{dz^n} \left\{ \left(\frac{2}{\varepsilon^z + 1}\right)^m e^{xz} \right\} \Big|\_{z=0} = E\_n^{(m)}(x), \\ E[X\_5^n] &=& \frac{d^n}{dz^n} \left\{ \left(\frac{2z}{\varepsilon^z + 1}\right)^m e^{xz} \right\} \Big|\_{z=0} = G\_n^{(m)}(x). \end{array}$$

Another interpretation is the next example. Let *X* be a discrete random variable on (<sup>Ω</sup>, F, *<sup>P</sup>*). Then, we can define a probability distribution for *X* by

$$P(X=k) = \frac{\binom{n}{k} B\_k^{(r,m)}}{B\_n^{(r,m)}(1)}, \qquad k = 0, 1, \dots, n.$$

Note that

$$\sum\_{k=0}^{n} P(X=k) = \frac{\sum\_{k=0}^{n} \binom{n}{k} B\_k^{(r,m)}}{B\_n^{(r,m)}(1)} = \frac{B\_n^{(r,m)}(1)}{B\_n^{(r,m)}(1)} = 1.1$$

Next, replacing *k* by *n* − *k* in the identity

$$\sum\_{k=0}^{n} \binom{n}{k} B\_k^{(r,m)} \mathfrak{a}^{n-k} = B\_n^{(r,m)}(\mathfrak{x})$$

we ge<sup>t</sup>

$$\sum\_{k=0}^{n} \binom{n}{k} B\_{n-k}^{(r,m)} \mathbf{x}^k = B\_n^{(r,m)}(\mathbf{x}),$$

which, upon differentiating with respect to *x*, yields

$$\sum\_{k=0}^{n} k \binom{n}{k} B\_{n-k}^{(r,m)} x^{k-1} = n B\_{n-1}^{(r,m)}(x).$$

Inserting *x* = 1 gives

$$\sum\_{k=0}^{n} k \binom{n}{k} B\_{n-k}^{(r,m)} = n B\_{n-1}^{(r,m)}(1),$$

which shows that

$$E[X] = nB\_{n-1}^{(r,m)}(1).$$

In an analogous fashion, the quantity *<sup>A</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*) 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 *<sup>B</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*) and *<sup>A</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*), 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 <sup>B</sup>(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*; *λ*) associated with the complex parameter *λ* = 0, which are defined by the generating function

$$\mathfrak{B}(r, m; \mathfrak{x}, z; \lambda) = \left(\frac{z^r}{\lambda e^z - 1}\right)^m e^{\mathfrak{x}z} = \sum\_{n=0}^\infty \mathfrak{B}\_n^{(r, m)}(\mathfrak{x}; \lambda) \frac{z^n}{n!}$$

.

Then, it is fairly easy to identify the relations *<sup>B</sup>*(*<sup>r</sup>*, *m*; *x*, *z*) = <sup>B</sup>(*<sup>r</sup>*, *m*; *x*, *z*; 1) and *<sup>A</sup>*(*<sup>r</sup>*, *m*; *x*, *<sup>z</sup>*)=(−<sup>2</sup>)*<sup>m</sup>*B(*<sup>r</sup>*, *m*; *x*, *z*; <sup>−</sup><sup>1</sup>). Therefore, by means of <sup>B</sup>(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*; *λ*) it is possible to discuss both *<sup>B</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*) and *<sup>A</sup>*(*<sup>r</sup>*,*<sup>m</sup>*) *n* (*x*), at once.

**Author Contributions:** Conceptualization, R.F. and Ž.T.; Methodology, R.F. and Ž.T.; validation, R.F. and Ž.T.; formal analysis, R.F. and Ž.T.; writing—original draft preparation, R.F.; writing—review and editing, R.F. and Ž.T.; supervision, R.F. and Ž.T. All authors have read and agreed to the published version of the manuscript.

**Funding:** Ž.T. was supported of the Department of Mathematics, Faculty of Sciences, University of Ostrava.

**Conflicts of Interest:** The authors declare no conflict of interest.
