1 Introduction and preliminaries

Let n be a nonnegative integer. Then the Stirling numbers of the first kind are defined as

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

where \((x)_{0}=1\), \((x)_{n}=x(x-1)\cdots(x-n+1)\) (\(n\ge1\)), whereas the Stirling numbers of the second kind are given by

$$ x^{n}=\sum_{l=0}^{n}S_{2}(n,l) (x)_{l}\quad\bigl(\mbox{see [10, 18]}\bigr). $$
(2)

By (1) and (2), we get

$$ \frac{1}{k!} \bigl(e^{t}-1 \bigr)^{k}=\sum _{n=k}^{\infty }S_{2}(n,k) \frac{t^{n}}{n!}\quad(k\ge0) $$
(3)

and

$$ \frac{1}{k!} \bigl(\log(1+t) \bigr)^{k}=\sum _{n=k}^{\infty }S_{1}(n,k) \frac{t^{n}}{n!}\quad(k\ge0). $$
(4)

It is well known that the Bell polynomials are defined as

$$ e^{x(e^{t}-1)}=\sum_{n=0}^{\infty}B_{n}(x) \frac{t^{n}}{n!}\quad \bigl(\mbox{see [13, 19]}\bigr). $$
(5)

When \(x=1\), \(B_{n}=B_{n}(1)\) are called the Bell numbers.

For \(0 \neq\lambda\in\mathbb{R}\), the degenerate exponential functions are defined by

$$ e_{\lambda}^{x}(t)=\sum_{n=0}^{\infty} \frac{(x)_{n,\lambda }}{n!}t^{n},\qquad e_{\lambda}(t)=e_{\lambda}^{1}(t)= \sum_{n=0}^{\infty}\frac{(1)_{n,\lambda}}{n!}t^{n} \quad\bigl(\mbox{see [12, 21]}\bigr), $$
(6)

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

Let \(\log_{\lambda}(t)\) be the compositional inverse of \(e_{\lambda }(t)\), called the degenerate logarithm function, such that \(\log _{\lambda} (e_{\lambda}(t) )=e_{\lambda} (\log_{\lambda }t )=t\).

Then we note that

$$ \log_{\lambda}(1+t)=\frac{1}{\lambda}\bigl((1+t)^{\lambda}-1 \bigr)=\sum_{n=1}^{\infty} \lambda^{n-1}(1)_{n,\frac{1}{\lambda}}\frac {t^{n}}{n!}\quad\bigl( \mbox{see [14]}\bigr). $$
(7)

By (7), we get \(\lim_{\lambda\rightarrow0}\log_{\lambda }(1+t)=\log(1+t) \).

In [14], 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}. $$
(8)

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

$$ (x)_{n,\lambda}=\sum_{k=0}^{n}S_{2,\lambda}(n,k) (x)_{k}\quad (n\ge0)\ \bigl(\mbox{see [16]}\bigr). $$
(9)

By (8) and (9), we get

$$ \frac{1}{k!} \bigl(\log_{\lambda}(1+t) \bigr)^{k}= \sum_{n=k}^{\infty }S_{1,\lambda}(n,k) \frac{t^{n}}{n!} \quad(k\ge0)\ \bigl(\mbox{see [14]}\bigr) $$
(10)

and

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

We define the degenerate Bell polynomials \(B_{n,\lambda}(x)\) by

$$ e_{\lambda}^{x} \bigl(e_{\lambda}(t)-1 \bigr)=\sum _{n=0}^{\infty }B_{n,\lambda}(x) \frac{t^{n}}{n!}. $$
(12)

When \(x=1\), \(B_{n,\lambda}=B_{n,\lambda}(1)\) are called the degenerate Bell numbers.

From (6) and (10), we note that

$$\begin{aligned} e_{\lambda}^{x} \bigl(e_{\lambda}(t)-1 \bigr) &= \sum _{k=0}^{\infty }(x)_{k,\lambda} \frac{1}{k!} \bigl(e_{\lambda}(t)-1 \bigr)^{k} \\ &= \sum_{k=0}^{\infty}(x)_{k,\lambda} \sum_{n=k}^{\infty }S_{2,\lambda}(n,k) \frac{t^{n}}{n!} \\ &= \sum_{n=0}^{\infty} \Biggl(\sum _{k=0}^{n}(x)_{k,\lambda }S_{2,\lambda}(n,k) \Biggr)\frac{t^{n}}{n!}. \end{aligned}$$
(13)

By (12) and (13), we get

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

Here we note that the so-called new type degenerate Bell polynomials \(\operatorname{Bel}_{n,\lambda}(x)\), which are different from the degenerate Bell polynomials just introduced, have been considered recently in [19]. They are defined by the generating function \(e_{\lambda}^{x} (e^{t} -1 )=\sum_{n=0}^{\infty}\operatorname{Bel}_{n,\lambda}(x)\frac{t^{n}}{n!}\), so that \(\operatorname{Bel}_{n,\lambda}(x)=\sum_{k=0}^{n}S_{2}(n,k)(x)_{k,\lambda}\) (\(n\ge0\)).

In [2, 3], Carlitz initiated a study of the degenerate Bernoulli and Euler polynomials and numbers, which are degenerate versions of the usual Bernoulli and Euler polynomials and numbers (see [1, 22, 25, 30, 31]). In recent years, studying degenerate versions of quite a few special polynomials and numbers has regained lively interest of some mathematicians and yielded many interesting results (see [4–7, 10, 12–17, 19–21, 23, 24, 26–28]). Here we note that such degenerate versions of many special polynomials and numbers have been investigated by employing different tools like generating functions, combinatorial methods, umbral calculus techniques, probability theory, p-adic analysis, differential equations, etc.

The aim of the present paper is to study Jindalrae and Gaenari polynomials and numbers in connection with Jindalrae–Stirling numbers of the first and second kinds, and find some arithmetic and combinatorial results on those polynomials and numbers. First, we define Jindalrae–Stirling numbers of the first and second kinds as extensions of the notions of the degenerate Stirling numbers of the first and second kinds, and find some relations involving those special numbers. Then we introduce Jindalrae and Gaenari numbers and polynomials and obtain some explicit expressions and identities associated with those numbers and polynomials. In addition, we interpret our results by using umbral calculus.

Further continuation of the present work would be to find some applications of our results in science and engineering as well as in mathematics. We outlined possible applications of our results to other areas of mathematics, namely to probability, differential equations, and identities of symmetry, in the last section. However, some applications to areas other than mathematics will require considerable amount of work. We hope that we will be able to find such applications in the near future.

This paper is organized as follows. In Sect. 1, we go over some necessary stuff that is needed throughout this paper. This includes the degenerate exponential functions, the degenerate logarithm function, the degenerate Stirling numbers of the first and second kinds, and the degenerate Bell numbers. Here we note that the degenerate Bell polynomials \(B_{n,\lambda}(x)\) (see (12)) are different from the partially degenerate Bell polynomials \(\operatorname{bel}_{n,\lambda}(x)\) in [15] and also from the new type degenerate Bell polynomials \(\operatorname{Bel}_{n,\lambda}(x)\) in [19]. In Sect. 2, we introduce Jindalrae–Stirling numbers of the first and second kinds, as extensions of the notions of the degenerate Stirling numbers of the first and second kinds and find some relations connecting those special numbers, the degenerate Stirling numbers of the first and second kinds and the degenerate Bell numbers and polynomials. Then we introduce Jindalrae numbers and polynomials, as an extension of the notion of the degenerate Bell numbers and polynomials, and Gaenari numbers and polynomials and find some explicit expressions and identities involving those numbers and polynomials, Jindalrae–Stirling numbers of the first and second kinds, the degenerate Stirling numbers of the first and second kinds, and the degenerate Bell polynomials. In Sect. 3, we interpret the results in Sect. 2 by means of umbral calculus. Finally, we conclude this paper in Sect. 4.

2 Jindalrae and Gaenari numbers and polynomials

By replacing t by \(e^{t}-1\) in (3), we get

$$\begin{aligned} \frac{1}{k!} \bigl(e^{e^{t}-1}-1 \bigr)^{k} &= \sum _{m=k}^{\infty }S_{2}(m,k) \frac{1}{m!}\bigl(e^{t}-1\bigr)^{m} \\ &= \sum_{m=k}^{\infty}S_{2}(m,k) \sum_{n=m}^{\infty}S_{2}(n,m) \frac {t^{n}}{n!} \\ &= \sum_{n=k}^{\infty} \Biggl(\sum _{m=k}^{n}S_{2}(m,k)S_{2}(n,m) \Biggr)\frac{t^{n}}{n!}. \end{aligned}$$
(15)

Let

$$ \frac{1}{k!} \bigl(e^{e^{t}-1}-1 \bigr)^{k}=\sum _{n=k}^{\infty}T(n,k)\frac{t^{n}}{n!}. $$
(16)

Then, by (15) and (16), we get

$$ T(n,k)=\sum_{m=k}^{\infty}S_{2}(n,m)S_{2}(m,k), $$
(17)

where \(n,k\ge0\), with \(n\ge k\).

Further, we have

$$\begin{aligned} \frac{1}{k!} \bigl(e^{e^{t}-1}-1 \bigr)^{k} &= \frac{1}{k!} \Biggl(\sum_{n=1}^{\infty}B_{n} \frac{t^{n}}{n!} \Biggr)^{k} \\ &= \frac{1}{k!}\sum_{n=k}^{\infty} \biggl(\sum_{n_{1}+\cdots +n_{k}=n}\binom{n}{n_{1},\dots,n_{k}}B_{n_{1}} \cdots B_{n_{k}} \biggr)\frac{t^{n}}{n!}, \end{aligned}$$
(18)

where the inner sum runs over all positive integers \(n_{1},\dots,n_{k}\), with \(n_{1}+\cdots+n_{k}=n\). Thus, by (16), (17), and (18), we get

$$\begin{aligned} T(n,k) &= \frac{1}{k!} \sum _{n_{1}+\cdots+n_{k}=n}\binom {n}{n_{1},\dots,n_{k}}B_{n_{1}}\cdots B_{n_{k}} \\ &= \sum_{m=k}^{n}S_{2}(n,m)S_{2}(m,k). \end{aligned}$$
(19)

Note that \(T(n,1)=\sum_{m=1}^{n}S_{2}(n,m)=B_{n}\) (\(n\ge1\)).

For \(k\ge0\), as an extension of the notion of the degenerate Stirling numbers of the second kind, we define Jindalrae–Stirling numbers of the second kind (see (9) and (11)) by

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

On the other hand,

$$\begin{aligned} \frac{1}{k!} \bigl(e_{\lambda}\bigl(e_{\lambda}(t)-1 \bigr)-1 \bigr)^{k} &= \sum_{m=k}^{\infty}S_{2,\lambda}(m,k) \sum_{n=m}^{\infty}S_{2,\lambda }(n,m) \frac{t^{n}}{n!} \\ &= \sum_{n=k}^{\infty} \Biggl(\sum _{m=k}^{n}S_{2,\lambda }(m,k)S_{2,\lambda}(n,m) \Biggr)\frac{t^{n}}{n!}. \end{aligned}$$
(21)

Therefore, by (20) and (21), we obtain the following theorem.

Theorem 1

For\(n,k\ge0\), with\(n\ge k\), we have

$$ S_{J,\lambda}^{(2)}(n,k)=\sum_{m=k}^{n}S_{2,\lambda }(n,m)S_{2,\lambda}(m,k). $$

When \(k=1\), we have

$$\begin{aligned} \sum_{n=1}^{\infty}S_{J,2}^{(2)}(n,1) \frac{t^{n}}{n!} &= e_{\lambda } \bigl(e_{\lambda}(t)-1 \bigr)-1 \\ &= \sum_{n=0}^{\infty}B_{n,\lambda} \frac{t^{n}}{n!}-1 = \sum_{n=1}^{\infty}B_{n,\lambda} \frac{t^{n}}{n!}. \end{aligned}$$

For \(n\ge1\), we have

$$\begin{aligned} S_{J,\lambda}^{(2)}(n,1) &= B_{n,\lambda}\\ &= \sum _{m=1}^{n}S_{2,\lambda}(n,m)S_{2,\lambda}(m,1) \\ &= \sum_{m=1}^{n}S_{2,\lambda}(n,m) (1)_{m,\lambda}. \end{aligned}$$
(22)

For \(k\ge0\), by replacing t by \(\log_{\lambda}(1+t)\) in (20), we get

$$\begin{aligned} \frac{1}{k!} \bigl(e_{\lambda}(t)-1 \bigr)^{k} &= \sum_{m=k}^{\infty }S_{J,\lambda}^{(2)}(m,k) \frac{1}{m!} \bigl(\log_{\lambda}(1+t) \bigr)^{m} \\ &= \sum_{m=k}^{\infty}S_{J,\lambda}^{(2)}(m,k) \sum_{n=m}^{\infty }S_{1,\lambda}(n,m) \frac{t^{n}}{n!} \\ &= \sum_{n=k}^{\infty} \Biggl(\sum _{m=k}^{n}S_{J,\lambda }^{(2)}(m,k)S_{1,\lambda}(n,m) \Biggr)\frac{t^{n}}{n!}. \end{aligned}$$
(23)

Therefore, by (10) and (23), we obtain the following theorem.

Theorem 2

For\(n,k\ge0\), with\(n\ge k\), we have

$$ S_{2,\lambda}(n,k)=\sum_{m=k}^{n}S_{J,\lambda }^{(2)}(m,k)S_{1,\lambda}(n,m). $$

When \(k=1\), we have

$$\begin{aligned} S_{2,\lambda}(n,1) &= \sum_{m=1}^{n}S_{J,\lambda }^{(2)}(m,1)S_{1,\lambda}(n,m) = \sum_{m=1}^{n}B_{m,\lambda}S_{1,\lambda}(n,m). \end{aligned}$$
(24)

It is easy to show that \(S_{2,\lambda}(n,1)=(1)_{n,\lambda}\) (\(n \geq1\)). Therefore, by (24), we obtain the following corollary.

Corollary 3

For\(n\in\mathbb{N}\), we have

$$ \sum_{m=1}^{n}B_{m,\lambda}S_{1,\lambda}(n,m)=(1)_{n,\lambda}. $$

As an inversion formula of (20) and an extension of the notion of the degenerate Stirling numbers of the first kind (see (8) and (10)), we define Jindalrae–Stirling numbers of the first kind by

$$ \frac{1}{k!} \bigl(\log_{\lambda}\bigl(\log_{\lambda}(1+t)+1 \bigr) \bigr)^{k}=\sum_{n=k}^{\infty}S_{J,\lambda}^{(1)}(n,k) \frac {t^{n}}{n!}\quad(k\ge0). $$
(25)

We note that

$$\begin{aligned} \frac{1}{k!} \bigl(\log_{\lambda}\bigl(\log_{\lambda}(1+t)+1 \bigr) \bigr)^{k} &= \sum_{m=k}^{\infty}S_{1,\lambda}(m,k) \frac{1}{m!} \bigl(\log _{\lambda}(1+t) \bigr)^{m} \\ &= \sum_{m=k}^{\infty}S_{1,\lambda}(m,k) \sum_{n=m}^{\infty }S_{1,\lambda}(n,m) \frac{t^{n}}{n!} \\ &= \sum_{n=k}^{\infty} \Biggl(\sum _{m=k}^{n}S_{1,\lambda }(m,k)S_{1,\lambda}(n,m) \Biggr)\frac{t^{n}}{n!}. \end{aligned}$$
(26)

Therefore, by (25) and (26), we obtain the following theorem.

Theorem 4

For\(n,k\ge0\), with\(n\ge k\), we have

$$ S_{J,\lambda}^{(1)}(n,k)=\sum_{m=k}^{n}S_{1,\lambda }(n,m)S_{1,\lambda}(m,k). $$

When \(k=1\), we have

$$\begin{aligned} S_{J,\lambda}^{(1)}(n,1) &= \sum_{m=1}^{n}S_{1,\lambda }(m,1)S_{1,\lambda}(n,m) \\ &= \sum_{m=1}^{n}(m-1)! \binom{\lambda-1}{m-1}S_{1,\lambda}(n,m). \end{aligned}$$
(27)

Corollary 5

For\(n\ge1\), we have

$$ S_{J,\lambda}^{(1)}(n,1)=\sum_{m=1}^{n}(m-1)! \binom{\lambda -1}{m-1}S_{1,\lambda}(n,m). $$

From (20), we note that

$$\begin{aligned} \sum_{n=k}^{\infty}S_{J,\lambda}^{(2)}(n,k) \frac{t^{n}}{n!} &= \frac{1}{k!} \bigl(e_{\lambda} \bigl(e_{\lambda}(t)-1\bigr)-1 \bigr)^{k} \\ &= \frac{1}{k!}\sum_{l=0}^{k} \binom{k}{l}(-1)^{k-l}e_{\lambda }^{l} \bigl(e_{\lambda}(t)-1 \bigr) \\ &= \sum_{n=0}^{\infty} \Biggl( \frac{1}{k!}\sum_{l=0}^{k} \binom {k}{l}(-1)^{k-l}B_{n,\lambda}(l) \Biggr) \frac{t^{n}}{n!}, \end{aligned}$$
(28)

where k is a nonnegative integer.

By comparing the coefficients on both sides of (28), we get

$$ \frac{1}{k!}\sum_{l=0}^{k} \binom {k}{l}(-1)^{k-l}B_{n,\lambda}(l)=\left \{ \textstyle\begin{array}{l@{\quad}l} S_{J,\lambda}^{(2)}(n,k), & \textrm{if }n\ge k,\\ 0, & \textrm{if } 0 \leq n < k. \end{array}\displaystyle \right . $$
(29)

Therefore, by (29), we obtain the following theorem.

Theorem 6

For\(n,k\ge0\), with\(n\ge k\), we have

$$ S_{J,\lambda}^{(2)}(n,k)=\frac{1}{k!}\sum _{l=0}^{k}\binom {k}{l}(-1)^{k-l}B_{n,\lambda}(l). $$

Now, we observe that

$$\begin{aligned} \sum_{k=0}^{\infty}(x)_{k,\lambda} \frac{1}{k!} \bigl(\log_{\lambda }\bigl(\log_{\lambda}(1+t)+1 \bigr) \bigr)^{k} &= \sum_{k=0}^{\infty }(x)_{k,\lambda} \sum_{n=k}^{\infty}S_{J,\lambda}^{(1)}(n,k) \frac {t^{n}}{n!} \\ &= \sum_{n=0}^{\infty} \Biggl(\sum _{k=0}^{n}(x)_{k,\lambda }S_{J,\lambda}^{(1)}(n,k) \Biggr)\frac{t^{n}}{n!}. \end{aligned}$$
(30)

On the other hand,

$$ \begin{aligned}[b] \sum_{k=0}^{\infty}(x)_{k,\lambda} \frac{1}{k!} \bigl(\log_{\lambda }\bigl(\log_{\lambda}(1+t)+1 \bigr) \bigr)^{k} &= e_{\lambda}^{x}\bigl( \log_{\lambda }\bigl(\log_{\lambda}(1+t)+1\bigr) \bigr). \\ &= \bigl(\log_{\lambda}(1+t)+1 \bigr)^{x}\\& = \sum _{l=0}^{\infty }(x)_{l} \frac{1}{l!} \bigl(\log_{\lambda}(1+t) \bigr)^{l} \\ &= \sum_{l=0}^{\infty}(x)_{l} \sum_{n=l}^{\infty}S_{1,\lambda }(n,l) \frac{t^{n}}{n!} \\&= \sum_{n=0}^{\infty} \Biggl(\sum_{l=0}^{n}S_{1,\lambda}(n,l) (x)_{l} \Biggr)\frac{t^{n}}{n!}.\end{aligned} $$
(31)

Thus, by (30) and (31), we get

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

From (9) and (32), we can derive the following Eq. (33):

$$\begin{aligned} \sum_{l=0}^{n}S_{1,\lambda}(n,l) (x)_{l} &= \sum_{k=0}^{n}S_{J,\lambda }^{(1)}(n,k) (x)_{k,\lambda} \\ &= \sum_{k=0}^{n}S_{J,\lambda}^{(1)}(n,k) \sum_{l=0}^{k}S_{2,\lambda }(k,l) (x)_{l} \\ &= \sum_{l=0}^{n} \Biggl(\sum _{k=l}^{n}S_{J,\lambda }^{(1)}(n,k)S_{2,\lambda}(k,l) \Biggr) (x)_{l}. \end{aligned}$$
(33)

Therefore, by comparing the coefficients as both sides of (33), we obtain the following theorem.

Theorem 7

For\(n,l\ge0\), we have

$$ S_{1,\lambda}(n,l)=\sum_{k=l}^{n}S_{J,\lambda }^{(1)}(n,k)S_{2,\lambda}(k,l). $$

When \(l=1\), we have

$$\begin{aligned}[b] S_{1,\lambda}(n,1) &= \sum_{k=1}^{n}S_{J,\lambda }^{(1)}(n,k)S_{2,\lambda}(k,1) \\&= \sum_{k=1}^{n}(1)_{k,\lambda }S_{J,\lambda}^{(1)}(n,k).\end{aligned} $$
(34)

As an extension of the degenerate Bell polynomials in (12), the Jindalrae polynomials are defined by

$$ e_{\lambda}^{x} \bigl(e_{\lambda} \bigl(e_{\lambda}(t)-1\bigr)-1 \bigr)=\sum_{n=0}^{\infty}J_{n,\lambda}(x) \frac{t^{n}}{n!} . $$
(35)

When \(x=1\), \(J_{n,\lambda}=J_{n,\lambda}(1)\) are called Jindalrae numbers.

From (35), we note that

$$\begin{aligned} e_{\lambda}^{x} \bigl(e_{\lambda} \bigl(e_{\lambda}(t)-1\bigr)-1 \bigr) &= \sum_{k=0}^{\infty}(x)_{k,\lambda} \frac{1}{k!} \bigl(e_{\lambda }\bigl(e_{\lambda}(t)-1 \bigr)-1 \bigr)^{k} \\ &= \sum_{k=0}^{\infty}(x)_{k,\lambda} \sum_{n=k}^{\infty }S_{J,\lambda}^{(2)}(n,k) \frac{t^{n}}{n!} \\ &= \sum_{n=0}^{\infty} \Biggl(\sum _{k=0}^{n}(x)_{k,\lambda }S_{J,\lambda}^{(2)}(n,k) \Biggr)\frac{t^{n}}{n!}. \end{aligned}$$
(36)

Therefore, by (35) and (36), we obtain the following theorem.

Theorem 8

For\(n\ge0\), we have

$$ J_{n,\lambda}(x)=\sum_{k=0}^{n}(x)_{k,\lambda}S_{J,\lambda}^{(2)}(n,k). $$

In particular, for\(x=1\),

$$ J_{n,\lambda}=\sum_{k=0}^{n}(1)_{k,\lambda}S_{J,\lambda}^{(2)}(n,k). $$

By replacing t by \(\log_{\lambda}(1+t)\) in (35), we get

$$\begin{aligned} e_{\lambda}^{x} \bigl(e_{\lambda}(t)-1 \bigr) &= \sum _{m=0}^{\infty }J_{m,\lambda}(x) \frac{1}{m!} \bigl(\log_{\lambda}(1+t) \bigr)^{m} \\ &= \sum_{m=0}^{\infty}J_{m,\lambda}(x) \sum_{n=m}^{\infty }S_{1,\lambda}(n,m) \frac{t^{n}}{n!} \\ &= \sum_{n=0}^{\infty} \Biggl(\sum _{m=0}^{n}J_{m,\lambda }(x)S_{1,\lambda}(n,m) \Biggr)\frac{t^{n}}{n!}. \end{aligned}$$
(37)

Therefore, by (12) and (37), we obtain the following theorem.

Theorem 9

For\(n\ge0\), we have

$$ B_{n,\lambda}(x) = \sum_{m=0}^{n}J_{m,\lambda}(x)S_{1,\lambda}(n,m). $$

In particular,

$$ B_{n,\lambda} = \sum_{m=0}^{n}J_{m,\lambda}S_{1,\lambda}(n,m). $$

From (20), we note that

$$\begin{aligned} e_{\lambda}^{x} \bigl(e_{\lambda} \bigl(e_{\lambda}(t)-1\bigr)-1 \bigr) &= \sum_{m=0}^{\infty}B_{m,\lambda}(x) \frac{1}{m!} \bigl(e_{\lambda }(t)-1 \bigr)^{m} \\ &= \sum_{m=0}^{\infty}B_{m,\lambda}(x) \sum_{n=m}^{\infty }S_{2,\lambda}(n,m) \frac{t^{n}}{n!} \\ &= \sum_{n=0}^{\infty} \Biggl(\sum _{m=0}^{n}B_{m,\lambda }(x)S_{2,\lambda}(n,m) \Biggr)\frac{t^{n}}{n!}. \end{aligned}$$
(38)

Therefore, by (35) and (38), we obtain the following theorem.

Theorem 10

For\(n\ge0\), we have

$$ J_{n,\lambda}(x) = \sum_{m=0}^{n}B_{m,\lambda}(x)S_{2,\lambda}(n,m). $$

In particular,

$$ J_{n,\lambda} = \sum_{m=0}^{n}B_{m,\lambda}S_{2,\lambda}(n,m). $$

It is not difficult to show that \(\log_{\lambda} (\log_{\lambda }(1+t)+1 )\) is the compositional inverse of \(e_{\lambda} (e_{\lambda}(t)-1 )-1\). Now, we consider the Gaenari polynomials given by

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

When \(x=1\), \(G_{n,\lambda}(1)=G_{n,\lambda}\) are called the Gaenari numbers.

From (6), we note that

$$\begin{aligned} e_{\lambda}^{x} \bigl(\log_{\lambda}\bigl( \log_{\lambda}(1+t)+1\bigr) \bigr) &= \sum_{k=0}^{\infty}(x)_{k,\lambda} \frac{1}{k!} \bigl(\log _{\lambda}\bigl(\log_{\lambda}(1+t)+1 \bigr) \bigr)^{k} \\ &= \sum_{k=0}^{\infty}(x)_{k,\lambda} \sum_{n=k}^{\infty }S_{J,\lambda}^{(1)}(n,k) \frac{t^{n}}{n!} \\ &= \sum_{n=0}^{\infty} \Biggl(\sum _{k=0}^{n}(x)_{k,\lambda }S_{J,\lambda}^{(1)}(n,k) \Biggr)\frac{t^{n}}{n!}. \end{aligned}$$
(40)

Therefore, by (39) and (40), we obtain the following theorem.

Theorem 11

For\(n\ge0\), we have

$$ G_{n,\lambda}(x) = \sum_{k=0}^{n}(x)_{k,\lambda}S_{J,\lambda}^{(1)}(n,k). $$

In particular,

$$ G_{n,\lambda} = \sum_{k=0}^{n}(1)_{k,\lambda}S_{J,\lambda}^{(1)}(n,k). $$

By replacing t by \(e_{\lambda}(t)-1\) in (39), we get

$$\begin{aligned} e_{\lambda}^{x} \bigl(\log_{\lambda}(1+t) \bigr) &= \sum_{m=0}^{\infty}G_{m,\lambda}(x) \frac{1}{m!} \bigl(e_{\lambda }(t)-1 \bigr)^{m} \\ &= \sum_{m=0}^{\infty}G_{m,\lambda}(x) \sum_{n=m}^{\infty }S_{2,\lambda}(n,m) \frac{t^{n}}{n!} \\ &= \sum_{n=0}^{\infty} \Biggl(\sum _{m=0}^{n}G_{m,\lambda }(x)S_{2,\lambda}(n,m) \Biggr)\frac{t^{n}}{n!}. \end{aligned}$$
(41)

On the other hand,

$$ e_{\lambda}^{x} \bigl(\log_{\lambda}(1+t) \bigr) = \sum_{n=0}^{\infty }(x)_{n} \frac{t^{n}}{n!}. $$
(42)

Therefore, by (41) and (42), we obtain the following theorem.

Theorem 12

For\(n\ge0\), we have

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

When\(x=1\), we have

$$ (1)_{n}=\sum_{m=0}^{n}G_{m,\lambda}S_{2,\lambda}(n,m). $$
(43)

By (43), we get

$$ G_{0,\lambda}=1,\quad\sum_{m=0}^{n}G_{m,\lambda }S_{2,\lambda}(n,m)= \left \{ \textstyle\begin{array}{l@{\quad}l} 1, & \textrm{if }n=1,\\ 0, & \textrm{if }n > 1. \end{array}\displaystyle \right . $$
(44)

From (44), we note that \(G_{1,\lambda}=1\). Indeed, we note that

$$ e_{\lambda}^{x} \bigl(\log_{\lambda}\bigl( \log_{\lambda}(1+t)+1\bigr) \bigr)= \bigl(1+\log(1+t) \bigr)^{x}. $$
(45)

Thus, by (39) and (45), we get

$$ \bigl(1+\log_{\lambda}(1+t) \bigr)^{x}=\sum _{n=0}^{\infty }G_{n,\lambda}(x) \frac{t^{n}}{n!}. $$
(46)

From (7) and (46), we have

$$ \sum_{n=0}^{\infty}G_{n,\lambda} \frac{t^{n}}{n!}=1+\sum_{n=1}^{\infty} \lambda^{n-1}(1)_{n,1/\lambda}\frac{t^{n}}{n!}. $$
(47)

Thus, by (47), we get

$$ G_{n,\lambda}=\lambda^{n-1}(1)_{n,1/\lambda}\quad(n\ge1). $$

Corollary 13

For\(n\ge1\), we have

$$ G_{n,\lambda}=\lambda^{n-1}(1)_{n,1/\lambda}\quad(n\ge1). $$

By replacing t by \(e_{\lambda} (e_{\lambda}(t)-1 )-1\) in (39), we get

$$\begin{aligned} e_{\lambda}^{x}(t) &= \sum_{m=0}^{\infty}G_{m,\lambda}(x) \frac {1}{m!} (e_{\lambda}\bigl(e_{\lambda}(t)-1 \bigr)^{m} \\ &= \sum_{m=0}^{\infty}G_{m,\lambda}(x) \sum_{n=m}^{\infty }S_{J,\lambda}^{(2)}(n,m) \frac{t^{n}}{n!} \\ &= \sum_{n=0}^{\infty} \Biggl(\sum _{m=0}^{n}G_{m,\lambda }(x)S_{J,\lambda}^{(2)}(n,m) \Biggr)\frac{t^{n}}{n!}. \end{aligned}$$
(48)

From (6) and (48), we have

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

In particular,

$$ (1)_{n,\lambda}=\sum_{m=0}^{n}G_{m,\lambda}S_{J,\lambda}^{(2)}(n,m). $$

From (35), we also note that

$$\begin{aligned} e_{\lambda}^{x}(t) &= \sum_{m=0}^{\infty}J_{m,\lambda}(x) \frac {1}{m!} \bigl(\log_{\lambda}\bigl(\log_{\lambda}(1+t)+1 \bigr) \bigr)^{m} \\ &= \sum_{m=0}^{\infty}J_{m,\lambda}(x) \sum_{n=m}^{\infty }S_{J,\lambda}^{(1)}(n,m) \frac{t^{n}}{n!} \\ &= \sum_{n=0}^{\infty} \Biggl(\sum _{m=0}^{n}J_{m,\lambda }(x)S_{J,\lambda}^{(1)}(n,m) \Biggr)\frac{t^{n}}{n!} . \end{aligned}$$
(50)

Thus, by (6) and (50), we get

$$ (x)_{n,\lambda}=\sum_{m=0}^{n}J_{m,\lambda}(x)S_{J,\lambda }^{(1)}(n,m) \quad(n\ge0). $$
(51)

From (49) and (51), we have

$$ \sum_{m=0}^{n}G_{m,\lambda}(x)S_{J,\lambda}^{(2)}(n,m) = \sum_{m=0}^{n}J_{m,\lambda}(x)S_{J,\lambda}^{(1)}(n,m). $$
(52)

3 Further remarks

In this section, we are going to interpret what we obtained in the previous section by means of umbral calculus. First, we will go over some necessary facts about umbral calculus. For more details on umbral calculus, we let the reader refer to [29].

A series \(g(t)\) with \(O(g(t))=0\) and a series \(f(t)\) with \(O(f(t))=1\) are respectively called an invertible series and a delta series. Recall here that the order \(O(f(t))\) of the nonzero power series \(f(t)\) is the smallest integer k for which the coefficient of \(t^{k}\) does not vanish. Let \(g(t)\) be an invertible series, and let \(f(t)\) be a delta series. Then there exists a unique sequence \(s_{n}(x)\) of polynomials such that \(\langle g(t)f(t)^{k}|s_{n}(x)\rangle=n!\delta_{n,k}\) for \(n,k\geq0\) (see [29]). The sequence \(s_{n}(x)\) is called the Sheffer sequence for the Sheffer pair \((g(t),f(t))\), which is denoted by \(s_{n}(x)\sim (g(t),f(t))\). In particular, \(s_{n}(x)\) is called the associated sequence to \(f(t)\) if \(s_{n}(x)\sim(1,f(t))\). Further, \(s_{n}(x)\) is called the Appell sequence for \(g(t)\) if \(s_{n}(x)\sim(g(t),t)\). It is well known that \(s_{n}(x)\sim(g(t),f(t))\) if and only if

$$ \frac{1}{g(\bar{f}(t))}e^{x\bar{f}(t)}=\sum _{n\geq0}s_{n}(x)\frac{t^{n}}{n!}, $$
(53)

where \(\bar{f}(t)\) is the compositional inverse of \(f(t)\) determined by \(f(\bar{f}(t))=\bar{f}(f(t))=t\).

For each nonnegative integer m, the mth power of an invertible series \(g(t)\) will be indicated by \((g(t))^{m}\), while the compositional powers of a delta series \(f(t)\) will be denoted by \(f^{m}(t)=f\circ f\circ\cdots\circ f(t)\) (m times). For \(p_{n}(x)\) and \(q_{n}(x)=\sum_{k=0}^{n}q_{n,k}t^{k}\), the umbral composition of \(q_{n}(x)\) with \(p_{n}(x)\), denoted by \(q_{n}\circ p_{n}(x)\), is defined by \(q_{n}\circ p_{n}(x)=\sum_{k=0}^{n} q_{n,k}p_{k}(x)\).

The next result is stated in Theorem 3.5.5 of [29].

Theorem 14

The set of Sheffer sequences forms a group under operation of umbral composition. If\(s_{n}(x)\sim(g(t),f(t))\)and\(r_{n}(x)\sim(h(t),\ell (t))\), then\(r_{n}(x)\circ s_{n}(x)\sim(g(t)h(f(t)),\ell(f(t)))\). The identity under umbral composition is\(x^{n}\sim(1,t)\), and the inverse of the sequence\(s_{n}(x)\sim(g(t),f(t))\)is the Sheffer sequence for\((g(\bar{f}(t))^{-1},\bar{f}(t))\).

As a corollary, we obtain the following result that will be needed later.

Corollary 15

Let\(s_{n}(x)\sim(g(t),f(t))\), and let\(r_{n}(x)\sim(1,\ell(t))\). Then, for any positive integerm, the generating function for\(r_{n}^{(m)}\circ s_{n}(x)\)is obtained from that for\(s_{n}(x)\)by substituting\(\bar{\ell}^{m}(t)\)fort.

Proof

As \(r_{n}^{(m)}\circ s_{n}(x)\sim(g(t),\ell^{m}(f(t)))\), and the compositional inverse of \(\ell^{m}(f(t))\) is \(\bar{f}(\bar{\ell }^{m}(t))\), we have

$$\begin{aligned} g\bigl(\bar{f}\bigl(\bar{\ell}^{m}(t)\bigr) \bigr)^{-1}e^{x\bar{f}(\bar{\ell }^{m}(t))}=\sum_{n\geq0}r_{n}^{(m)} \circ s_{n}(x)\frac{t^{n}}{n!}. \end{aligned}$$
(54)

 □

From the definition of umbral composition, we see that the mth power under umbral composition of \(r_{n}(x)\sim(h(t),\ell(t))\) is given by

$$\begin{aligned} r_{n}^{(m)}(x)\sim \Biggl(\prod _{i=1}^{m-1}h\bigl(\ell^{i}(t)\bigr), \ell ^{m}(t) \Biggr) \end{aligned}$$
(55)

for any positive integer m. In particular, this says that, for the Appell sequence \(r_{n}(x)\sim(h(t),t)\), we have \(r_{n}^{(m)}(x)\sim ((h(t))^{m},t)\), whereas for the associated sequence \(r_{n}(x)\sim(1,\ell (t))\), we have \(r_{n}^{(m)}(x)\sim(1,\ell^{m}(t))\).

For \(n\geq0\), we write \(r_{n}(x)=\sum_{k=0}^{n} r_{n,k}x^{k}=\sum_{k\geq 0}r_{n,k}x^{k}\), where we agree that \(r_{i,j}=0\) for all \(i< j\). In general, we write

$$r_{n}^{(m)}(x)=\sum_{k-0}^{n}r_{n,k}^{(m)}x^{k}= \sum_{k\geq0}r_{n,k}^{(m)}x^{k} $$

for all \(m\in\mathbb{Z}_{>0}\). Then we see that

$$\begin{aligned} r^{(m)}_{n,k}&=\sum _{\ell_{1},\ldots,\ell_{m-1}=0}^{n}r_{n,\ell _{1}}r_{\ell_{1},\ell_{2}} \cdots r_{\ell_{m-1},k},\quad m\geq1, \end{aligned}$$
(56)

where we understand \(r_{n,k}^{(1)}=r_{n,k}\) for \(m=1\).

3.1 Jindalrae polynomials

From (35), we note that the Jindalrae polynomials \(J_{n,\lambda }(x)\) are given by

$$ \sum_{n=0}^{\infty}J_{n,\lambda}(x) \frac{t^{n}}{n!}=e^{x\bar{f}(\bar {\ell}^{2}(t))}, $$
(57)

where \(f(t)=\frac{1}{\lambda}(e^{\lambda t} -1)\), \(\ell(t)=\log _{\lambda}(1+t)\). Noting that \(\bar{f}(t)=\frac{1}{\lambda}\log(1+\lambda t)\), \(\bar {\ell}(t)=e_{\lambda}(t)-1\), we have

$$ \begin{aligned} &e^{x\bar{f}(t)}=e_{\lambda}^{x}(t)= \sum_{n=0}^{\infty }(x)_{n,\lambda} \frac{t^{n}}{n!}, \\ &e^{x\bar{\ell}(t)}=\sum_{n=0}^{\infty}\sum _{k=0}^{n}S_{2,\lambda }(n,k)x^{k} \frac{t^{n}}{n!}. \end{aligned} $$
(58)

By (58), we let

$$ \begin{aligned} &s_{n}(x)=(x)_{n,\lambda} \sim\biggl(1,f(t)=\frac{1}{\lambda}\bigl(e^{\lambda t}-1\bigr)\biggr), \\ &r_{n}(x)=\sum_{k=0}^{n}S_{2,\lambda}(n,k)x^{k} \sim\bigl(1,\ell(t)=\log _{\lambda}(1+t)\bigr). \end{aligned} $$
(59)

From (54) and (57), we observe that

$$ J_{n,\lambda}(x)=r_{n}^{(2)}\circ s_{n}(x). $$
(60)

As a check, we verify Theorem 8 again by using (60). From (56) and (59), we see that

$$ \begin{aligned} [b]r_{n}^{(2)}(x)&= \sum_{k=0}^{n}\sum _{l=0}^{n}S_{2,\lambda }(n,l)S_{2,\lambda}(l,k)x^{k} \\ &=\sum_{k=0}^{n}\sum _{l=k}^{n}S_{2,\lambda}(n,l)S_{2,\lambda }(l,k)x^{k} \\ &=\sum_{k=0}^{\infty}S_{J,\lambda}^{(2)}(n,k)x^{k}. \end{aligned} $$
(61)

Thus, from (59), (60), and (61), we get the desired result as follows:

$$J_{n, \lambda}(x)=\sum_{k=0}^{n}S_{J, \lambda }^{(2)}(n,k) (x)_{k,\lambda}. $$

For any positive integer r, Korobov polynomials of the first kind of order r are given by

$$ \biggl(\frac{t}{\log_{\lambda}(1+t)} \biggr)^{r}(1+t)^{x}= \biggl(\frac {\lambda t}{(1+t)^{\lambda}-1} \biggr)^{r}(1+t)^{x}=\sum _{n=0}^{\infty }K_{n, (r)}(x;\lambda). $$
(62)

For \(x=0\), \(K_{n, (r)}(\lambda)=K_{n, (r)}(0;\lambda)\) are called Korobov numbers of the first kind of order r. The Korobov polynomials (respectively, numbers) of the first kind are also called the degenerate Bernoulli polynomials (respectively, numbers) of the second kind.

In [9], it was shown that

$$ \begin{aligned} &\sum_{l_{1},\dots,l_{m-1}=0}^{n}S_{2,\lambda}(n,l_{1})S_{2,\lambda }(l_{1},l_{2}) \cdots S_{2,\lambda}(l_{m-1},k) \\ &\quad=\sum_{n\geq l_{1} \geq\cdots\geq l_{m-1}\geq k}S_{2,\lambda }(n,l_{1})S_{2,\lambda}(l_{1},l_{2}) \cdots S_{2,\lambda}(l_{m-1},k) \\ &\quad=\sum_{k_{1} +\cdots+ k_{m}=n-k}\binom{n-1}{k_{1},\dots, k_{m}, k-1}\prod _{j=1}^{m}K_{k_{j},(n-\sum_{i=j+1}^{m}k_{i})}(\lambda). \end{aligned} $$

Therefore, in the special cases of \(m=1\) and \(m=2\), we respectively have

$$ \begin{aligned} &S_{2,\lambda}(n,k)=\binom{n-1}{k-1}K_{n-k, (n)}( \lambda), \\ &S_{J,\lambda}^{(2)}(n,k)=\sum_{k_{1}+k_{2}=n-k} \binom {n-1}{k_{1},k_{2},k-1}K_{k_{2},(n)}(\lambda)K_{k_{1},(n-k_{2})}(\lambda). \end{aligned} $$

3.2 Gaenari polynomials

From (39), we recall that the Gaenari polynomials \(G_{n,\lambda }(x)\) are given by

$$ \sum_{n=0}^{\infty}G_{n,\lambda}(x) \frac{t^{n}}{n!}=e^{x\bar{f}(\bar {\ell}^{2}(t))}, $$
(63)

where \(f(t)=\frac{1}{\lambda}(e^{\lambda t} -1)\), \(\ell(t)=e_{\lambda }(t)-1\).

Noting that \(\bar{f}(t)=\frac{1}{\lambda}\log(1+\lambda t)\), \(\bar {\ell}(t)=\log_{\lambda}(1+t)\), we have

$$ \begin{aligned} &e^{x\bar{f}(t)}=e_{\lambda}^{x}(t)= \sum_{n=0}^{\infty }(x)_{n,\lambda} \frac{t^{n}}{n!}, \\ &e^{x\bar{\ell}(t)}=\sum_{n=0}^{\infty}\sum _{k=0}^{n}S_{1,\lambda }(n,k)x^{k} \frac{t^{n}}{n!}. \end{aligned} $$
(64)

By (58), we let

$$ \begin{aligned} &s_{n}(x)=(x)_{n,\lambda} \sim\biggl(1,f(t)=\frac{1}{\lambda}\bigl(e^{\lambda t}-1\bigr)\biggr), \\ &r_{n}(x)=\sum_{k=0}^{n}S_{1,\lambda}(n,k)x^{k} \sim\bigl(1,\ell (t)=e_{\lambda}(t)-1\bigr). \end{aligned} $$
(65)

From (54) and (63), we observe that

$$ G_{n,\lambda}(x)=r_{n}^{(2)}\circ s_{n}(x). $$
(66)

Here we would like to verify Theorem 11 again by making use of (66). From (56) and (65), we see that

$$ \begin{aligned}[b] r_{n}^{(2)}(x)&= \sum_{k=0}^{n}\sum _{l=0}^{n}S_{1,\lambda }(n,l)S_{1,\lambda}(l,k)x^{k} \\ &=\sum_{k=0}^{n}\sum _{l=k}^{n}S_{1,\lambda}(n,l)S_{1,\lambda }(l,k)x^{k} \\ &=\sum_{k=0}^{\infty}S_{J,\lambda}^{(1)}(n,k)x^{k}. \end{aligned} $$
(67)

Thus, from (65), (66), and (67), we get what we wanted as follows:

$$G_{n, \lambda}(x)=\sum_{k=0}^{n}S_{J, \lambda }^{(1)}(n,k) (x)_{k,\lambda}. $$

For any positive integer r, the degenerate Bernoulli polynomials \(\beta_{n,(r)}(x;\lambda)\) of order r are defined by

$$ \biggl(\frac{t}{e_{\lambda}(t)-1} \biggr)^{r}e_{\lambda}^{x}(t)= \sum_{n\geq0}\beta_{n,(r)}(x;\lambda) \frac{t^{n}}{n!}. $$
(68)

For \(x=0\), \(\beta_{n, (r)}(\lambda)=\beta_{n, (r)}(0;\lambda)\) are called the degenerate Bernoulli numbers of order r.

In [9], it was shown that

$$ \begin{aligned} &\sum_{l_{1},\dots,l_{m-1}=0}^{n}S_{1,\lambda}(n,l_{1})S_{1,\lambda }(l_{1},l_{2}) \cdots S_{1,\lambda}(l_{m-1},k) \\ &\quad=\sum_{n\geq l_{1} \geq\cdots\geq l_{m-1}\geq k}S_{1,\lambda }(n,l_{1})S_{1,\lambda}(l_{1},l_{2}) \cdots S_{1,\lambda}(l_{m-1},k) \\ &\quad=\sum_{k_{1}+\cdots+k_{m}=n-k}\binom{n-1}{k_{1},\ldots,k_{m},k-1}\prod _{j=1}^{m}\beta_{k_{j},(n-\sum_{i=j+1}^{m}k_{i})}(\lambda). \end{aligned} $$

Hence, in the special cases of \(m=1\) and \(m=2\), we respectively have

$$ \begin{aligned} &S_{1,\lambda}(n,k)=\binom{n-1}{k-1} \beta_{n-k, (n)}(\lambda), \\ &S_{J,\lambda}^{(1)}(n,k)=\sum_{k_{1}+k_{2}=n-k} \binom {n-1}{k_{1},k_{2},k-1}\beta_{k_{2},(n)}(\lambda)\beta _{k_{1},(n-k_{2})}( \lambda). \end{aligned} $$

4 Conclusion

In this paper, we introduced Jindalrae–Stirling numbers of the first and second kinds as extensions of the notions of the degenerate Stirling numbers of the first and second kinds (see [5, 10, 18, 21]) and found some relations connecting those special numbers, the degenerate Stirling numbers of the first and second kinds and the degenerate Bell numbers and polynomials (see [12, 13, 15, 19, 21, 27]). Then we introduced Jindalrae numbers and polynomials, as an extension of the notion of the degenerate Bell numbers and polynomials, and Gaenari numbers and polynomials and obtained some explicit expressions and identities involving those numbers and polynomials, Jindalrae–Stirling numbers of the first and second kinds, the degenerate Stirling numbers of the first and second kinds, and the degenerate Bell polynomials. In addition, we interpreted our results by means of umbral calculus (see [6, 9, 13, 29]).

As to possible applications our results, we would like to mention three things. The first one is their applications to differential equations. In [8], new combinatorial identities for some degenerate special polynomials were found from certain infinite families of linear and nonlinear ordinary differential equations, satisfied by the generating functions of those polynomials. The second one is their applications to probability theory. In [16, 18], new identities connecting some special numbers and moments of random variables were derived by using the generating functions of the moments of certain random variables. The last one is their applications to identities of symmetry. In [11], abundant identities of symmetry were derived for various degenerate versions of many special polynomials by using p-adic integrals.

It is one of our future projects to continue this line of research, namely study of degenerate versions of some special polynomials and numbers, and to find some of their possible applications to mathematics, science, and engineering.