Skip to content
• Research
• Open Access

# Identities, inequalities for Boole-type polynomials: approach to generating functions and infinite series

Journal of Inequalities and Applications20192019:62

https://doi.org/10.1186/s13660-019-2006-x

• Received: 30 January 2019
• Accepted: 21 February 2019
• Published:

## Abstract

The main purpose and motivation of this work is to investigate and provide some new identities, inequalities and relations for combinatorial numbers and polynomials, and for Peters type polynomials with the help of their generating functions. The results of this paper involve some special numbers and polynomials such as Stirling numbers, the Apostol–Euler numbers and polynomials, Peters polynomials, Boole polynomials, Changhee numbers and the other well-known combinatorial numbers and polynomials. Finally, in the light of Boole’s inequality (Bonferroni’s inequalities) and bounds of the Stirling numbers of the second kind, some inequalities for a combinatorial finite sum are derived. We mention an open problem including bounds for our numbers. Some remarks and observations are presented.

## Keywords

• Generating function
• Functional equation
• Binomial coefficient
• Euler numbers and polynomials
• Stirling numbers
• Peters polynomials
• Boole polynomials
• Changhee numbers
• Special numbers and polynomials
• Bonferroni’s inequalities

• 05A15
• 05A10
• 11B83
• 26C05
• 30D05
• 35A99

## 1 Introduction

Some well-known notations and definitions are given first: $$\mathbb{N} = \{ 1, 2, 3, \dots \}$$, $$\mathbb{N}_{0} = \{0, 1, 2, 3, \dots \}$$. $$\mathbb{Z}, \mathbb{R}, \mathbb {C}$$ and $$\mathbb{Z}_{p}$$ denote the set of integers, the set of real numbers, the set of complex numbers, and the set of p-adic integers, respectively. $$0^{n} = 1$$ if $$n=0$$ and $$0^{n} = 0$$ if $$n \in\mathbb {N}$$. For $$v \in\mathbb{N}_{0}$$ we have
\begin{aligned} (x)_{v} = x(x-1)\cdots(x-v+1), \end{aligned}
$$(x)_{0} = 1$$ and
\begin{aligned} \binom{x}{v} = \frac{x(x-1)\cdots(x-v+1)}{v!} = \frac{(x)_{v}}{v!} \end{aligned}
(cf.  and the references cited therein).
The Apostol–Euler polynomials $$\mathcal{E}_{n}(x, \lambda)$$ are defined by
\begin{aligned} F_{p1}(t, x; \lambda) = \frac{2e^{tx}}{\lambda e^{t} +1} = \sum _{n=0}^{\infty} \mathcal{E}_{n}(x, \lambda) \frac{t^{n}}{n!}. \end{aligned}
When $$x = 0$$, the above equation reduces to the following Apostol–Euler numbers:
\begin{aligned} \mathcal{E}_{n}(\lambda) = \mathcal{E}_{n}(0, \lambda). \end{aligned}
Similarly when $$\lambda=1$$, the above equation reduces to the following Euler numbers:
\begin{aligned} E_{n} = \mathcal{E}_{n}^{(1)}(1) \end{aligned}
(cf.  and the references cited therein).
Let $$k \in\mathbb{N}_{0}$$. The Stirling numbers of the first kind, $$S_{1}(n,k)$$, are by
\begin{aligned} F_{S_{1}}(t, k) = \frac{(\log(1+t)^{k}}{k!} = \sum _{n=0}^{\infty }S_{1}(n, k)\frac{t^{n}}{n!} \end{aligned}
(1)
and
\begin{aligned} (x)_{k} = \sum_{j=0}^{k} x^{j} S_{1}(k,j). \end{aligned}
(2)
By the above generating function, we have
\begin{aligned} S_{1}(0,0) = 1. \end{aligned}
The other properties are given as follows:

$$S_{1}(0, k) = 0$$ if $$k > 0$$. $$S_{1}(n, 0) = 0$$ if $$n > 0$$ and $$S_{1}(n, k) = 0$$ if $$k > n$$ (cf.  and the references therein).

The Stirling numbers of the second kind, $$S_{2}(n, k)$$, are defined as follows:
\begin{aligned} F_{S}(t, k) = \frac{(e^{t} -1)^{k}}{k!} = \sum _{n=0}^{\infty} S_{2}(n,k) \frac{t^{n}}{n!}. \end{aligned}
(3)
By using (1), an explicit formula for the numbers $$S_{2}(n, k)$$ is given by
\begin{aligned} S_{2}(n, k) = \frac{1}{k!} \sum_{j=0}^{k} (-1)^{k-j}\binom{k}{j} j^{n}. \end{aligned}
From the above equation, we also have
\begin{aligned} S_{2}(0, 0) = 1. \end{aligned}
If $$k > n$$, then
\begin{aligned} S_{2}(n, k) = 0. \end{aligned}
$$S_{2}(n, 0) = 0$$ if $$n>0$$ and also
\begin{aligned} S_{2}(n+1, k) = S_{2}(n, k-1) + kS_{2}(n, k) \end{aligned}
(cf.  and the references cited therein).
The Peters polynomials are defined by
$$F_{P} ( t,x;\lambda,\mu ) =\frac{ ( 1+t ) ^{x}}{ ( 1+ ( 1+t ) ^{\lambda} ) ^{\mu}}=\sum _{n=0}^{\infty }s_{n} ( x;\lambda,\mu ) \frac{t^{n}}{n!},$$
(4)
where $$x,y \in\mathbb{C}$$ (cf. [6, 13]).

We now give some special values of this polynomials as follows:

When $$x=0$$, we have the Peters numbers [15, 20]:
\begin{aligned} s_{n}(\lambda,\mu) = s_{n}(0; \lambda,\mu). \end{aligned}
When $$\mu=1$$, we have the Boole polynomials [6, 13]:
\begin{aligned} \xi(x, \lambda)=s_{n}(x; \lambda,1). \end{aligned}
If $$\lambda= \mu=1$$, we get the Changhee polynomials [7, 9]:
\begin{aligned} Ch_{n}(x) = 2s_{n}(x; 1,1). \end{aligned}
The combinatorial numbers $$Y_{n}(\lambda)$$ and the combinatorial polynomials $$Y_{n}(x;\lambda)$$ are defined, respectively, by 
\begin{aligned} F(t, \lambda) = \frac{2}{\lambda(1+ \lambda t)-1} = \sum_{n=0}^{\infty} Y_{n}(\lambda) \frac{t^{n}}{n!} \end{aligned}
and
\begin{aligned} F(t, x, \lambda) = \frac{2(1+\lambda t)^{x}}{\lambda(1+\lambda t)-1} = \sum_{n=0}^{\infty} Y_{n}(x; \lambda)\frac{t^{n}}{n!}. \end{aligned}
The motivation of this paper as regards generating functions for combinatorial numbers is related to the work of Simsek . Let d be an odd integer. If χ is the Dirichlet character with conductor d, then we have the following equation :
\begin{aligned} \int_{\mathbb{X}} \lambda^{x}(1+\lambda t)^{x} \chi(x)\,d\mu_{-q}(x) = \frac{}{(\lambda q)^{d}(1+\lambda t)^{d} +1}\sum _{j=0}^{d-1} (-1)^{j}\chi(j) (\lambda q)^{j} (1+\lambda t)^{j}. \end{aligned}
By using the above integral equation, the first author gave the generalized Apostol–Changhee numbers and polynomials by means of the following generating functions, respectively:
\begin{aligned} F_{\mathfrak{C}}(t; \lambda, q, \chi) = \frac{_{q} \sum_{j=0}^{d-1}(-1)^{j}\chi(j)(\lambda q)^{j}(1+ \lambda t)^{j}}{(\lambda q)^{d}(1+\lambda t)^{d} +1} = \sum _{n=0}^{\infty} \mathfrak{Ch}_{n, \chi} ( \lambda, q) \frac{t^{n}}{n!}, \end{aligned}
(5)
where $$[x]_{q} = \frac{1-q^{x}}{1-q}, \lim_{q \rightarrow1}[x]_{q} = x$$ and $$\chi(x+d) = \chi(x)$$.
Also
\begin{aligned} F_{\mathfrak{C}}(t, z; \lambda, q, \chi) = F_{\mathbb{C}}(t; \lambda, q, \chi) (1 + \lambda t)^{z} = \sum_{n=0}^{\infty} \mathfrak {Ch}_{n, \chi}(z; \lambda, q) \frac{t^{n}}{n!}. \end{aligned}

We summarize our paper as follows:

In Sect. 2, we give generating functions for Peters type combinatorial numbers and polynomials. We investigate and provide some fundamental properties of these numbers and polynomials.

In Sect. 3, we derive some inequalities including Stirling’s numbers of the second kind and finite combinatorial sums. We also mention an open problem for a Peters type combinatorial number.

## 2 Generating functions for Peters type combinatorial numbers and polynomials

In this section, by (5), we give a generating function for combinatorial numbers and polynomials and investigate properties for the function. By using these functions, we derive identities and relations.

From the above equation, we derive the following generating function:
\begin{aligned} K_{d}(t, x; \lambda, q) = \frac{ _{q} (1 + \lambda t)^{x}}{(\lambda q)^{d}(1 + \lambda t)^{d} +1} = \sum _{n=0}^{\infty} y_{7,n}(x; \lambda, q, d) \frac{t^{n}}{n!}. \end{aligned}
(6)
If $$x=0$$, then we get
\begin{aligned} K_{d}(t, 0; \lambda, q) = \frac{ _{q}}{(\lambda q)^{d}(1 + \lambda t)^{d} +1} = \sum _{n=0}^{\infty} y_{7, n}(\lambda, q, d) \frac{t^{n}}{n!}. \end{aligned}
(7)

### Remark 1

Substituting $$d=1$$ into (6), we have
\begin{aligned} y_{7,n}(x; \lambda, q) = y_{7,n}(x; \lambda, q, 1), \end{aligned}
which was defined by the first author (cf. ).
Substituting $$\mu= 1$$ into (4) after combining with (6), we have
$$F_{P} ( \lambda t,x; d,1 ) =\frac{ ( 1+t ) ^{x}}{ 1+ ( 1+t ) ^{d}}=\sum _{n=0}^{\infty }s_{n} ( x; d,1 ) \frac{t^{n}}{n!}$$
and
\begin{aligned} K_{d}(t, x; \lambda, q) = \frac{ _{q} (1 + \lambda t)^{x}}{(\lambda q)^{d}(1 + \lambda t)^{d} +1} = \sum _{n=0}^{\infty} y_{7,n}(x; \lambda, q, d) \frac{t^{n}}{n!}. \end{aligned}
Having $$\lambda= \frac{1}{q}$$ in (6), we have the following functional equation:
\begin{aligned} K_{d} \biggl(t, x; \frac{1}{q}, q \biggr) = _{q} F_{P} \biggl( \frac {1}{q} t, x; d,1 \biggr). \end{aligned}
By using the above equation, we have
\begin{aligned} y_{7,n} \biggl(x; \frac{1}{q}, q, d \biggr) = _{q} q^{-n} s_{n} ( x; d,1 ). \end{aligned}
Setting $$d=1$$ and $$\lambda= \frac{1}{q}$$ in (6), we have
\begin{aligned} K_{1} \biggl(t, x; \frac{1}{q}, q \biggr) &= \frac{ _{q}(1 + \frac {1}{q} t)^{x}}{(1 + \frac{1}{q} t) +1} \\ &= \frac{ _{q}(1 + \frac{1}{q} t)^{x}}{ \frac{1}{q} t +2} \\ &= \sum_{n=0}^{\infty} \frac{_{q}}{2} q^{-n} Ch_{n}(x) \frac{t^{n}}{n!}. \end{aligned}
Thus we have
\begin{aligned} y_{7,n} \biggl(x; \frac{1}{q}, q, 1 \biggr) = \frac{_{q}}{2} q^{-n} Ch_{n}(x). \end{aligned}

### 2.1 Peters type combinatorial numbers $$y_{7,n}(\lambda, q, d)$$

Here, by (7), we derive some formulas, indentities and relations.

We assume $$\vert 1 + \lambda q \vert < \frac{1}{ \vert \lambda q \vert }$$, by (7), we get
\begin{aligned} K_{d}(t, 0, \lambda,q) = _{q} \sum _{n=0}^{\infty} (-1)^{n}(\lambda q)^{nd}(1 + \lambda t)^{nd}. \end{aligned}
By using the above equation, we also assume that $$\vert \lambda t \vert < 1$$, after that we have
\begin{aligned} \sum_{v=0}^{\infty}y_{7,v}(\lambda, q, d)\frac{t^{v}}{v!} = _{q} \sum_{n=0}^{\infty} (-1)^{n} (\lambda q)^{nd} \sum_{v=0}^{\infty} \binom{nd}{v} \lambda^{v} t^{v}. \end{aligned}
Comparing the coefficients of $$t^{v}$$ on both sides of the above equation, we get the following theorem.

### Theorem 1

Let $$\vert \lambda q \vert < 1$$. Then we have
\begin{aligned} y_{7,v}(\lambda, q, d) = _{q} \sum _{n=0}^{\infty}(-1)^{n} \binom {nd}{v} v! q^{nd} \lambda^{v+nd}. \end{aligned}
By Remark 4 in , we have the following formula:
$$\binom{xy}{k} = \sum_{l,m =1}^{k} \binom{x}{l} \binom{y}{m} \biggl( \frac{l!m!}{k!} \biggr) \sum _{j=1}^{k} (-1)^{k-j}S_{1}(k, j)S_{2}(j, l)S_{2}(j, m).$$
(8)

Combining (8) with Theorem 1, we can obtain another version of the recurrence formula for the numbers $$y_{7, n}(\lambda, q, d)$$.

### Theorem 2

Let
\begin{aligned} y_{7,0}(\lambda, q, d) = \frac{_{q}}{1+ (\lambda q)^{d}}. \end{aligned}
For $$v \geq1$$, we have
\begin{aligned} y_{7,v}(\lambda, q, d)={}& _{q} \lambda^{v} \sum_{l=1}^{v} \sum _{m=1}^{v} (-1)^{m} \binom{d}{l} \frac{l!m!(\lambda q)^{dm} }{(1+\lambda^{d} q^{d})^{m+1}} \\ &{}\times\sum_{j=0}^{v} (-1)^{v-j} S_{1}(v,j)S_{2}(j,l)S_{2}(j,m). \end{aligned}

### Proof

Combining Theorem 1 and (8), we obtain
\begin{aligned} y_{7,v}(\lambda, q, d)={}& _{q} \lambda^{v} v! \sum_{n=0}^{\infty } (-1)^{n} (\lambda q)^{nd} \sum_{l=1}^{v} \sum _{m=1}^{v} \binom {n}{m} \binom{d}{l} \frac{l!m!}{v!} \\ &{}\times\sum_{j=0}^{v} (-1)^{v-j} S_{1}(v,j)S_{2}(j,l)S_{2}(j,m) \\ ={}& _{q} \lambda^{v} v! \sum _{l=1}^{v} \sum_{m=1}^{v} \binom{d}{l} \frac{l!m!}{v!} \sum_{j=0}^{v} (-1)^{v-j} S_{1}(v,j)S_{2}(j,l)S_{2}(j,m) \\ &{}\times\sum_{n=0}^{\infty} (-1)^{n} \binom{n}{m} \bigl(\lambda^{d} q^{d} \bigr)^{n} \\ ={}& _{q} \lambda^{v} v! \sum _{l=1}^{v} \sum_{m=1}^{v} \binom{d}{l} \frac{l!m!}{v!} \sum_{j=0}^{v} (-1)^{v-j} S_{1}(v,j)S_{2}(j,l)S_{2}(j,m) \\ &{}\times(-1)^{m} \frac{ (\lambda^{d} q^{d})^{m}}{(1+ \lambda^{d} q^{d})^{m+1}}. \end{aligned}
□
By using (7), we have
\begin{aligned} \sum_{n=0}^{\infty} y_{7,n}(\lambda, q, d)\frac{t^{n}}{n!} = \frac{_{q}}{2} \sum_{n=0}^{\infty} \mathcal{E}_{n} \bigl( \lambda ^{d} q^{d} \bigr) \frac{d^{n} \ln{(1+\lambda t)}^{n}}{n!}. \end{aligned}
Combining the above equation with (1), we get
\begin{aligned} \sum_{n=0}^{\infty} y_{7,n}(\lambda, q, d)\frac{t^{n}}{n!}= \frac {_{q}}{2}\sum_{m=0}^{\infty} \sum_{j=0}^{m} \,d^{n} \lambda^{m} \mathcal{E}_{n} \bigl( \lambda^{d} q^{d} \bigr) S_{1}(m,n) \frac {t^{m}}{m!}. \end{aligned}

Since $$S_{1}(m,n) = 0$$ if $$m > n$$, by some calculation we derive the following theorem.

### Theorem 3

Let $$m \in\mathbb{N}_{0}$$. Then we have
\begin{aligned} y_{7,m}(\lambda, q, d) = \frac{1+q}{2} \sum _{j=0}^{m}d^{n} \lambda ^{m} \mathcal{E}_{n} \bigl( \lambda^{d} q^{d} \bigr) S_{1}(m,n). \end{aligned}
By (7), we obtain
\begin{aligned}{} _{q} = \bigl( (\lambda q)^{d} (1 + \lambda t)^{d} +1 \bigr) \sum_{n=0}^{\infty} y_{7,n}(\lambda, q, d) \frac{t^{n}}{n!}. \end{aligned}
From the above equation, we get
\begin{aligned}{} _{q} = (\lambda q)^{d} \sum _{n=0}^{\infty}\sum_{j=0}^{n} \binom {n}{j}(d)_{j} \lambda^{j} y_{7, n-j}( \lambda, q, d)\frac{t^{n}}{n!} + \sum_{n=0}^{\infty} y_{7,n} (\lambda, q, d)\frac{t^{n}}{n!}. \end{aligned}

After some elementary calculations and comparing coefficients $$\frac {t^{n}}{n!}$$ on both sides of the above equation, we arrive at the following recurrence formula:

### Theorem 4

Let
\begin{aligned} y_{7, 0}(\lambda, q, d) = \frac{1+q}{(\lambda q)^{d} +1}. \end{aligned}
For $$n \geq1$$, we have
\begin{aligned} y_{7,n}(\lambda, q, d) = - (\lambda q)^{d} \sum_{j=0}^{n} \binom {n}{j} (d)_{j} \lambda^{j} y_{7, n-j}(\lambda, q, d). \end{aligned}
(9)

By substituting (2) into (1), we derive the following corollary.

### Corollary 1

\begin{aligned} y_{7,n}(\lambda, q, d) = - (\lambda q)^{d} \sum _{j=0}^{n} \sum_{k=0}^{j } \binom{n}{j} d^{k} \lambda^{j} S_{1}(j, k) y_{7, n-j}(\lambda, q, d). \end{aligned}

### 2.2 Peters type combinatorial polynomials $$y_{7,n}(x; \lambda , q, d)$$

Here, by (6), we derive some formulas, identities and relations for the polynomials $$y_{7,n}(x; \lambda, q, d)$$ and the numbers $$y_{7,n}(\lambda, q, d)$$.

### Theorem 5

\begin{aligned} y_{7, n}(x, \lambda, q, d) = \sum_{j=0}^{n} \binom{n}{j}(x)_{j} \lambda^{j} y_{7, n-j}( \lambda, q, d). \end{aligned}

### Proof

Substituting (7) into (6) and assume $$\vert \lambda t \vert < 1$$, we have
\begin{aligned} \sum_{n=0}^{\infty} y_{7,n} (x, \lambda, q, d)\frac{t^{n}}{n!} &= \sum_{n=0}^{\infty} \binom{x}{n} (\lambda t)^{n} \sum_{n=0}^{\infty} y_{7,n}(\lambda, q, d)\frac{t^{n}}{n!} \\ &= \sum_{n=0}^{\infty}\sum _{j=0}^{n} \binom{n}{j}(x)_{j} \lambda ^{j} y_{7,n-j}(\lambda, q, d) \frac{t^{n}}{n!}. \end{aligned}
□

### Theorem 6

Let χ be the Dirichlet character with conductor d. Then we have
\begin{aligned} \mathfrak{Ch}_{n, \chi}(\lambda, q) = \sum_{j=0}^{d-1} (-1)^{j} \chi (j) (\lambda q)^{j} y_{7,n}(j; \lambda, q, d). \end{aligned}

### Proof

By combining (5) with (6), we get the following functional equation:
\begin{aligned} F_{\mathfrak{C}}(t; \lambda, q, \chi) = \sum_{j=0}^{d-1} (-1)^{j} \chi(j) (\lambda q)^{j} K_{d}(t, j; \lambda, q). \end{aligned}
From the above equation, we get
\begin{aligned} \sum_{n=0}^{\infty} \mathfrak{Ch}_{n, \chi}( \lambda, q) \frac {t^{n}}{n!} = \sum_{n=0}^{\infty} \sum_{j=0}^{d-1} (-1)^{j} \chi(j) ( \lambda q)^{j} y_{7,n}(j; \lambda, q, d) \frac{t^{n}}{n!}. \end{aligned}
Comparing coefficients $$\frac{t^{n}}{n!}$$ on both sides of the above equation, we get the derived result. □
In , Kucukoglu and Simsek defined
\begin{aligned} \begin{aligned} &F_{d}(t; \lambda, q) = \frac{\ln(1+\lambda t)}{(\lambda q)^{d}(1+\lambda t)^{d} -1} = \sum _{n=0}^{\infty} I_{n,d}(\lambda, q) \frac{t^{n}}{n!}, \\ & G_{d}(t,x; \lambda, q) = (1+\lambda t)^{x} F_{d}(t; \lambda, q) = \sum_{n=0}^{\infty} I_{n,d}(x; \lambda, q)\frac{t^{n}}{n!}. \end{aligned} \end{aligned}
(10)
By combining (6) and the above equation, we get the following functional equation:
\begin{aligned} G_{2d}(t, 2x; \lambda, q) = \frac{1}{_{q}} G_{d}(t, x; \lambda, q) K_{d}(t, x; \lambda, q). \end{aligned}
Using the above equation, we derive
\begin{aligned} \sum_{n=0}^{\infty} I_{n, 2d} (2x; \lambda, q) \frac{t^{n}}{n!} = \frac{1}{_{q}} \sum _{n=0}^{\infty} y_{7,n}(x; \lambda, q, d) \frac {t^{n}}{n!} \sum_{n=0}^{\infty} I_{n, d}(x; \lambda, q) \frac{t^{n}}{n!}. \end{aligned}
Therefore,
\begin{aligned} \sum_{n=0}^{\infty} I_{n, 2d} (2x; \lambda, q) \frac{t^{n}}{n!} = \sum_{n=0}^{\infty} \frac{1}{_{q}} \sum_{j=0}^{n} \binom{n}{j} y_{7,j}(x; \lambda, q, d) I_{n-j, d}(x; \lambda, q) \frac{t^{n}}{n!}. \end{aligned}
Comparing coefficients $$\frac{t^{n}}{n!}$$ on both sides of the above equation, we arrive at the following theorem.

### Theorem 7

\begin{aligned} I_{n, 2d} (2x; \lambda, q) = \frac{1}{_{q}} \sum _{j=0}^{n} \binom {n}{j} y_{7, j}(x; \lambda, q, d) I_{n-j, d}(x; \lambda, q). \end{aligned}

### Theorem 8

\begin{aligned} (x)_{n} = \frac{(n)_{d}}{_{q}}\sum_{j=0}^{n-d} \binom{n-d}{j} (d)_{j} \lambda^{d+j}y_{7, n+d-j}(x; \lambda, q, d) + y_{7,n}(x; \lambda, q, d), \end{aligned}
where $$(d)_{j} = d(d-1)\cdots(d-j+1)$$.

### Proof

By definition of $$y_{7,n} (x; \lambda, q, d)$$, we have
\begin{aligned}{} _{q}(1+\lambda t)^{x} = t^{d} \sum _{n=0}^{\infty}\frac {(d)_{n}}{n!} \lambda^{d+n} t^{n} \sum_{n=o}^{\infty} y_{7,n}(x; \lambda, q, d)\frac{t^{n}}{n!}. \end{aligned}
After some calculation in the above equation, we get
\begin{aligned}{} _{q}\sum_{n=0}^{\infty} \lambda^{n} (x)_{n}\frac{t^{n}}{n!}={}& t^{d} \sum _{n=0}^{\infty}\sum_{j=0}^{n} \binom{n}{j} (d)_{j} \lambda ^{d+j} y_{7, n-j}(x; \lambda, q, d)\frac{t^{n}}{n!} \\ &{}+ \sum_{n=o}^{\infty} y_{7,n}(x; \lambda, q, d)\frac{t^{n}}{n!} \\ ={}& \sum_{n=o}^{\infty} (n)_{d} \sum _{j=0}^{n-d}\binom{n-d}{j}(d)_{j} \lambda^{d+j} y_{7, n+d-j}(x; \lambda, q, d)\frac{t^{n}}{n!} \\ & {}+ \sum_{n=o}^{\infty} y_{7,n}(x; \lambda, q, d)\frac{t^{n}}{n!}. \end{aligned}
□

## 3 Inequalities for Stirling numbers of the second kind and finite combinatorial sums

Bonferroni’s inequalities, also known as Boole’s inequality, are dependent on probability and also associated with the principle of inclusion and exclusion; for detailed information as regards these inequalities see the work of Comtet and Wagner [4, 23].

We mention an open question for bounds for $$y_{7, n}(\lambda, q, d)$$.

By using (3), we also have the following well-known explicit Stirling numbers of the second kind:
\begin{aligned} S^{*}(n, k; m) = \sum_{j=1}^{m} (-1)^{j-1} \binom{k}{j} (k-j)^{n} \end{aligned}
(11)
for $$n, m, k \in\mathbb{N}$$.

By using Bonferroni’s inequalities the above finite sum satisfies the following well-known inequalities:

If $$m= k-1$$, $$S^{*}(n, k; m) = k^{n}-k!S_{2}(n, k)$$.

If m is an odd integer and $$m < k-1$$ we have $$S^{*}(n, k; m) > k^{n} - k!S_{2}(n, k)$$.

If m is an even integer and $$m < k-1$$ we have $$S^{*}(n, k; m) < k^{n} - k!S_{2}(n, k)$$.

Wagner  gave proofs of the above results.

### Lemma 1

If $$m = k-1$$, we have
\begin{aligned} S^{*}(n, k; k-1) \geq k^{n} \biggl(1- \frac{k!}{n}\binom{n}{k} k^{1-k} \biggr). \end{aligned}
(12)

### Proof

Upper bound for the $$S_{2}(n, k)$$ is given as follows :
\begin{aligned} S_{2}(n, k) \leq\binom{n-1}{k-1} k^{n-k}. \end{aligned}
Since
\begin{aligned} S^{*}(n, k; k-1) = k^{n}-k!S_{2}(n, k) \end{aligned}
if $$m= k-1$$, we obtain
\begin{aligned} S^{*}(n, k; k-1) \geq k^{n} k! \binom{n-1}{k-1} k^{n-k}. \end{aligned}
After some elementary calculation, we complete proof of Lemma 1. □

### Lemma 2

If $$m = k-1$$, we have
\begin{aligned} S^{*}(n, k; k-1) \leq k^{n} \biggl( 1- \frac{k!}{k^{k}} \biggr). \end{aligned}
(13)

### Proof

The lower bound for the $$S_{2}(n, k)$$ is given as follows:
\begin{aligned} S_{2}(n, k) \geq k^{n-k} \end{aligned}
(cf. ).
Since
\begin{aligned} S^{*}(n, k; k-1) = k^{n}-k!S_{2}(n, k) \end{aligned}
if $$m= k-1$$, we obtain
\begin{aligned} S^{*}(n, k; k-1) \leq k^{n} - k! k^{n-k}. \end{aligned}
After some elementary calculation, we complete proof of Lemma 2. □

Combining (12) and (13), we get bounds for $$S^{*}(n, k; m)$$ by the following theorem.

### Theorem 9

\begin{aligned} k^{n} \biggl(1-\frac{k!}{n}\binom{n}{k} k^{1-k} \biggr) \leq S^{*}(n, k; k-1) \leq k^{n} \biggl( 1- \frac{k!}{k^{k}} \biggr). \end{aligned}
(14)

Open Problem. By using (12) and (13), is it possible to find bounds for $$y_{7,n}(\lambda, q, d)$$ with the help of Theorem 2?

## Declarations

### Acknowledgements

The first author was supported by the Scientific Research Project Administration of Akdeniz University. This paper is dedicated to the 70th anniversary of birth of the eminent mathematician and Academician professor Gradimir V. Milovanovic.

Not applicable.

Not applicable.

### Authors’ contributions

All the authors participated in every phase of the research conducted for this paper. All authors read and approved the final manuscript.

### Competing interests

The authors declare that they have no competing interests.

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

## Authors’ Affiliations

(1)
Department of Mathematics, Faculty of Science, University of Akdeniz, Antalya, Turkey
(2)
Department of Mathematics and Institute of Pure and Applied Mathematics, Chonbuk National University, Chonju, South Korea

## References

Advertisement 