Next Article in Journal
Small Wind Turbine Blade Design and Optimization
Previous Article in Journal
Complex Patterns to the (3+1)-Dimensional B-type Kadomtsev-Petviashvili-Boussinesq Equation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

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

1
Department of Mathematics and Institute of Pure and Applied Mathematics, Jeonbuk National University, Jeonju 54896, Korea
2
Department of Mathematics, Faculty of Science, University of Akdeniz, TR-07058 Antalya, Turkey
*
Author to whom correspondence should be addressed.
Symmetry 2020, 12(1), 9; https://doi.org/10.3390/sym12010009
Submission received: 2 December 2019 / Revised: 16 December 2019 / Accepted: 17 December 2019 / Published: 19 December 2019

Abstract

:
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.

1. 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.
( x ) v = x ( x 1 ) ( x v + 1 ) ,
( x ) 0 = 1 and
x v = ( x ) v v ! ,
where v N 0 and
( z ) v = ( 1 ) v ( z ) v = z ( z + 1 ) ( z + v 1 )
(cf. References [1,3,4,5,6,7,8,9,10]).
In order to give the results of this paper, we need the following generating functions for special polynomials and numbers.
The Euler polynomials of order k are defined by
F E ( t , x ; k ) = 2 e t + 1 k e t x = n = 0 E n ( k ) x t n n ! .
(cf. References [1,3,4,5,6,7,8,9,10]).
Substituting k = 0 into (1), we have
E n ( 0 ) x = x n .
Substituting x = 0 into (1), we have the Euler numbers of order k:
E n ( k ) = E n ( k ) ( 0 ) ,
and substituting x = 0 and k = 1 into (1), we have the Euler numbers:
E n = E n ( 1 )
(cf. References [1,3,4,5,6,7,8,9,10]).
The Stirling numbers of the first kind are defined by
F S 1 ( t , k ) = ( log ( 1 + t ) ) k k ! = n = 0 S 1 ( n , k ) t n n ! .
From the above function, if k > n , then we have
S 1 ( n , k ) = 0 . .
These numbers can also be written as
( x ) n = l = 0 n S 1 ( n , l ) x l
(cf. References [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43]).
The λ -Stirling numbers are defined by
F S 2 ( t , k ; λ ) = ( λ e t 1 ) k k ! = n = 0 S 2 ( n , k ; λ ) t n n ! ,
(cf. References [31,35,43]).
Setting λ = 1 in (5), we have the Stirling numbers of the second kind:
S 2 ( n , k ) = S 2 ( n , k ; 1 ) .
If k > n , then we have
S 2 ( n , k ) = 0
(cf. References [1,2,3,4,5,6,7,8,9,11,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46]).
The Bernoulli polynomials of the second kind are defined by
F B 2 ( t , x ) = t log ( 1 + t ) ( 1 + t ) x = n = 0 b n x t n n !
and also
b n x = x x + 1 ( z ) n d z
(cf. see, for detail, References ([33], pp. 113–117)). When x = 0 , we have the Bernoulli numbers of the second kind (cf. References [13,14], ([33], pp. 113–117)).
The Peters polynomials are defined by
F P t , x ; λ , μ = 1 + t x 1 + 1 + t λ μ = n = 0 s n x ; λ , μ t n n ! ,
where x , t C (cf. References [2,16,17,18,19,20,21,22,23]).
The Peters polynomials are including some well-known families of special polynomials and numbers such as the Boole polynomials and numbers, the Bernoulli polynomials and numbers, the Euler polynomials and numbers, the Stirling numbers, the Changhee polynomials and numbers and other combinatorial polynomials and numbers.
Substituting μ = 1 into (9), we have ξ n ( x ) = s n x ; λ , 1 denotes the Boole polynomials (cf. References [14,33]).
Let m be any integer. The Changhee polynomials of order m are given by the following generating function:
F ( t , x , m ) = 2 m ( 1 + t ) x 2 + t m = n = 0 C h n ( m ) ( x ) t n n ! .
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:
2 d ( 2 + t ) d = n = 0 C h n ( d ) t n n ! ,
which, for d = 1 , yields C h n ( x ) = C h n ( 1 ) ( x ) , which denote Changhee polynomials and C h n = C h n ( 0 ) , which denotes Changhee numbers. These numbers are given by
C h n = 1 2 n n !
(cf. References [17,19]).
(2) Let m = 0 . By using Equation (10), we get the following generating function:
( 1 + t ) x = n = 0 C h n ( 0 ) ( x ) t n n ! .
(3) Let m = k and k N . We modified Equation (10). Thus, we define Changhee polynomials of order k , C h n ( k ) ( x ) , by means of the following generating function:
H ( t , x , k ) = ( 1 + t ) x 2 + t k 2 k = n = 0 C h n ( k ) ( x ) t n n ! .
Here C h n ( k ) ( 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:
K ( t , k ) = ( 2 + t ) k 2 k = n = 0 C h n ( k ) t n n ! .
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
C h n ( 0 ) ( x ) = x ( x 1 ) ( x n + 1 ) .
Few values of the polynomials C h n ( 0 ) ( x ) are given as follows:
C h 0 ( 0 ) ( x ) = 1 , C h 1 ( 0 ) ( x ) = x , C h 2 ( 0 ) ( x ) = x 2 x , C h 3 ( 0 ) ( x ) = x 3 3 x 2 2 x ,
Therefore, with help of Equation (4), we obtain a relation between the polynomials C h n ( 0 ) ( x ) and the Stirling numbers of the first kind by the following formula:
C h n ( 0 ) ( x ) = l = 0 n S 1 ( n , l ) x l .

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.
The numbers y 1 ( n , k ; λ ) is defined by
F y 1 ( t , k ; λ ) = 1 k ! ( λ e t + 1 ) k = n = 0 y 1 ( n , k ; λ ) t n n ! .
(cf. Reference [8]).
By Equation (8) in [8], we have
y 1 ( n , k ; λ ) = 1 k ! j = 0 n k j j n λ j , ( n N 0 ) .
(cf. Reference [8], Theorem 1).
Also we have
y 1 ( n , k ; λ ) = j = 0 n k j j ! S 2 ( n , j ) λ j ( λ + 1 ) k j .
(cf. Reference [47], Equation (16)).
Substituting λ = 1 into the aforementioned equation, we have
B ( n , k ) = k ! y 1 ( n , k ; 1 ) = m t m ( e t 1 ) k | t = 0 .
(cf. References [1,8,15]).
The numbers y 3 ( n , k ; λ , a , b ) is defined by
F y 3 ( t , k ; λ , a , b ) = e b k t k ! λ e ( a b ) t + 1 k = n = 0 y 3 ( n , k ; λ , a , b ) t n n ! .
(cf. Reference [9]).
By Equation (19), we have
y 3 ( n , k ; λ , a , b ) = 1 k ! j = 0 k k j λ j ( b k + j ( a b ) ) n .
(cf. Reference [9]).
The numbers y 4 ( n , k ; λ , a , b ) are defined by
F y 4 ( t , k ; λ , a , b ) = e b t k ( a + b + 1 ) k ( e ( a b ) t + λ ) k = n = 0 y 4 ( n , k ; λ , a , b ) t n n ! .
(cf. Reference [39]).
By using (20), we have
y 4 ( n , k ; λ , a , b ) = 1 ( a + b + 1 ) k j = 0 k k j λ j ( b k + j ( a b ) ) n
and
y 4 ( n , k ; λ , a , b ) = k ! λ k ( a + b + 1 ) k y 3 ( n , k ; λ 1 , a , b )
(cf. Reference [39]).
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 ) .

2. 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
H ( t , x , k ) = ( 1 + t ) x K ( t , k ) .
By using the above relation, we obtain
n = 0 C h n ( k ) ( x ) t n n ! = n = 0 ( x ) n t n n ! n = 0 C h n ( k ) t n n ! .
Therefore
n = 0 C h n ( k ) ( x ) t n n ! = n = 0 j = 0 n n j ( x ) j C h n j ( k ) t n n ! .
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
C h n ( k ) ( x ) = j = 0 n n j ( x ) j C h n j ( k ) .
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:
H ( e t 1 , x , k ) = F E ( t , x ; k ) .
Combining the above functional equation with (1) and (5), we obtain
m = 0 E m ( k ) x t m m ! = n = 0 C h n ( k ) ( x ) F S 2 ( t , n ; 1 ) .
Combining the left side of the above equation with Equation (5) and after the necessary algebraic computations, we get the following result:
m = 0 E m ( k ) x t m m ! = n = 0 C h n ( k ) ( x ) m = 0 S 2 ( m , n ) t m m ! .
Since S 2 ( m , n ) = 0 for n > m , the aforementioned equation reduces to the following equation:
m = 0 E m ( k ) x t m m ! = m = 0 n = 0 m C h n ( k ) ( x ) S 2 ( m , n ) t m m ! .
Comparing the coefficients of t n n ! on the both sides of the aforementioned equation, we arrive at the following theorem.
Theorem 2.
Let m N 0 . Then we have
E m ( k ) x = n = 0 m C h n ( k ) ( x ) S 2 ( m , n ) .
In Reference [8], Simsek gave the following formula:
E m ( k ) = 2 k B ( m , k ) .
Combining (22) with (23), we arrive at the following theorem:
Theorem 3.
Let m N 0 . Then we have
B ( m , k ) = 2 k n = 0 m C h n ( k ) S 2 ( m , n ) .

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
1 2 k j = 0 k k j ( 1 + t ) j + x = n = 0 C h n ( k ) ( x ) t n n ! .
We assume that | t | < 1 . Thus, we get
n = 0 1 2 k j = 0 k k j ( x + j ) n t n n ! = n = 0 C h n ( k ) ( x ) t n n ! .
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.
Theorem 4.
Let n N 0 . Then we have
C h n ( k ) ( x ) = 1 2 k j = 0 k l = 0 n k j n l ( j ) n l ( x ) l .
Computation formula for the negative order Changhee numbers is given by the following theorem.
Theorem 5.
Let n N 0 . Then we have
C h n ( k ) = 1 2 k j = 0 k k j ( j ) n .
Proof. 
By applying binomial theorem to Equation (15) with | t | < 1 , we get
1 2 k n = 0 j = 0 k k j j n t n = n = 0 C h n ( k ) t n n ! .
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:
Corollary 1.
Let n N 0 . Then we have
C h n ( k ) ( x ) = l = 0 n n l ( x ) l C h n l ( k ) .
We now give some alternative computation formula for the Changhee numbers of order k . Combining (4) with (26), we get the following corollary:
Corollary 2.
Let n N 0 . Then we have
C h n ( k ) = 1 2 k j = 0 k m = 0 n k j S 1 ( n , m ) j m .
Combining (18) with (28), we get the following corollary:
Corollary 3.
Let n N 0 . Then we have
C h n ( k ) = 1 2 k m = 0 n k j S 1 ( n , m ) B ( m , k ) .
By using (24), we have the following result:
Corollary 4.
Let n N 0 . Then we have
C h n ( k ) ( x ) = 1 2 k j = 0 k k j ( x + j ) n .
Combining (24) with (4), we have the following result:
Corollary 5.
C h n ( k ) ( x ) = 1 2 k j = 0 k l = 0 n k j S 1 ( n , l ) x + j l .
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.

3. 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 C h n ( k ) ( x ) .
By applying partial derivative operators x and t to Equation (14), we get the following partial derivative equations, respectively:
m x m H ( t , x ; k ) = m ! H ( t , x , k ) F S 1 ( t , m )
and
t H ( t , x ; k ) = 2 k H ( t , x , 1 k ) + x H ( t , x 1 , k ) ,
or
t H ( t , x ; k ) = k 2 F ( t , 0 , 1 ) H ( t , x , k ) + x H ( t , x 1 , k ) .
By combining (32) with (2), we get
n = 0 m x m C h n ( k ) ( x ) t n n ! = m ! n = 0 C h n ( k ) ( x ) t n n ! j = 0 S 1 ( n , m ) t j j ! .
Therefore
n = 0 m x m C h n ( k ) ( x ) t n n ! = m ! n = 0 j = 0 n n j C h j ( k ) ( x ) S 1 ( n j , m ) t n n ! .
Comparing the coefficients of t n n ! on the both sides of the aforementioned equation, we arrive at the following theorem.
Theorem 6.
Let m N . Then we have
m x m C h n ( k ) ( x ) = m ! j = 0 n n j C h j ( k ) ( x ) S 1 ( n j , m ) .
By combining (33) with (14), we obtain
n = 1 C h n ( k ) ( x ) t n 1 ( n 1 ) ! = 2 k n = 0 C h n ( 1 k ) ( x ) t n n ! + x n = 0 C h n ( k ) ( x 1 ) t n n ! .
Therefore
n = 0 C h n + 1 ( k ) ( x ) t n n ! = n = 0 2 k C h n ( 1 k ) ( x ) + x C h n ( k ) ( x 1 ) t n n ! .
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
C h n + 1 ( k ) ( x ) = 2 k C h n ( 1 k ) ( x ) + x C h n ( k ) ( x 1 ) .
By combining (34) with (10) and (14), we get
n = 1 C h n ( k ) ( x ) t n 1 ( n 1 ) ! = k 2 n = 0 j = 0 n n j C h n j C h n ( k ) ( x ) t n n ! + x n = 0 C h n ( k ) ( x 1 ) t n n ! .
Comparing the coefficients of t n n ! on the both sides of the aforementioned equation, we arrive at the following theorem.
Theorem 8.
Let n N 0 . Then we have
C h n + 1 ( k ) ( x ) = k j = 0 n ( 1 ) n j n ! j ! 2 n j + 1 C h j ( k ) ( x ) + x C h n ( k ) ( x 1 ) .

4. 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.

4.1. 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 C h n ( k ) ( x ) .
Theorem 9.
Let n N . Then we have
u u + 1 C h n 1 ( k ) ( x ) d x = j = 0 n n j b n j ( 0 ) C h j ( k ) ( u + 1 ) C h j ( k ) ( u ) n .
Proof. 
Integrating both side of Equation (10) from u to u + 1 , we get
t u u + 1 H ( t , x , k ) d x = F b 2 ( t , 0 ) H ( t , u + 1 , k ) H ( t , u , k ) .
We assume that this series is uniformly convergent. In this case, we can rearrange the summation and integration.
n = 0 n u u + 1 C h n 1 ( k ) ( x ) d x t n n ! = n = 0 b n ( 0 ) t n n ! m = 0 C h j ( k ) ( u + 1 ) C h j ( k ) ( u ) t m m ! .
By using the Cauchy product rule, we get
n = 0 n u u + 1 C h n 1 ( k ) ( x ) d x t n n ! = n = 0 j = 0 n n j b n j ( 0 ) C h j ( k ) ( u + 1 ) C h j ( k ) ( u ) t n n ! .
Comparing the coefficients of t n n ! on the both sides of the aforementioned equation, we arrive arrive at the desired result. □
By using (8) and (25), we get
u u + 1 C h n 1 ( k ) ( x ) d x = 1 2 k j = 0 k l = 0 n k j n l ( j ) n 1 b l ( u ) .
By using (8) and (27), we have
u u + 1 C h n 1 ( k ) ( x ) d x = l = 0 n n l b l ( u ) C h n l ( k ) .

4.2. 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
Z p f x d μ 1 x = lim N 1 p N x = 0 p N 1 f x ,
where μ 1 x is given as follows:
μ 1 x = 1 p N
(cf. References [34,40,48]; see also the references cited in each of these earlier works).
The Daehee numbers D n are defined by
D n = Z p ( x ) n d μ 1 x = ( 1 ) n n ! n + 1 ,
where n N 0 (cf. References [18,34,40]). By (41), it easily see that
Z p ( x ) n d μ 1 x = l = 0 n S 1 ( n , l ) B l ,
where B l denotes the Bernoulli numbers and n N 0 (cf. Reference [18]).
The fermionic p-adic integral is defined by
Z p f x d μ 1 x = lim N x = 0 p N 1 1 x f x ,
where μ 1 x is given as follows:
μ 1 x = 1 x
(cf. [26], see also References [24,40]; see also the references cited in each of these earlier works).
The Changhee numbers C h n are defined by
C h n = Z p ( x ) n d μ 1 x = ( 1 ) n 2 n n ! ,
where n N 0 (cf. Reference [17]).
By applying the Volkenborn integral to (21), we have
Z p C h n ( k ) ( x ) d μ 1 x = j = 0 n n j C h n j ( k ) Z p ( x ) j d μ 1 x .
Combining the aforementioned equation with (41), we get the following Volkenborn integral representation for negative order Changhee polynomials:
Z p C h n ( k ) ( x ) d μ 1 x = j = 0 n ( 1 ) j n j j ! C h n j ( k ) j + 1
and
Z p C h n ( k ) ( x ) d μ 1 x = j = 0 n n j D j C h n j ( k ) .
By applying fermionic p-adic integral to (21), we have
Z p C h n ( k ) ( x ) d μ 1 x = j = 0 n n j C h n j ( k ) Z p ( x ) j d μ 1 x .
By (41) and (47), we obtain the following fermionic p-adic integral representation for negative order Changhee polynomials:
Z p C h n ( k ) ( x ) d μ 1 x = j = 0 n ( 1 ) j n j j ! C h n j ( k ) 2 j
and
Z p C h n ( k ) ( x ) d μ 1 x = j = 0 n n j C h j C h n j ( k ) .
By using (14), we have
n = 0 ( x ) n t n n ! = n = 0 j = 0 k k j 2 2 k j ( n ) j C h n j ( k ) ( x ) t n n ! .
Comparing the coefficients of t n n ! on the both sides of the aforementioned equation, we get
( x ) n = j = 0 k k j 2 2 k j ( n ) j C h n j ( k ) ( x ) .
By applying the Volkenborn integral to the aforementioned equation, we obtain
Z p ( x ) n d μ 1 x = j = 0 k k j 2 2 k j ( n ) j Z p C h n j ( k ) ( x ) d μ 1 x .
Combining the aforementioned equation with (41), we obtain
j = 0 k k j 2 2 k j ( n ) j Z p C h n j ( k ) ( x ) d μ 1 x = ( 1 ) n n ! n + 1 .
By applying fermionic p-adic integral to Equation (50), we get
Z p ( x ) n d μ 1 x = j = 0 k k j 2 2 k j ( n ) j Z p C h n j ( k ) ( x ) d μ 1 x .
Combining the aforementioned equation with (44), we obtain
j = 0 k k j 2 2 k j ( n ) j Z p C h n j ( k ) ( x ) d μ 1 x = ( 1 ) n n ! 2 n .

5. 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 ) .
Substituting t = λ e z 1 into (15), we get the following functional equation:
k ! 2 k F y 1 ( z , k ; λ ) = K ( λ e z 1 , k ) .
Combining the aforementioned equation with Equation (5), we get
k ! 2 k n = 0 y 1 ( n , k ; λ ) t n n ! = n = 0 C h n ( k ) m = 0 S 2 ( m , n : λ ) t m m ! .
Comparing the coefficients of t n n ! on the both sides of the aforementioned equation, we get the following theorem.
Theorem 10.
Let n N 0 . Then we have
y 1 ( n , k ; λ ) = 2 k k ! n = 0 C h n ( k ) S 2 ( m , n : λ ) .
Substituting λ = 1 into (53) and using (6), we get the following corollary:
Corollary 6.
Let n N 0 . Then we have
y 1 ( n , k ; 1 ) = 2 k k ! n = 0 m C h n ( k ) S 2 ( m , n ) .
Setting t = λ e t 1 into Equation (14), we get the following functional equation:
k ! λ k F y 3 ( t , k ; λ ; 2 , 1 ) = 2 k H ( λ e t 1 , k ; k ) .
Combining the aforementioned equation with (5), (19) and (14), we get
k ! λ k 2 k m = 0 y 3 ( m , k ; λ ; 2 , 1 ) t m m ! = n = 0 C h n ( k ) ( k ) m = 0 S 2 ( m , n ; λ ) t m m ! .
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:
Theorem 11.
Let m N 0 . Then we have
y 3 ( m , k ; λ ; 2 , 1 ) = 2 k k ! λ k n = 0 C h n ( k ) ( k ) S 2 ( m , n ; λ ) .
Substituting λ = 1 into (54), and using (6), we get the following corollary:
Corollary 7.
Let m N 0 . Then we have
y 3 ( m , k ; 1 ; 2 ; 1 ) = 2 k k ! n = 0 m C h n ( k ) ( k ) S 2 ( m , n ) .
Combining (20) with (55), we obtain the following corollary:
Corollary 8.
Let m N 0 . Then we have
y 4 ( m , k ; λ 1 ; 2 , 1 ) = 2 k n = 0 C h n ( k ) ( k ) S 2 ( m , n ; λ 1 ) .
Combining (37) and (38), we arrive at the following theorem:
Theorem 12.
Let n N 0 . Then we have
j = 0 n n j b n j ( 0 ) C h j ( k ) ( u + 1 ) C h j ( k ) ( u ) = n 2 k j = 0 k l = 0 n k j n l ( j ) n 1 b l ( u ) .
Combining (37) with (39), we arrive at the following theorem:
Theorem 13.
Let n N 0 . Then we have
j = 0 n n j b n j ( 0 ) C h j ( k ) ( u + 1 ) C h j ( k ) ( u ) = n l = 0 n n l b l ( u ) C h n l ( k ) .
Combining (52) with (48), we get the following theorem.
Theorem 14.
Let n N 0 . Then we have
j = 0 k k j 2 2 k j ( n ) j l = 0 n j ( 1 ) l n j l l ! C h n j l ( k ) 2 l = ( 1 ) n n ! 2 n .
Combining (51) with (45), we get the following theorem.
Theorem 15.
Let n N 0 . Then we have
j = 0 k k j 2 2 k j ( n ) j l = 0 n j ( 1 ) l n j l l ! C h n j l ( k ) l + 1 = ( 1 ) n n ! n + 1 .

6. Conclusions

Although many books, papers and other research theses about special functions, special numbers and polynomials have been written in recent years, active, productive and applied studies are still continuing in these fields. For this reason, generating functions for new families of special numbers and polynomials involving Changhee numbers and polynomials of negative order and combinatorial numbers are constructed. By considering these generating functions with their functional equations, integral and differential equations, various properties for negative order Changhee numbers and polynomials and some combinatorial numbers are obtained and studied. By using these equations, we derive many new and novel identities and formulas for the Bernoulli numbers and polynomials, Euler numbers and polynomials, Stirling numbers, combinatorial numbers and polynomials and Changhee numbers and polynomials. As a result, formulas, identities and relations of this paper may potentially 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.

Acknowledgments

The first author was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (NRF-2018R1D1A1B07041132). The second author was supported by the Scientific Research Project Administration of Akdeniz University.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Simsek, Y. Generation functions for finite sums involving higher powers of binomial coeffcients: Analysis of hypergeometric functions including new families of polynomials and numbers. J. Math. Anal. Appl. 2019, 477, 1328–1352. [Google Scholar] [CrossRef] [Green Version]
  2. Khan, S.; Nahid, T.; Riyasat, M. Partial derivative formulas and identities involving 2-variable Simsek polynomials. Boletín de la Sociedad Matemática Mexicana 2019. [Google Scholar] [CrossRef]
  3. Kucukoglu, I. Derivative formulas related to unification of generating functions for Sheffer type sequences. AIP Conf. Proc. 2019, 2116, 100016. [Google Scholar]
  4. Kucukoglu, I.; Simsek, Y. On a family of special numbers and polynomials associated with Apostol-type numbers and polynomials and combinatorial numbers. Appl. Anal. Discrete Math. 2019, 13, 478–494. [Google Scholar] [CrossRef] [Green Version]
  5. Kucukoglu, I.; Simsek, B.; Simsek, Y. An approach to negative hypergeometric distribution by generating function for special numbers and polynomials. Turk. J. Math. 2019, 43, 2337–2353. [Google Scholar] [CrossRef]
  6. Kucukoglu, I.; Simsek, B.; Simsek, Y. Generating Functions for New Families of Combinatorial Numbers and Polynomials: Approach to Poisson–Charlier Polynomials and Probability Distribution Function. Axioms 2019, 8, 112. [Google Scholar] [CrossRef] [Green Version]
  7. Simsek, Y. Construction of some new families of Apostol-type numbers and polynomials via Dirichlet character and p-adic q-integrals. Turk. J. Math. 2018, 42, 557–577. [Google Scholar] [CrossRef] [Green Version]
  8. Simsek, Y. New families of special numbers for computing negative order Euler numbers and related numbers and polynomials. Appl. Anal. Discrete Math. 2018, 12, 1–35. [Google Scholar] [CrossRef]
  9. Simsek, Y. Computation methods for combinatorial sums and Euler type numbers related to new families of numbers. Math. Meth. Appl. Sci. 2017, 40, 2347–2361. [Google Scholar] [CrossRef] [Green Version]
  10. Boas, R.P.; Buck, R.C. Polynomial Expansions of Analytic Functions; Academic Press: New York, NY, USA, 1964; p. 37. [Google Scholar]
  11. Simsek, Y. Peters type polynomials and numbers and their generating functions: Approach with p-adic integral method. Math. Meth. Appl. Sci. 2019, 7030–7046. [Google Scholar] [CrossRef]
  12. Cakic, N.P.; El-Desouky, B.S.; Milovanovic, G.V. Explicit formulas and combinatorial identities for generalized Stirling numbers. Mediterr. J. Math. 2013, 10, 57–72. [Google Scholar] [CrossRef]
  13. Comtet, L. Advanced Combinatorics: The Art of Finite and Infinite Expansions; Translated from the French by J. W. Nienhuys; Reidel: Dordrecht, The Netherlands; Boston, MA, USA, 1974. [Google Scholar]
  14. Jordan, C. Calculus of Finite Differences, 2nd ed.; Chelsea Pub. Comp.: New York, NY, USA, 1950. [Google Scholar]
  15. Golombek, R. Aufgabe 1088. Elem. Math. 1994, 49, 126–127. [Google Scholar]
  16. Kim, D.S.; Kim, T. Barnes-Type Boole polynomials. Contrib. Discret. Math. 2016, 11, 715. [Google Scholar]
  17. Kim, D.S.; Kim, T.; Seo, J. A note on Changhee numbers and polynomials. Adv. Stud. Theor. Phys. 2013, 7, 993–1003. [Google Scholar] [CrossRef]
  18. Kim, D.S.; Kim, T. Daehee numbers and polynomials. Appl. Math. Sci. (Ruse) 2013, 7, 5969–5976. [Google Scholar] [CrossRef] [Green Version]
  19. Kim, D.S.; Kim, T.; Seo, J.J. Higher-order Changhee numbers and polynomials. Adv. Stud. Theor. Phys. 2014, 8, 365–373. [Google Scholar] [CrossRef] [Green Version]
  20. Kim, D.S.; Kim, T.; Lee, S.H.; Seo, J. Higher-order Daehee numbers and polynomials. Int. J. Math. Anal. 2014, 8, 273–283. [Google Scholar] [CrossRef]
  21. Kim, D.S.; Kim, T. A Note on Boole polynomials. Integ. Trans. Sp. Funct. 2014, 4, 1–7. [Google Scholar] [CrossRef]
  22. Kim, D.S.; Kim, T.; Park, J.W.; Seo, J.J. Differential equations associated with Peters polynomials. Glob. J. Pure Appl. Math. 2016, 12, 2915–2922. [Google Scholar]
  23. Kim, D.S.; Kim, T.; Komatsu, T.; Kwon, H.I.; Lee, S.H. Barnes-type Peters polynomials associated with poly-Cauchy polynomials of the second kind. J. Comput. Anal. Appl. 2016, 20, 1–24. [Google Scholar]
  24. Kim, M.S. On Euler Numbers, Polynomials and Related p-adic Integrals. J. Number Theory 2009, 129, 2166–2179. [Google Scholar] [CrossRef] [Green Version]
  25. Kim, T.; Dolgy, D.V.; Kim, D.S.; Seo, J.J. Differential equations for Changhee polynomials and their applications. J. Nonlinear Sci. Appl. 2016, 9, 2857–2864. [Google Scholar] [CrossRef] [Green Version]
  26. Kim, T. q-Euler Numbers and Polynomials Associated with p-adic q-Integral and Basic q-zeta Function. Trend Math. Inf. Cent. Math. Sci. 2006, 9, 7–12. [Google Scholar]
  27. Kilar, N.; Simsek, Y. A new family of Fubini type numbers and polynomials associated with Apostol-Bernoulli numbers and polynomials. J. Korean Math. Soc. 2017, 54, 1605–1621. [Google Scholar]
  28. Kruchinin, D.V.; Kruchinin, V.V. Application of a composition of generating functions for obtaining explicit formulas of polynomials. J. Math. Anal. Appl. 2013, 404, 161–171. [Google Scholar] [CrossRef]
  29. Kwon, J.; Park, J.W. On modified degenerate Changhee polynomials and numbers. J. Nonlinear Sci. Appl. 2016, 9, 6294–6301. [Google Scholar] [CrossRef]
  30. Lim, D. Fourier series of higher-order Daehee and Changhee functions and their applications. J. Inequal. Appl. 2017, 2017, 150. [Google Scholar] [CrossRef] [Green Version]
  31. Luo, Q.-M.; Srivastava, H.M. Some generalizations of the Apostol-Genocchi polynomials and the Stirling numbers of the second kind. Appl. Math. Comput. 2011, 217, 5702–5728. [Google Scholar] [CrossRef]
  32. Rim, S.H.; Park, J.W.; Pyo, S.S.; Kwon, J. The n-th twisted Changhee polynomials and numbers. Bull. Korean Math. Soc. 2015, 52, 741–749. [Google Scholar] [CrossRef] [Green Version]
  33. Roman, S. The Umbral Calculus; Academic Press: New York, NY, USA, 1984. [Google Scholar]
  34. Schikhof, H.W. Ultrametric Calculus: An Introduction to p-Adic Analysis; Cambridge Studies in Advanced Mathematics 4; Cambridge University Press: Cambridge, UK, 1984. [Google Scholar]
  35. Simsek, Y. Generating functions for generalized Stirling type numbers, array type polynomials, Eulerian type polynomials and their applications. Fixed Point Theory Appl. 2013, 87, 343–355. [Google Scholar] [CrossRef] [Green Version]
  36. Simsek, Y. Analysis of the p-adic q-Volkenborn integrals: An approach to generalized Apostol-type special numbers and polynomials and their applications. Cogent Math. 2016, 3, 1–17. [Google Scholar] [CrossRef]
  37. Simsek, Y. Apostol type Daehee numbers and polynomials. Adv. Stud. Contemp. Math. 2016, 26, 1–12. [Google Scholar]
  38. Simsek, Y. Identities on the Changhee numbers and Apostol-Daehee polynomials. Adv. Stud. Contemp. Math. 2017, 27, 199–212. [Google Scholar]
  39. Simsek, Y. Construction method for generating functions of special numbers and polynomials arising from analysisof new operators. Math. Meth. Appl. Sci. 2018, 41, 6934–6954. [Google Scholar] [CrossRef]
  40. Simsek, Y. Explicit formulas for p-adic integrals: approach to p-adic distributions and some families of special numbers and polynomials. Montes Taurus J. Pure Appl. Math. 2019, 1, 1–76. [Google Scholar]
  41. Simsek, Y.; So, J.S. Identities, inequalities for Boole type polynomials: Approach to generating functions and infinite series. J. Inequal. Appl. 2019, 2019, 62. [Google Scholar] [CrossRef] [Green Version]
  42. Simsek, Y.; So, J.S. On generating functions for Boole type polynomials and numbers of higher order and their applications. Symmetry 2019, 11, 352. [Google Scholar] [CrossRef] [Green Version]
  43. Srivastava, H.M. Some generalizations and basic (or q-) extensions of the Bernoulli, Euler and Genocchi polynomials. Appl. Math. Inf. Sci. 2011, 5, 390–444. [Google Scholar]
  44. Srivastava, H.M.; Kucukoglu, I.; Simsek, Y. Partial differential equations for a new family of numbers and polynomials unifying the Apostol-type numbers and the Apostol-type polynomials. J. Number. Theory 2017, 181, 117–146. [Google Scholar] [CrossRef]
  45. Srivastava, H.M.; Kucukoglu, I.; Simsek, Y. A new family of Lerch-type zeta functions interpolating a certain class of higher-order Apostol-type numbers and Apostol-type polynomials. Quaest. Math. 2018, 42, 1–14. [Google Scholar]
  46. Srivastava, H.M.; Choi, J. Zeta and q-Zeta Functions and Associated Series and Integrals; Elsevier Science Publishers: Amsterdam, The Netherlands; London, UK; New York, NY, USA, 2012. [Google Scholar]
  47. Xu, A. On an open problem of Simsek concerning the computation of a family of special numbers. Appl. Anal. Discrete Math. 2019, 13, 61–72. [Google Scholar] [CrossRef]
  48. Volkenborn, A. On Generalized p-adic Integration. Mém. Soc. Math. Fr. 1974, 39–40, 375–384. [Google Scholar] [CrossRef] [Green Version]
Table 1. A few values of negative order Changhee numbers and polynomials for n = 0 , 1 , 2 , 3 , 4 .
Table 1. A few values of negative order Changhee numbers and polynomials for n = 0 , 1 , 2 , 3 , 4 .
C h n ( k ) C h n ( k ) ( x )
011
1 k 2 x + k 2
2 k 2 k 4 x 2 + ( k 1 ) x + k 2 k 4
3 k 3 3 k 2 + 4 k 8 x 3 + 3 k 2 1 x 2 + 3 k 2 9 k + 8 4 x + k 3 3 k 2 + 4 k 8
4 k 4 6 k 3 + 19 k 2 28 k 16 x 4 + ( 2 k 6 ) x 3 + 3 2 k 2 6 k + 11 x 2 + k 3 3 k 2 + 4 k 2 x + k 4 6 k 3 + 19 k 2 28 k 16 .

Share and Cite

MDPI and ACS Style

Kim, D.; Simsek, Y.; So, J.S. Identities and Computation Formulas for Combinatorial Numbers Including Negative Order Changhee Polynomials. Symmetry 2020, 12, 9. https://doi.org/10.3390/sym12010009

AMA Style

Kim D, Simsek Y, So JS. Identities and Computation Formulas for Combinatorial Numbers Including Negative Order Changhee Polynomials. Symmetry. 2020; 12(1):9. https://doi.org/10.3390/sym12010009

Chicago/Turabian Style

Kim, Daeyeoul, Yilmaz Simsek, and Ji Suk So. 2020. "Identities and Computation Formulas for Combinatorial Numbers Including Negative Order Changhee Polynomials" Symmetry 12, no. 1: 9. https://doi.org/10.3390/sym12010009

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop