Identities and Computation Formulas for Combinatorial Numbers Including Negative Order Changhee Polynomials

: The purpose of this paper is to construct generating functions for negative order Changhee numbers and polynomials. Using these generating functions with their functional equation, we prove computation formulas for combinatorial numbers and polynomials. These formulas include Euler numbers and polynomials of higher order, Stirling numbers, and negative order Changhee numbers and polynomials. We also give some properties of these numbers and polynomials with their generating functions. Moreover, we give relations among Changhee numbers and polynomials of negative order, combinatorial numbers and polynomials and Bernoulli numbers of the second kind. Finally, we give a partial derivative of an equation for generating functions for Changhee numbers and polynomials of negative order. Using these differential equations, we derive recurrence relations, differential and integral formulas for these numbers and polynomials. We also give p -adic integrals representations for negative order Changhee polynomials including Changhee numbers and Deahee numbers.


Introduction
The finite sums of powers of binomial coefficients with combinatorial numbers and polynomials have been used in almost all areas of mathematics, probability theory, statistics, physics, computer science and the other applied sciences. These sums are also used to construct mathematical models. Recently, generating functions including combinatorial numbers and polynomials, and also the finite sums of powers of binomial coefficients in terms of the hypergeometric functions, were given by Simsek [1]. By using these functions, many computation formulas and relations including these sums and various kinds of special numbers and polynomials have been given (cf. References [1][2][3][4][5][6][7][8][9]).
In recent years, using different methods and techniques, negative order special numbers and polynomials, which are negative order Bernoulli polynomials and negative order Euler polynomials, have been studied by many mathematicians. In this paper, we investigate and study generating functions for negative order Changhee polynomials and numbers. By using these functions with combinatorial numbers, we give many new formulas and identities including Bernoulli numbers and polynomials of the second kind, Euler numbers and polynomials, Stirling numbers and combinatorial numbers and polynomials. The goal of this paper is to give computation formulas for negative order Changhee polynomials and numbers including the finite sums of powers of binomial sums.
In this paper we use the following notations and definitions: Let N = {1, 2, 3, . . . }, which denotes set of natural numbers. Let N 0 = N ∪ {0}. Let Z, R, and C denote respectively sets of integer numbers, real numbers, complex numbers, respectively.
Let m be any integer. The Changhee polynomials of order m are given by the following generating function: Let us examine the generating function in the Equation (10) for some special cases of integer m as follows: (1) Let m = d and d ∈ N. Then, we have Changhee polynomials of order d (cf. Reference [19]). Setting x = 0 into Equation (10), we have Changhee numbers of order d, which defined by means of the following generating function: which, for d = 1, yields Ch n (x) = Ch (1) n (x), which denote Changhee polynomials and Ch n = Ch n (0), which denotes Changhee numbers. These numbers are given by (cf. References [17,19]).
(2) Let m = 0. By using Equation (10), we get the following generating function: (3) Let m = −k and k ∈ N. We modified Equation (10). Thus, we define Changhee polynomials of order −k, Ch (−k) n (x), by means of the following generating function: Here Ch (−k) n (x) are called negative order Changhee polynomials. Setting x = 0 into Equation (14), we get Changhee numbers of order −k. These numbers are given by the following generating function: In next Sections, we investigate some properties of the negative order Changhee polynomials. These polynomials and numbers have various relations with many well-known families of special numbers and polynomial. In particular, their relationships to combinatoric numbers are very interesting and they have very important results. These are discussed in detail in the following sections.
By using Equation (13), we have Few values of the polynomials Ch n (x) are given as follows: n (x) and the Stirling numbers of the first kind by the following formula:

Combinatorial Numbers
Here, we give some well-known combinatorial numbers and their generating functions. Some formulas and relations between these numbers and negative order Changhee polynomials and numbers are given in the following sections.
Results of this paper are briefly summarized below.
In Section 2, with help of generating functions and their functional equations, some properties of Changhee numbers and polynomials of negative order are given. By using these functional equations, we derive computation formulas for negative order Changhee polynomials.
In Section 3, we give partial derivative equations for the generating function of the negative order Changhee polynomials. By using these partial differential equations, we derive differential formulas for the negative order Changhee polynomials.
In Section 4, we give integral representations of negative order Changhee polynomials.
In Section 5, we give some identities and relations including Bernoulli numbers and polynomials of the second kind, Euler numbers and polynomials, Stirling numbers, negative order Changhee numbers and polynomials and combinatorial numbers and polynomials such as the special numbers y 1 (n, k; λ), y 3 (n, k; λ, a, b), y 4 (n, k; λ, a, b), and B(n, k).

Changhee Polynomials of Negative Order
In this section, we investigate some properties of negative order Changhee numbers and polynomials.
With the help of functional equations including generating functions for special numbers and polynomials, in this section we give relations between negative order Changhee polynomials, negative order Euler polynomials, and combinatorial numbers including the Stirling numbers of the first kind, and combinatorial numbers such as the numbers y 1 (n, k; λ), y 3 (n, k; λ, a, b), y 4 (n, k; λ, a, b), and B(n, k).
Combining (14) and (15), we get By using the above relation, we obtain Comparing the coefficients of t n n! on the both sides of the aforementioned equation, we arrive at the following theorem. Theorem 1. Let n ∈ N 0 . Then we have We note that Equation (14) is related to some well-known special numbers and polynomials. That is, replace t by e t − 1 into (14), we have the following functional equation: Combining the above functional equation with (1) and (5), we obtain Combining the left side of the above equation with Equation (5) and after the necessary algebraic computations, we get the following result: Since S 2 (m, n) = 0 for n > m, the aforementioned equation reduces to the following equation: Comparing the coefficients of t n n! on the both sides of the aforementioned equation, we arrive at the following theorem.

Computation Formula for Changhee Polynomials of Negative Order
Here we give some computation formulas for Changhee polynomials of negative order from (14). By using Equation (14), we get We assume that |t| < 1. Thus, we get Comparing the coefficients of t n n! on the both sides of the aforementioned equation and using Vandermonde's identity, we get the following theorem.
Computation formula for the negative order Changhee numbers is given by the following theorem.
Theorem 5. Let n ∈ N 0 . Then we have Proof. By applying binomial theorem to Equation (15) with |t| < 1, we get Comparing the coefficients of t n n! on the both sides of the aforementioned equation, we arrive at the desired result.
Combining (25) with (26), we get the following corollary: We now give some alternative computation formula for the Changhee numbers of order −k. Combining (4) with (26), we get the following corollary: Combining (18) with (28), we get the following corollary: By using (24), we have the following result: Combining (24) with (4), we have the following result: By using (28) or (29) with help of Equation (1) in the work of Simsek [1], a few values of the Changhee numbers and polynomials of order −k for are n = 0, 1, 2, 3, 4 given in Table 1.

Partial Derivative of the Generating Function H(t, x, −k)
In this section, we consider partial derivative of Equation (14) with respect to x and t, we get two partial differential equations for the function H(t, x, −k). By using these equations, we give derivative formulas and a recurrence relation for the polynomials Ch (−k) n (x). By applying partial derivative operators ∂ ∂x and ∂ ∂t to Equation (14), we get the following partial derivative equations, respectively: and By combining (32) with (2), we get Comparing the coefficients of t n n! on the both sides of the aforementioned equation, we arrive at the following theorem.
By combining (33) with (14), we obtain Comparing the coefficients of t n n! on the both sides of the aforementioned equation, we arrive at the following theorem.
Theorem 7. Let m ∈ N. Then we have By combining (34) with (10) and (14), we get Comparing the coefficients of t n n! on the both sides of the aforementioned equation, we arrive at the following theorem.

Integral Representations for Negative Order Changhee Polynomials
In this section, we give p-adic integrals and the Riemann integral representations for negative order Changhee polynomials.

Riemann Integral Representation for Negative Order Changhee Polynomials
We integrate the Equation (14) over x in order to get an integral equation for the function H(t, x, −k). By using these equations, we give integral formulas and recurrence relations for the polynomials Ch Proof. Integrating both side of Equation (10) from u to u + 1, we get We assume that this series is uniformly convergent. In this case, we can rearrange the summation and integration.
By using the Cauchy product rule, we get Comparing the coefficients of t n n! on the both sides of the aforementioned equation, we arrive arrive at the desired result.

p-Adic Integral Representations for Negative Order Changhee Polynomials
Let Z p denote the set of p-adic integers. The Volkenborn integral is defined by where µ 1 (x) is given as follows: References [34,40,48]; see also the references cited in each of these earlier works). The Daehee numbers D n are defined by where n ∈ N 0 (cf. References [18,34,40]). By (41), it easily see that where B l denotes the Bernoulli numbers and n ∈ N 0 (cf. Reference [18]). The fermionic p-adic integral is defined by where µ −1 (x) is given as follows: [26], see also References [24,40]; see also the references cited in each of these earlier works). The Changhee numbers Ch n are defined by where n ∈ N 0 (cf. Reference [17]). By applying the Volkenborn integral to (21), we have Combining the aforementioned equation with (44), we obtain

Identities and Relations
In this section, by using generating functions and their functional equations, we give many interesting and novel identities and relations including Bernoulli numbers and polynomials of the second kind, Euler numbers and polynomials, Stirling numbers, negative order Changhee numbers, and combinatorial numbers such as y 1 (n, k; λ), y 3 (n, k; λ, a, b), and B(n, k).
Combining the aforementioned equation with Equation (5) Comparing the coefficients of t n n! on the both sides of the aforementioned equation, we get the following theorem.
Combining the aforementioned equation with (5), (19) and (14), we get Therefore, after comparing the coefficients of t m m! on the both sides of the aforementioned equation and some calculation, we arrive at the following theorem: Substituting λ = 1 into (54), and using (6), we get the following corollary: be used, not only in mathematics, but also in mathematical physics, computer sciences, engineering, and so forth.
Author Contributions: All authors contribute equally to this paper. All authors have read and agreed to the published version of the manuscript.
Funding: This research received no external funding.