A note on degenerate poly-Genocchi numbers and polynomials

Abstract

Recently, some mathematicians have been studying a lot of degenerate versions of special polynomials and numbers in some arithmetic and combinatorial aspects. Our research is also interested in this field. In this paper, we introduce a new type of the degenerate poly-Genocchi polynomials and numbers, based on Kim and Kim’s (J. Math. Anal. Appl. 487(2):124017, 2020) modified polyexponential function. The paper is divided into two parts. In Sect. 2, we consider a new type of the degenerate poly-Genocchi polynomials and numbers constructed from the modified polyexponential function. We also show several combinatorial identities related to the degenerate poly-Genocchi polynomials and numbers. Some of them include the degenerate and other special polynomials and numbers such as the Stirling numbers of the first kind, the degenerate Stirling numbers of the second kind, degenerate Euler polynomials, degenerate Bernoulli polynomials and Bernoulli numbers of order α, etc. In Sect. 3, we also introduce the degenerate unipoly Genocchi polynomials attached to an arithmetic function by using the degenerate polylogarithm function. We give some new explicit expressions and identities related to degenerate unipoly Genocchi polynomials and special numbers and polynomials.

1 Introduction

The study of degenerate versions of some special polynomials and numbers, namely degenerate Bernoulli and Euler polynomials and numbers, was initiated by Carlitz [2]. Since then, many mathematicians have been studying degenerate versions of special polynomials and numbers such as Bernoulli, Euler, and Genocchi polynomials and numbers [1, 3–14]. Recently, Kim et al. studied polynomials and numbers mentioned above in terms of Jindalrae and Gaenari numbers and polynomials, discrete harmonic numbers and polynomials [15, 16]. In particular, Genocchi numbers have been extensively studied in many different contexts in such branches of mathematics as, for instance, elementary number theory, complex analytic number theory, differential topology (differential structures on spheres), theory of modular forms (Eisenstein series), p-adic analytic number theory (p-adic L-functions), and quantum physics (quantum groups). The works of Genocchi numbers and their combinatorial relations have received much attention [13, 17–20]. In the paper, we focus on a new type of degenerate poly-Genocchi polynomial and numbers.

As is well known, the Bernoulli polynomials of order $\alpha\in\mathbb {R}$ are defined by means of the following generating function:

$$ \biggl( \frac{t}{e^{t}-1} \biggr)^{\alpha}e^{xt} =\sum_{n=0}^{\infty}B_{n}^{(\alpha)} (x) \frac{t^{n}}{n!} \quad \bigl(\text{see [3, 4, 6, 21]}\bigr). $$

(1)

We note that, for $\alpha=1$, $B_{n}(x)=B_{n}^{(1)}(x)$ are the ordinary Bernoulli polynomials.

When $x=0$, $B_{n}^{( \alpha)}=B_{n}^{(\alpha)}(0)$ are called the Bernoulli numbers of order α.

The Euler polynomials are defined by

$$ \frac{2}{e^{t}+1} e^{xt} = \sum _{n=0}^{\infty} E_{n} (x) \frac {t^{n}}{n!} \quad\bigl(\text{see [2, 5]}\bigr). $$

(2)

When $x=0$, $E_{n} = E_{n}(0)$ are called the Euler numbers.

The Genocchi polynomials $G_{n}(x)$ are defined by

$$ \frac{2t}{e^{t}+1} e^{xt} =\sum _{n=0}^{\infty}G_{n}(x) \frac{t^{n}}{n!} \quad \bigl(\text{see [13, 14, 17]}\bigr). $$

(3)

When $x=0$, $G_{n} =G_{n}(0)$ are called the Genocchi numbers.

The degenerate poly-Bernoulli polynomials are defined by using the polyexponential functions (see [11]) and they are reduced to the degenerate Bernoulli polynomials if $k = 1$. The poly-exponential functions were first studied by Hardy [22] and reconsidered by Kim and Kim [1, 9, 10] in the view of an inverse to the polylogarithm functions which were studied by Jaonquière [23], Lewis [24], and Zagier [25]. In 1997, Kaneko [21] introduced poly-Bernoulli numbers which are defined by the polylogarithm function.

Recently, Kim and Kim [1] introduced the modified polyexponential function as follows:

$$ \operatorname{Ei}_{k}(x)=\sum _{n=1}^{\infty}\frac{x^{n}}{(n-1)!n^{k}} \quad(k\in \mathbb{Z}). $$

(4)

By using these functions, they also defined type 2 poly-Bernoulli and type 2 unipoly-Bernoulli polynomials and obtained several interesting properties of them (see [9]).

Kim et al. [10] introduced poly-Genocchi polynomials arising from the modified polyexponential function as follows:

$$ \frac{2 \operatorname{Ei}_{k}(\log(1+t))}{e^{t}+1} e^{xt} = \sum _{n=0}^{\infty } G_{n}^{(k)}(x) \frac{t^{n}}{n!}. $$

(5)

When $x=0$, $G_{n}^{(k)} = G_{n}^{(k)}(0)$ are called the poly-Genocchi numbers. Note that $G_{n}(x) = G_{n}^{(1)}(x)$ ($n \geq0$) are the Genocchi polynomials.

The degenerate exponential functions are defined as follows:

$$ e_{\lambda}^{x}(t)=(1+\lambda t)^{\frac{x}{\lambda}},\qquad e_{\lambda }(t)=e_{\lambda}^{1}(t)=(1+ \lambda t)^{\frac{1}{\lambda}} \quad\bigl(\text{see [1, 8--12]}\bigr). $$

(6)

Here, we note that

$$ e_{\lambda}^{x}(t)=\sum _{n=0}^{\infty} (x)_{n,\lambda} \frac{t^{n}}{n!} \quad\bigl(\text{see [10, 12]}\bigr), $$

(7)

where $(x)_{0,\lambda} =1$, $(x)_{n,\lambda} = x (x-\lambda) (x-2 \lambda) \cdots(x- (n-1) \lambda)$ ($n \geq1$).

In [2], Carlitz introduced the degenerate Bernoulli polynomials and the degenerate Euler polynomials respectively given by

$$ \frac{t}{e_{\lambda}(t)-1} e_{\lambda}^{x}(t) = \sum_{n=0}^{\infty} B_{n,\lambda}(x) \frac{t^{n}}{n!}, \qquad\frac{2}{e_{\lambda}(t)+1} e_{\lambda}^{x}(t) = \sum_{n=0}^{\infty} E_{n,\lambda}(x) \frac{t^{n}}{n!}. $$

(8)

When $x=0$, then $B_{n,\lambda} = B_{n,\lambda}(0)$ and $E_{n,\lambda} = E_{n,\lambda}(0)$ are called the degenerate Bernoulli numbers and the degenerate Euler numbers, respectively.

Kim et al. [10] considered the degenerate poly-Bernoulli polynomials as follows:

$$ \frac{\operatorname{Ei}_{k}(\log(1+t))}{e_{\lambda}(t)-1} e_{\lambda}^{x}(t) = \sum_{n=0}^{\infty} \beta^{(k)}_{n,\lambda}(x) \frac{t^{n}}{n!} . $$

(9)

When $x=0$, $\beta^{(k)}_{n,\lambda}=\beta^{(k)}_{n,\lambda}(0)$ are called the degenerate poly-Bernoulli numbers.

Note that $\lim_{\lambda\rightarrow0} \beta^{(1)}_{n,\lambda}(x) = B_{n}(x)$ ($n \geq0$), where $B_{n}(x)$ are the ordinary Bernoulli polynomials given by

$$ \frac{t}{e^{t} - 1} e^{xt} = \sum _{n=0}^{\infty} B_{n}(x) \frac {t^{n}}{n!}\quad \bigl(\text{see [2--4, 26]}\bigr) . $$

(10)

In [5], Kim et al. considered the degenerate Genocchi polynomials given by

$$ \frac{2t}{e_{\lambda}(t)+1} e_{\lambda}^{x}(t) = \sum_{n=0}^{\infty} G_{n,\lambda}(x) \frac{t^{n}}{n!}. $$

(11)

When $x=0$, $G_{n,\lambda} = G_{n,\lambda}(0)$ are called the degenerate Genocchi numbers.

For $n\geq0$, the Stirling numbers of the first kind are defined by

$$ (x)_{n} =\sum_{l=0}^{n} S_{1}(n,l) x^{l} \quad \bigl(\text{see [9, 10, 24]}\bigr), $$

(12)

where $(x)_{0}=1$, $(x)_{n}=x(x-1)\cdots(x-n+1)$ ($n\geq1$).

From (12), it is easy to see that

$$ \frac{1}{k!} \bigl(\log(1+t)\bigr)^{k} = \sum_{n=k}^{\infty}S_{1}(n,k) \frac{t^{n}}{n!}. $$

(13)

In the inverse expression to (12), for $n\geq0$, the Stirling numbers of the second kind are defined by

$$ x^{n} =\sum_{l=0}^{n} S_{2}(n,l) (x)_{l} . $$

(14)

From (14), it is easy to see that

$$ \frac{1}{k!} \bigl(e^{t} -1 \bigr)^{k} =\sum_{n=k}^{\infty}S_{2}(n,k)\frac{t^{n}}{n!}. $$

(15)

Recently, Kim and Kim [6] introduced the degenerate Stirling numbers of the second kind as follows:

$$ (x)_{n,\lambda}=\sum_{l=0}^{n}S_{2,\lambda}(n,l) (x)_{l}\quad(n\ge0). $$

(16)

As an inversion formula of (16), the degenerate Stirling numbers of the first kind are defined by

$$ (x)_{n}=\sum_{l=0}^{n}S_{1,\lambda}(n,l) (x)_{l,\lambda}\quad(n\ge0)\ \bigl(\mbox{see [6]}\bigr). $$

(17)

From (16) and (17), Kim and Kim observed that

$$ \frac{1}{k!} \bigl(e_{\lambda}(t)-1 \bigr)^{k}=\sum_{n=k}^{\infty }S_{2,\lambda}(n,k) \frac{t^{n}}{n!}\quad\bigl(\mbox{see [6]}\bigr). $$

(18)

The paper is divided into two parts. In Sect. 2, we define a new type of the degenerate poly-Genocchi polynomials and numbers constructed from the modified polyexponential function. We also show several combinatorial identities related to the degenerate poly-Genocchi polynomials and numbers. Some of them include the degenerate and other special polynomials and numbers such as the Stirling numbers of the first kind, the degenerate Stirling numbers of the second kind, degenerate Euler polynomials, degenerate Bernoulli polynomials and Bernoulli numbers of order α, etc. In Sect. 3, we also introduce the degenerate unipoly Genocchi polynomials attached to an arithmetic function, by using the degenerate polylogarithm function. We give some new explicit expressions and identities related to degenerate unipoly Genocchi polynomials and special numbers and polynomials.

2 Degenerate poly-Genocchi numbers and polynomials

In this section, we consider the poly-Genocchi polynomials and the degenerate poly-Genocchi polynomials respectively as follows:

$$ \frac{ \operatorname{Ei}_{k}(\log(1+2t))}{e^{t}+1} e^{xt} = \sum _{n=0}^{\infty } G_{n}^{(k)}(x) \frac{t^{n}}{n!}, $$

(19)

and

$$ \frac{\mathrm{Ei}_{k}(\log(1+2t))}{e_{\lambda}(t)+1}e_{\lambda}^{x}(t)=\sum_{n=0}^{\infty}G_{n,\lambda}^{(k)}(x)\frac{t^{n}}{n!}. $$

(20)

When $x=0$, $G_{n}^{(k)}=G_{n}^{(k)}(0)$ are called the poly-Genocchi numbers.

It is easy to show that $G_{n}(x) = G_{n}^{(1)}(x)$ ($n \geq0$) are the Genocchi polynomials because of

$$\begin{aligned}& \operatorname{Ei}_{1}\bigl(\log(1+2t)\bigr) = 2t. \end{aligned}$$

When $x=0$, $G_{n,\lambda}^{(k)}=G_{n,\lambda}^{(k)}(0)$ are called the degenerate poly-Genocchi numbers.

It is easy to show that $G_{n,\lambda}(x) = G_{n,\lambda}^{(1)}(x)$ ($n \geq0$) are the degenerate Genocchi polynomials.

Theorem 1

For$n\geq0$, $k\in\mathbb{Z}$, we have

$$ \begin{aligned} &G_{n,\lambda}^{(k)}(x)= \sum_{l=0}^{n-1}{n-1 \choose l} 2^{l} (1)_{n-l,\lambda} \beta_{l,\frac{\lambda}{2}}^{(k)} \biggl(\frac{x}{2}\biggr), \\ &G_{0,\lambda}^{(k)}(x)=0. \end{aligned} $$

(21)

Proof

From (6) and (9), we observe that

$$ \begin{aligned}[b] \sum_{n=0}^{\infty} G_{n,\lambda}^{(k)}(x)\frac{t^{n}}{n!} &= \frac {\operatorname{Ei}_{k}(\log(1+2t))}{e_{\lambda}(t)+1}e_{\lambda}^{x}(t) \\ & = \frac{\operatorname{Ei}_{k}(\log(1+2t))}{(e_{\lambda}(t)+1)(e_{\lambda }(t)-1)}\bigl(e_{\lambda}(t)-1\bigr)e_{\lambda}^{x}(t) \\ & = \frac{\operatorname{Ei}_{k}(\log(1+2t))}{(e_{\frac{\lambda}{2}}(2t)-1)} e_{\lambda }^{x}(t) \Biggl( \sum _{m=1}^{\infty}(1)_{m,\lambda} \frac {t^{m}}{m!}\Biggr) \\ & = \Biggl( \sum_{l=0}^{\infty} \beta^{(k)}_{l,\frac{\lambda}{2}}\biggl(\frac {x}{2}\biggr) \frac{2^{l}t^{l}}{l!} \Biggr) \Biggl( \sum_{m=1}^{\infty }(1)_{m,\lambda} \frac{t^{m}}{m!}\Biggr) \\ & = \sum_{n=1}^{\infty} \Biggl( \sum _{l=0}^{n-1}{n-1 \choose l} 2^{l} (1)_{n-l,\lambda}\beta_{l,\frac{\lambda}{2}}^{(k)} \biggl(\frac{x}{2}\biggr) \Biggr)\frac{t^{n}}{n!}. \end{aligned} $$

(22)

Therefore, by comparing the coefficients on both sides of (22), we get the desired result. □

When $x=0$, we have

$$ \begin{aligned} G_{n,\lambda}^{(k)}= \sum_{l=0}^{n-1}{n-1 \choose l} 2^{l} (1)_{n-l,\lambda} \beta_{l,\frac{\lambda}{2}}^{(k)}. \end{aligned} $$

(23)

Theorem 2

For$n\geq0$, we get

$$ \begin{aligned} &G_{n,\lambda}^{(k)}(x)= \sum_{j=1}^{n}\sum _{m=1}^{j}{n \choose j} \frac {2^{j-1}}{m^{k-1}}S_{1}(j,m)E_{n-m,\lambda}(x), \\ &G_{0,\lambda}^{(k)}=0. \end{aligned} $$

(24)

Proof

By using (4) and (8), we get

$$\begin{aligned} \sum_{n=0}^{\infty}G_{n,\lambda}^{(k)}(x) \frac{t^{n}}{n!}& =\frac {1}{(e_{\lambda}(t)+1)}\operatorname{Ei}_{k}\bigl(\log(1+2t) \bigr)e_{\lambda}^{x}(t) \\ & = \frac{1}{2} \Biggl(\sum_{l=0}^{\infty}E_{l,\lambda}(x) \frac {t^{l}}{l!} \Biggr) \Biggl(\sum_{m=1}^{\infty}\frac {(\log(1+2t))^{m}}{(m-1)!m^{k}} \Biggr) \\ & = \frac{1}{2} \Biggl(\sum_{l=0}^{\infty}E_{l,\lambda}(x) \frac {t^{l}}{l!} \Biggr) \Biggl(\sum_{m=1}^{\infty} \frac{1}{m^{k-1}}\sum_{j=m}^{\infty}S_{1}(j,m) \frac{2^{j}t^{j}}{j!} \Biggr) \\ & = \frac{1}{2} \Biggl(\sum_{l=0}^{\infty}E_{l,\lambda}(x) \frac {t^{l}}{l!} \Biggr) \Biggl(\sum_{j=1}^{\infty} \sum_{m=1}^{j}2^{j} \frac {1}{m^{k-1}}S_{1}(j,m)\frac{t^{j}}{j!} \Biggr) \\ & = \sum_{n=1}^{\infty} \Biggl( \sum _{j=1}^{n}\sum _{m=1}^{j}{n \choose j}2^{j-1} \frac{1}{m^{k-1}}S_{1}(j,m)E_{n-m,\lambda}(x)\Biggr) \frac {t^{n}}{n!}. \end{aligned}$$

(25)

Therefore, by comparing the coefficients on both sides of (25), we get the result that we wanted. □

Theorem 3

For$n\geq0$, we have

$$ \begin{aligned} G_{n,\lambda}^{(k)}(x)= \sum_{l=0}^{n}\sum _{m=1}^{l+1}{n \choose l}2^{l} \frac{1}{(l+1)m^{k-1}}S_{1}(l+1,m)G_{n-l,\lambda}(x). \end{aligned} $$

(26)

Proof

From (13) and (19), we observe that

$$ \begin{aligned}[b] \sum_{n=0}^{\infty} G_{n,\lambda}^{(k)}(x)\frac{t^{n}}{n!}& = \frac {\operatorname{Ei}_{k}(\log(1+2t))}{e_{\lambda}(t)+1}e_{\lambda}^{x}(t) \\ & = \frac{2t}{e_{\lambda}(t)+1}e_{\lambda}^{x}(t)\cdot \frac {1}{2t}\operatorname{Ei}_{k}\bigl(\log(1+2t)\bigr) \\ &= \frac{2t}{e_{\lambda}(t)+1}e_{\lambda}^{x}(t)\cdot \frac{1}{2t} \Biggl(\sum_{l=1}^{\infty} \sum_{m=1}^{l}2^{l} \frac{1}{m^{k-1}}S_{1}(l,m)\frac {t^{l}}{l!} \Biggr) \\ & = \sum_{j=0}^{\infty}G_{j,\lambda}(x) \frac{t^{j}}{j!}\frac{1}{2t} \Biggl(\sum _{l=0}^{\infty}\sum_{m=1}^{l+1}2^{l+1} \frac {1}{m^{k-1}}S_{1}(l+1,m)\frac{t^{l+1}}{(l+1)!} \Biggr) \\ & = \sum_{j=0}^{\infty}G_{j,\lambda}(x) \frac{t^{j}}{j!} \Biggl(\sum_{l=0}^{\infty} \sum_{m=1}^{l+1}2^{l} \frac {1}{(l+1)m^{k-1}}S_{1}(l+1,m)\frac{t^{l}}{l!} \Biggr) \\ & = \sum_{n=0}^{\infty} \Biggl(\sum _{l=0}^{n}\sum _{m=1}^{l+1}{n \choose l}2^{l} \frac{1}{(l+1)m^{k-1}}S_{1}(l+1,m)G_{n-l,\lambda}(x) \Biggr) \frac {t^{n}}{n!}. \end{aligned} $$

(27)

Therefore, by comparing the coefficients on both sides of (27), we get the desired result. □

For the next theorem, we need the following well-known identity:

$$ \begin{aligned} \biggl(\frac{t}{\log(1+t)} \biggr)^{r} (1+t)^{x-1}=\sum_{\alpha=0}^{\infty }B^{(\alpha-r+1)}_{\alpha}(x) \frac{t^{\alpha}}{\alpha!}, \end{aligned} $$

(28)

where $B_{\alpha}^{(\alpha)}(x)$ is the Bernoulli polynomials of order α in (1).

Theorem 4

For$n\ge0$, $k \in\mathbb{Z}$, we get

$$ \begin{aligned}[b] G_{n,\lambda}^{(k)}&= \sum_{m=0}^{n} \binom{n}{m} 2^{m} \sum_{m_{1}+\cdots +m_{k-1}=m}\binom{m}{m_{1},\ldots,m_{k-1}} \\ & \quad\times\frac{B^{(m_{1})}_{m_{1}}}{m_{1}+1}\frac {B^{(m_{2})}_{m_{2}}}{m_{1}+m_{2}+1} \cdots \frac {B^{(m_{k-1})}_{m_{k-1}}}{m_{1}+\cdots+m_{k-1}+1}G_{n-l,\lambda}\frac {x^{n}}{n!}, \end{aligned} $$

(29)

where$B_{m}^{(m)}$is the Bernoulli numbers of ordermat$x=o$.

Proof

First, we note that

$$ \begin{aligned}[b] \frac{d}{dx}\operatorname{Ei}_{k} \bigl(\log(1+2x)\bigr)& =\frac{d}{dx}\sum_{n=1}^{\infty} \frac {(\log(1+2x))^{n}}{(n-1)!n^{k}}\\&= \frac{2}{1+2x}\sum_{n=1}^{\infty} \frac {n(\log(1+2x))^{n-1}}{(n-1)!n^{k}} \\ & = \frac{2}{(1+2x)\log(1+2x)}\sum_{n=1}^{\infty} \frac {(\log(1+2x))^{n}}{(n-1)!n^{k-1}} \\ & = \frac{2}{(1+2x)\log(1+2x)}\operatorname{Ei}_{k-1}\bigl(\log(1+2x)\bigr)\,dt. \end{aligned} $$

(30)

From (28) and (30), we obtain the following equation:

$$ \begin{aligned}[b] &\operatorname{Ei}_{k}\bigl(\log(1+2x) \bigr) \\ &\quad= \int_{0}^{x}\frac{2}{(1+2t)\log(1+2t)} \\ &\quad \quad\times \int_{0}^{t}\underbrace{\frac{2}{(1+2t)\log(1+2t)} \cdots \int _{0}^{t}\frac{2}{(1+2t)\log(1+2t)} \int_{0}^{2t}}_{(k-2)\text{-times}} \frac{2 \operatorname{Ei}_{1}(\log(1+2t))}{(1+2t)\log(1+2t)} \,dt \cdots dt \\ &\quad= \int_{0}^{x}\frac{2}{(1+2t)\log(1+2t)} \\ &\quad \quad\times \int_{0}^{t}\underbrace{\frac{2}{(1+2t)\log(1+2t)} \cdots \int_{0}^{t}\frac{2}{(1+2t)\log(1+2t)} \int_{0}^{2t}}_{(k-2)\text{-times}} \frac{4t}{(1+2t)\log(1+2t)}\,dt \cdots dt \\ &\quad=2x \sum_{m=0}^{\infty} 2^{m} \sum_{m_{1}+\cdots+m_{k-1}=m}\binom {m}{m_{1},\ldots,m_{k-1}} \\ &\quad \quad\times\frac{B^{(m_{1})}_{m_{1}}}{m_{1}+1}\frac {B^{(m_{2})}_{m_{2}}}{m_{1}+m_{2}+1} \cdots \frac {B^{(m_{k-1})}_{m_{k-1}}}{m_{1}+\cdots+m_{k-1}+1}\frac{x^{m}}{m!}. \end{aligned} $$

(31)

From equation (31), we observe that

$$\begin{aligned} \sum_{n=0}^{\infty}G_{n,\lambda}^{(k)} \frac{t^{n}}{n!}& = \frac {1}{e_{\lambda}(t)+1}\operatorname{Ei}_{k}\bigl(\log(1+2t) \bigr) \\ &=\frac{2t}{e_{\lambda}(t)+1} \sum_{m=0}^{\infty} 2^{m} \sum_{m_{1}+\cdots +m_{k-1}=m}\binom{m}{m_{1},\ldots,m_{k-1}} \\ & \quad\times\frac{B^{(m_{1})}_{m_{1}}}{m_{1}+1}\frac {B^{(m_{2})}_{m_{2}}}{m_{1}+m_{2}+1} \cdots \frac {B^{(m_{k-1})}_{m_{k-1}}}{m_{1}+\cdots+m_{k-1}+1}\frac{t^{m}}{m!} \\ &= \Biggl(\sum_{l=0}^{\infty}G_{l,\lambda} \frac{t^{l}}{l!} \Biggr)\sum_{m=0}^{\infty} 2^{m} \sum_{m_{1}+\cdots+m_{k-1}=m}\binom{m}{m_{1},\ldots ,m_{k-1}} \\ & \quad\times\frac{B^{(m_{1})}_{m_{1}}}{m_{1}+1}\frac {B^{(m_{2})}_{m_{2}}}{m_{1}+m_{2}+1} \cdots \frac {B^{(m_{k-1})}_{m_{k-1}}}{m_{1}+\cdots+m_{k-1}+1}\frac{t^{m}}{m!} \\ &=\sum_{n=0}^{\infty}\sum _{m=0}^{n} \binom{n}{m} 2^{m} \sum_{m_{1}+\cdots +m_{k-1}=m}\binom{m}{m_{1},\ldots,m_{k-1}} \\ & \quad\times\frac{B^{(m_{1})}_{m_{1}}}{m_{1}+1}\frac {B^{(m_{2})}_{m_{2}}}{m_{1}+m_{2}+1} \cdots \frac {B^{(m_{k-1})}_{m_{k-1}}}{m_{1}+\cdots+m_{k-1}+1}G_{n-l,\lambda}\frac {t^{n}}{n!}. \end{aligned}$$

(32)

Therefore, by comparing the coefficients on both sides of (32), we get the desired result. □

Corollary 5

For$k=2$, we have

$$ \begin{aligned} G_{n,\lambda}^{(2)} = \sum_{l=0}^{n}\binom{n}{l} 2^{l} \frac {B^{(l)}_{l+1}}{l+1} G_{n-l,\lambda}. \end{aligned} $$

(33)

Theorem 6

For$n\ge0$, $k \in\mathbb{Z}$, we get

$$ \begin{aligned} G_{n,\lambda}^{(k)}(x)= \sum_{l=0}^{n}\binom{n}{l}(x)_{n-l,\lambda }G_{l,\lambda}^{(k)}. \end{aligned} $$

(34)

Proof

From (7) and (19), we note that

$$ \begin{aligned}[b] \sum_{n=0}^{\infty}G_{n,\lambda}^{(k)}(x) \frac{t^{n}}{n!} &= \frac {\operatorname{Ei}_{k}(\log(1+2t))}{e_{\lambda}(t)+1}e_{\lambda}^{x}(t) \\ &= \sum_{l=0}^{\infty}G_{l,\lambda}^{(k)} \frac{t^{l}}{l!}\sum_{m=0}^{\infty}(x)_{m,\lambda} \frac{t^{m}}{m!} \\ &= \sum_{n=0}^{\infty} \Biggl(\sum _{l=0}^{n}\binom{n}{l}(x)_{n-l,\lambda }G_{l,\lambda}^{(k)} \Biggr)\frac{t^{n}}{n!}. \end{aligned} $$

(35)

Therefore, by comparing the coefficients on both sides of (35), we obtain the desired result. □

Theorem 7

For$n\ge1$, $k \in\mathbb{Z}$, we have

$$ \begin{aligned} G_{n-1,\lambda}^{(k)}(1)+G^{(k)}_{n-1,\lambda}= \sum_{m=1} ^{n} \frac {2^{n}S_{1}(n,m)}{m^{k-1}}. \end{aligned} $$

(36)

Moreover, when$k=1$,

$$ \begin{aligned} G_{n-1,\lambda}(1)+G_{n-1,\lambda}= \sum_{m=1} ^{n} 2^{n}S_{1}(n,m). \end{aligned} $$

(37)

Proof

By using (6) and Theorem 6,

$$\begin{aligned} \operatorname{Ei}_{k}\bigl(\log(1+2t) \bigr)&=\bigl(e_{\lambda}(t)+1\bigr) \frac{\operatorname{Ei}_{k}(\log(1+2t))}{e_{\lambda }(t)+1} \\ &= \Biggl(\sum_{l=0}^{\infty}(1)_{m,\lambda} \frac{t^{m}}{m!}\sum_{l=0}^{\infty}G_{l,\lambda}^{(k)}\frac{t^{l}}{l!} \Biggr) + \sum _{n=0}^{\infty}G_{n,\lambda}^{(k)} \frac{t^{n}}{n!} \\ &=\sum_{n=0}^{\infty}\Biggl( \sum _{m=0} ^{n} {n \choose m }(1)_{n-m,\lambda }G_{m,\lambda}^{(k)}+G_{n,\lambda}^{(k)} \Biggr)\frac{t^{n}}{n!} \\&=\sum_{n=1}^{\infty}\bigl( G_{n-1,\lambda}^{(k)}(1)+G^{(k)}_{n-1,\lambda} \bigr)\frac{t^{n}}{n!}. \end{aligned}$$

(38)

On the other hand,

$$ \begin{aligned}[b]\operatorname{Ei}_{k}\bigl(\log(1+2t) \bigr)&=\sum_{m=1}^{\infty} \frac{(\log (1+2t))^{m}}{(m-1)!m^{k}} \\ &=\sum_{m=1}^{\infty}\sum _{n=m}^{\infty}\frac{1}{m^{k-1}}S_{1}(n,m) \frac {2^{n}t^{n}}{n!}=\sum_{n=1}^{\infty} \sum_{m=1}^{n} \frac{2^{n} }{m^{k-1}}S_{1}(n,m) \frac{t^{n}}{n!}. \end{aligned} $$

(39)

Now, by comparing the coefficients of (38) and (39), we get what we wanted. □

Theorem 8

For$n\ge1$, $k=1$, we have

$$ \begin{aligned} \sum_{m=1}^{n} 2^{n} S_{1}(n,m)= 2 \delta_{n,1}, \end{aligned} $$

(40)

where$\delta_{n,k}$is the Kronecker delta.

Proof

From (39), we obtain

$$ \begin{aligned} \operatorname{Ei}_{1}\bigl(\log(1+2t) \bigr)= 2t = \sum_{n=1}^{\infty} \sum _{m=1}^{n} 2^{n} S_{1}(n,m)\frac{t^{n}}{n!}. \end{aligned} $$

(41)

Hence, by comparing the coefficients of (41), we get the desired result. □

Corollary 9

For$n\geq1$, $k =1$, we have

$$ \begin{aligned} G_{n-1,\lambda}(1)+G_{n-1,\lambda}= \left \{ \textstyle\begin{array}{l@{\quad}l} 2, & \textit{if }n=1, \\ 0, & \textit{otherwise.} \end{array}\displaystyle \right . \end{aligned} $$

(42)

Theorem 10

For$n\ge0$, $k \in\mathbb{Z}$, we get

$$ \begin{aligned} G_{n,\lambda}^{(k)}(x)= \sum_{l=0}^{n}\sum _{m=0}^{l} \binom{n}{l} (x)_{m} S_{2,\lambda}(m,l)G^{(k)}_{n-l,\lambda}. \end{aligned} $$

(43)

Proof

By using (21), we get

$$\begin{aligned} \sum_{n=0}^{\infty}G_{n,\lambda}^{(k)}(x) \frac{t^{n}}{n!}& = \frac {\operatorname{Ei}_{k}(\log(1+2t))}{e_{\lambda}(t)+1}e_{\lambda}^{x}(t) \\ &=\frac{\operatorname{Ei}_{k}(\log(1+2t))}{e_{\lambda}(t)+1} (e_{\lambda}-1+1)^{x} \\ &=\frac{\operatorname{Ei}_{k}(\log(1+2t))}{e_{\lambda}(t)+1} \Biggl(\sum_{m=0}^{\infty} {x \choose m }\bigl(e_{\lambda}(t)-1\bigr)^{m} \Biggr) \\ &=\frac{\operatorname{Ei}_{k}(\log(1+2t))}{e_{\lambda}(t)+1} \Biggl(\sum_{m=0}^{\infty} (x)_{m} \frac{(e_{\lambda}(t)-1)^{m}}{m!} \Biggr) \\ &= \Biggl( \sum_{i=0}^{\infty}G^{(k)}_{i,\lambda} \frac{x^{i}}{i!} \Biggr) \Biggl(\sum_{l=0}^{\infty} \sum_{m=0}^{l} (x)_{m} S_{2,\lambda}(m,l) \frac {t^{m}}{m!} \Biggr) \\ &=\sum_{n=0}^{\infty} \Biggl(\sum _{l=0}^{n}\sum_{m=0}^{l} \binom{n}{l} (x)_{m} S_{2,\lambda}(m,l)G^{(k)}_{n-l,\lambda} \Biggr)\frac{t^{n}}{n!}. \end{aligned}$$

(44)

Now, by comparing the coefficients of (44), we get what we wanted. □

3 The unipoly Genocchi polynomials and numbers

Let p be any arithmetic function which is real- or complex-valued function defined on the set of positive integers $\mathbb{N}$. Then Kim and Kim [27] defined the unipoly function attached to polynomials $p(x)$ by

$$\begin{aligned} u_{k}(x|p) = \sum_{n=1}^{\infty}\frac{p(n) x^{n}}{n^{k}}\quad (k\in\mathbb{Z}). \end{aligned}$$

(45)

Moreover,

$$\begin{aligned} u_{k}(x|1)=\sum_{n=1}^{\infty}\frac{x^{n}}{n^{k}} =\operatorname{Li}_{k}(x) \end{aligned}$$

(46)

is the ordinary polylogarithm function, and for $k\geq2$,

$$\begin{aligned} \frac{d}{dx}u_{k}(x|p) = \frac{1}{x} u_{k-1}(x|p) \end{aligned}$$

(47)

and

$$\begin{aligned} u_{k}(x|p)= \int_{0}^{x} \frac{1}{t} \underbrace{ \int_{0}^{t} \frac{1}{t} \cdots \int_{0}^{t} }_{(k-2)\text{-times} } \frac{1}{t} u_{1}(t|p) \,dt \,dt\cdots dt. \end{aligned}$$

(48)

In [28], Dolgy and Jang introduced the unipoly Genocchi polynomials as follows:

$$\begin{aligned} \frac{2}{ e^{t}+1} u_{k}\bigl(\log(1+t)| p \bigr)e^{xt}=\sum_{n=0}^{\infty}G^{(k)}_{n, p}(x)\frac{t^{n}}{n!}. \end{aligned}$$

(49)

In this section, we define the degenerate unipoly Genocchi polynomial by

$$ \begin{aligned} \frac{u_{k}(\log(1+2t)|p)}{e_{\lambda}(t)+1} e_{\lambda}^{x}(t)= \sum_{n=0}^{\infty} G^{(k)}_{n,\lambda,p}(x)\frac{t^{n}}{n!}. \end{aligned} $$

(50)

When $x=0$, $G^{(k)}_{n,\lambda, p}= G^{(k)}_{n,\lambda, p}(0)$ is the degenerate unipoly Genocchi number.

When $p=1$, $G^{(k)}_{n,\lambda, 1}(x)= G^{(k)}_{n,\lambda}(x)$ is the degenerate poly-Genocchi polynomial of (19).

Theorem 11

Let$p(n)=\frac{1}{\varGamma(n)}$for$n \in\mathbb{N}\cup\{0\}$and$k\in\mathbb{Z}$, then we have

$$\begin{aligned} G^{(k)}_{n,\lambda,\frac{1}{\varGamma}}(x)= G_{n,\lambda}^{(k)}(x). \end{aligned}$$

(51)

Proof

Let $p(n)=\frac{1}{\varGamma(n)}=\frac{1}{(n-1)!}$. Then we have

$$ \begin{aligned} [b]\sum_{n=0}^{\infty}G^{(k)}_{n,\lambda,\frac{1}{\varGamma}}(x) \frac {t^{n}}{n!}&=\frac{u_{k}(\log(1+2t)|\frac{1}{\varGamma})}{e_{\lambda }(t)+1}e_{\lambda}^{x}(t) \\ &=\frac{\operatorname{Ei}_{k}(\log(1+2t))}{e_{\lambda}(t)+1}e_{\lambda}^{x}(t)=\sum _{n=0}^{\infty}G_{n,\lambda}^{(k)}(x) \frac{t^{n}}{n!}. \end{aligned} $$

(52)

Thus, we have what we wanted. □

Theorem 12

For$n\in\mathbb{N}\cup\{0\}$and$k\in \mathbb{Z}$, we have

$$ \begin{aligned} G^{(k)}_{n,\lambda,p}= \sum_{l=0}^{n}\sum _{m=0}^{l}{n \choose l} \frac {p(m+1)(m+1)!}{(m+1)^{k}}\frac{2^{l}}{l+1}S_{1}(l+1,m+1) G_{n-l,\lambda}. \end{aligned} $$

(53)

Proof

From (11) and (13), we have

$$ \begin{aligned}[b] \sum_{n=0}^{\infty}G^{(k)}_{n,\lambda,p} \frac{t^{n}}{n!}&=\frac {1}{e_{\lambda}(t)+1}\sum_{m=1}^{\infty} \frac {p(m)}{m^{k}}\bigl(\log(1+2t)\bigr)^{m} \\ &=\frac{1}{e_{\lambda}(t)+1}\sum_{m=0}^{\infty} \frac {p(m+1)(m+1)!}{(m+1)^{k}}\sum_{l=m+1}^{\infty}S_{1}(l,m+1) \frac {2^{l}t^{l}}{l!} \\ &=\frac{2t}{e_{\lambda}(t)+1}\sum_{m=0}^{\infty} \frac {p(m+1)(m+1)!}{(m+1)^{k}}\sum_{l=m}^{\infty}S_{1}(l+1,m+1) \frac {2^{l}t^{l}}{(l+1)!} \\ &= \Biggl(\sum_{j=0}^{\infty}G_{j,\lambda} \frac{t^{j}}{j!} \Biggr)\sum_{l=0}^{\infty} \Biggl(\sum_{m=0}^{l} \frac {p(m+1)(m+1)!}{(m+1)^{k}}S_{1}(l+1,m+1)\frac{2^{l}}{(l+1)} \Biggr) \frac {t^{l}}{l!} \\ &=\sum_{n=0}^{\infty} \Biggl(\sum _{l=0}^{n}\sum_{m=0}^{l} {n \choose l}\frac{p(m+1)(m+1)!}{(m+1)^{k}}\frac {2^{l}}{l+1}S_{1}(l+1,m+1)G_{n-l,\lambda} \Biggr)\frac{t^{n}}{n!}. \end{aligned} $$

(54)

Therefore, by comparing the coefficients on both sides of (54), we obtain the result of this theorem. □

Theorem 13

For$n\in\mathbb{N}\cup\{0\}$and$k\in \mathbb{Z}$, we have

$$ \begin{aligned} G_{n,\lambda,p}^{(k)}= \sum_{l=0}^{n}\sum _{m=0}^{l+1}{n \choose l+1} \frac{p(m+1)(m+1)!}{(m+1)^{k}}2^{l-1}S_{1}(l,m+1)E_{n-l,\lambda}. \end{aligned} $$

(55)

Proof

From (8) and (13), we have

$$ \begin{aligned}[b] &\frac{1}{e_{\lambda}(t)+1} \sum _{m=1}^{\infty}\frac {p(m)(\log(1+2t))^{m}}{m^{k} }\cdot \frac{m!}{m!} \\ &\quad=\frac{1}{ e_{\lambda}(t)+1}\sum_{m=0}^{\infty}\frac {p(m+1)(m+1)!}{(m+1)^{k}}\frac{(\log(1+2t))^{m+1}}{(m+1)!} \\ &\quad=\frac{1}{2} \Biggl(\sum_{j=0}^{\infty} E_{j,\lambda}\frac {t^{j}}{j!} \Biggr)\sum_{m=0}^{\infty}\frac{p(m+1)(m+1)!}{(m+1)^{k}}\sum_{l=m+1}^{\infty}S_{1}(l,m+1) \frac{2^{l}t^{l}}{l!} \\ &\quad=\frac{1}{2} \Biggl(\sum_{j=0}^{\infty} E_{j,\lambda}\frac {t^{j}}{j!} \Biggr) \sum _{l=0}^{\infty}\Biggl( \sum _{m=0}^{l+1}\frac {p(m+1)(m+1)!}{(m+1)^{k}}2^{l} S_{1}(l,m+1) \Biggr)\frac{t^{l}}{l!} \\ &\quad=\sum_{n=0}^{\infty} \Biggl(\sum _{l=0}^{n}\sum_{m=0}^{l+1} {n \choose l+1}\frac{p(m+1)(m+1)!}{(m+1)^{k}}2^{l-1}S_{1}(l,m+1)E_{n-l,\lambda } \Biggr)\frac{t^{n}}{n!}. \end{aligned} $$

(56)

Thus, by comparing the coefficients on both sides of (56), we obtain the desired theorem. □

Theorem 14

For$n\in\mathbb{N}\cup\{0\}$and$k\in \mathbb{Z}$, we have

$$ \begin{aligned} G_{n,\lambda,p}^{(k)}(x)= \sum_{\alpha=0}^{n} \sum _{l=0}^{\alpha} \sum_{m=1}^{l+1} {n \choose \alpha} {\alpha\choose l} (1)_{\alpha-1,\lambda} \frac{p(m)m!}{m^{k}}2^{n-\alpha +l}S_{1}(l+1,m)B_{n-\alpha,\frac{\lambda}{2}} \biggl(\frac{x}{2}\biggr). \end{aligned} $$

(57)

Proof

From (7), (8), and (13), we get

$$\begin{aligned} &\sum_{n=0}^{\infty}G_{n,\lambda, p}^{(k)}(x)\frac{t^{n}}{n!}\\&\quad=\frac{u_{k} (\log(1+2t) | p )}{ e_{\lambda}(t)+1} e_{\lambda}^{x}(t) \\ &\quad=\frac{1}{e_{\lambda}(t)+1}e_{\lambda}^{x}(t)\sum _{m=1}^{\infty} \frac {p(m)(\log(1+2t))^{m}}{m^{k}} \frac{m!}{m!} \\ &\quad=\frac{1}{e_{\lambda}(t)+1}e_{\lambda}^{x}(t)\sum _{m=1}^{\infty}\frac {p(m)m!}{m^{k}}\sum _{l=m}^{\infty}S_{1}(l,m) \frac{2^{l} t^{l}}{l!} \\ &\quad=\frac{e_{\lambda}^{x}(t)}{e_{\lambda}(t)+1} \frac{e_{\lambda }(t)-1}{e_{\lambda}(t)-1} \sum _{l=0}^{\infty}\sum _{m=1}^{l+1}\frac {p(m)m!}{m^{k}}S_{1}(l+1,m) \frac{2^{l+1}t^{l+1}}{l!} \\ &\quad=\frac{2t e_{\lambda}^{x}(t)}{e_{\frac{\lambda}{2}}(2t)-1}\bigl(e_{\lambda }(t)-1\bigr)\sum _{l=0}^{\infty}\sum_{m=1}^{l+1} \frac {p(m)m!}{m^{k}}S_{1}(l+1,m)\frac{2^{l}t^{l}}{l!} \\ &\quad= \Biggl(\sum_{i=0}^{\infty}B_{i,\frac{\lambda}{2}}\biggl(\frac{x}{2}\biggr)\frac {2^{i}t^{i}}{i!} \Biggr) \Biggl(\sum_{j=1}^{\infty}(1)_{j,\lambda} \frac {t^{j}}{j!} \Biggr) \Biggl(\sum_{l=0}^{\infty} \sum_{m=1}^{l+1}\frac {p(m)m!}{m^{k}}2^{l}S_{1}(l+1,m) \cdot\frac{t^{l}}{l!} \Biggr) \\ &\quad= \Biggl(\sum_{i=0}^{\infty}B_{i,\frac{\lambda}{2}}\biggl(\frac{x}{2}\biggr)\frac {2^{i}t^{i}}{i!} \Biggr) \Biggl( \sum_{\alpha=1}^{\infty}\sum _{l=0}^{\alpha}\sum _{m=1}^{l+1} {\alpha\choose l}(1)_{\alpha-l,\lambda} \frac {p(m)m!}{m^{k}}2^{l}S_{1}(l+1,m) \frac{t^{\alpha}}{\alpha!} \Biggr) \\ &\quad=\sum_{n=0}^{\infty}\Biggl( \sum _{\alpha=0}^{n} \sum_{l=0}^{\alpha} \sum_{m=1}^{l+1} {n \choose \alpha} {\alpha\choose l} (1)_{\alpha-1,\lambda}\frac{p(m)m!}{m^{k}}2^{n-\alpha+l}S_{1}(l+1,m) B_{n-\alpha,\frac{\lambda}{2}}\biggl(\frac{x}{2}\biggr) \Biggr) \frac{t^{n}}{n!}. \end{aligned}$$

(58)

Thus, by comparing the coefficients on both sides of (58), we obtain the desired theorem. □

4 Conclusion

In this paper, we introduced the degenerate poly-Genocchi polynomials by using the modified degenerate polyexponential function. We expressed those polynomials and numbers in relation to: the degenerate poly-Bernoulli polynomials in Theorem 1; the degenerate Euler polynomials and the Stirling numbers of the first kind in Theorem 2; the degenerate Genocchi numbers and the Stirling numbers of the first kind in Theorem 3; the Stirling numbers of the first kind in Theorems 7, 8; the degenerate poly-Genocchi numbers and Bernoulli numbers of order n in Theorem 4; and the degenerate Stirling numbers of the second kind in Theorem 10. Furthermore, we defined the degenerate unipoly Genocchi polynomials and obtained some of their properties. Not to mention, we also obtained the identity for degenerate unipoly Genocchi polynomials and numbers for: the degenerate Genocchi numbers and the Stirling numbers of the first kind in Theorem 12; the degenerate Euler numbers and the Stirling numbers of the first kind in Theorem 13; the degenerate Bernoulli polynomials and the Stirling numbers of the first kind in Theorems 14.

It is important that the study of the degenerate version is widely applied not only to numerical theory and combinatorial theory, but also to symmetric identity, differential equations and probability theory. In particular, many symmetric identities have been studied for degenerate versions of many special polynomials [1, 5–12]. Genocchi numbers have been also extensively studied in many different branches of mathematics. The works of Genocchi numbers and their combinatorial relations have received much attention [13, 17–20]. With this in mind, as a future project, we would like to continue to study degenerate versions of certain special polynomials and numbers and their applications to physics, economics, and engineering as well as mathematics.