Next Article in Journal
Protectability of IBMQ Qubits by Dynamical Decoupling Technique
Previous Article in Journal
On Convex Ordered Hyperrings
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Note on Higher Order Degenerate Changhee–Genocchi Numbers and Polynomials of the Second Kind

Department of Mathematics, Inner Mongolia University, Huhhot 010020, China
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(1), 56; https://doi.org/10.3390/sym15010056
Submission received: 27 August 2022 / Revised: 18 September 2022 / Accepted: 22 September 2022 / Published: 26 December 2022

Abstract

:
In this paper, we consider the higher order degenerate Changhee–Genocchi polynomials of the second kind by using generating functions and the Riordan matrix methods. At the same time, we give some properties of the higher order degenerate Changhee–Genocchi polynomials of the second kind. In addition, we establish some new equalities involving the higher order degenerate Changhee–Genocchi polynomials of the second kind, the generalized Bell polynomials, higher order Changhee polynomials, the higher order degenerate Daehee polynomials of the second kind, Lah numbers and Stirling numbers, etc.

1. Introduction

At first, in 1979, Carlitz studied and discovered about degenerate combinatorial numbers and polynomials, and named degenerate Bernoulli and Euler numbers and polynomials ([1,2]). In recent years, the classical combinatorial numbers and polynomials have been extended to different degrees by using the generating function method, the Riordan array method, and the asymptotic counting method, the probabilistic method, umbral calculus, and so on. Through these methods, the basic properties of combinatorial sequences can be studied, as well as some symmetric forms, the simplification of multiple sums to single sums, etc. In 2009, Taekyun Kim gave some properties of Genocchi numbers and polynomials ([3]). More degenerate versions of classical combinatorial numbers and polynomials are discovered and derived. In 2017, Kim et al. studied the degenerate Changhee–Genocchi polynomials and numbers of the second kind and gave some new identities ([4]). In this paper, we derive some identities involving the higher order degenerate Changhee–Genocchi polynomials and numbers of the second kind and special combination sequences.
The higher order degenerate Changhee–Genocchi polynomials of the second kind are defined by the following generating function in ([4]).
2 l o g ( 1 + t ) 1 + λ l o g ( 1 + t ) 1 λ + 1 r 1 + λ l o g ( 1 + t ) x λ = n = 0 J n , λ ( r ) ( x ) t n n ! . ( λ R )
When r = 1 , 2 l o g ( 1 + t ) 1 + λ l o g ( 1 + t ) 1 λ + 1 1 + λ l o g ( 1 + t ) x λ = n = 0 J n , λ ( x ) t n n ! are called the degenerate Changhee–Genocchi polynomials of the second kind.
The generating functions of the relevant special combinatorial sequences involved in this paper are as follows: (see [1,2,3,5,6,7,8,9,10,11,12,13,14])
The higher order degenerate Euler polynomials are defined by the following generating function to be
2 1 + λ t 1 λ + 1 r 1 + λ t x λ = n = 0 ε n , λ ( r ) ( x ) t n n ! . ( λ R )
The negative order degenerate Euler polynomials are defined by the following generating function to be
1 + λ t 1 λ + 1 2 r 1 + λ t x λ = n = 0 ε n , λ ( r ) ( x ) t n n ! . ( λ R )
The higher order degenerate Genocchi polynomials are defined by the following generating function to be
2 t 1 + λ t 1 λ + 1 r 1 + λ t x λ = n = 0 G n , λ ( r ) ( x ) t n n ! . ( λ R )
The higher order degenerate Changhee polynomials of the second kind are defined by the following generating function to be
2 1 + λ l o g ( 1 + t ) 1 λ + 1 r 1 + λ l o g ( 1 + t ) x λ = n = 0 C h n , λ ( r ) ( x ) t n n ! . ( λ R )
The higher order degenerate Daehee polynomials of the second kind are defined by the following generating function to be
l o g ( 1 + t ) 1 + λ l o g ( 1 + t ) 1 λ 1 r 1 + λ l o g ( 1 + t ) x λ = n = 0 D n , λ ( r ) ( x ) t n n ! . ( λ R )
The higher order Changhee polynomials are defined by
2 2 + t k ( 1 + t ) x = n = 0 C h n ( k ) ( x ) t n n ! .
The higher order Changhee–Genocchi polynomials are defined by
2 l o g ( 1 + t ) 2 + t k ( 1 + t ) x = n = 0 C G n ( k ) ( x ) t n n ! .
When x = 0 , C G n ( k ) = C G n ( k ) ( 0 ) are called the higher order Changhee–Genocchi numbers.
The Lah numbers are given by the generating function
t 1 + t k k ! = n k L ( n , k ) t n n ! .
The generalized Bell polynomials of the first kind are given by the generating function
( e e t 1 1 ) k k ! = n = 1 B ( n , k ) t n n ! .
The generalized Bell polynomials of the second kind are given by the generating function
( l o g ( 1 + ( l o g ( 1 + t ) ) ) k k ! = n = 1 β ( n , k ) t n n ! .
The Stirling numbers of the first kind and the second kind are defined by
l o g k ( 1 + t ) k ! n k S 1 ( n , k ) t n n ! .
( e t 1 ) k k ! = n k S 2 ( n , k ) t n n ! .
The generalized Stirling numbers of the first kind and the second kind are defined by
l o g k ( 1 + t ) ( 1 + t ) r k ! = n k S 1 ( n , k ; r ) t n n ! .
( e t 1 ) k k ! e r t = n k S 2 ( n , k ; r ) t n n ! .
Lemma 1
(Inversion Formula [13]). Let f , g be functions defined on the set of positive integers, then
g n = k = 0 n S 1 ( n , k ) f k f n = k = 0 n S 2 ( n , k ) g k .
g n = k = 0 n S 1 ( n , k ; r ) f k f n = k = 0 n S 2 ( n , k ; r ) g k .
A Riordan array is a pair ( g ( t ) , f ( t ) ) of formal power series with f 0 = f ( 0 ) = 0 . It defines an infinite lower triangular array ( d n , k ) n , k N ( N is non-negative integer) according to the rule:
d n , k = [ t n ] g ( t ) ( f ( t ) ) k .
Hence, we write R ( d n , k ) = ( g ( t ) , f ( t ) ) .
Lemma 2
([14]). If D = ( g ( t ) , f ( t ) ) = ( d n , k ) n , k N is an Riordan array and h ( t ) is the generating function of the sequence ( h k ) k N , i.e, f ( t ) = k = 0 f k t k or h ( t ) = G ( h k ) . Then, we have
k = 0 n d n , k h k = [ t n ] g ( t ) h ( f ( t ) ) .

2. Some Properties about the Higher Order Degenerate Changhee–Genocchi Numbers and Polynomials of the Second Kind

In this section, we establish some identities and give some properties of the higher order degenerate Changhee–Genocchi numbers and polynomials of the second kind by using generating functions.
Theorem 1.
For non-negative integer n, we obtain
n 1 + n 2 + n m = n n n 1 , n 2 , , n m J n 1 , λ ( r 1 ) ( x 1 ) J n 2 , λ ( r 2 ) ( x 2 ) J n m , λ ( r m ) ( x m ) = J n , λ ( r 1 + + r m ) ( x 1 + + x m ) .
Proof. 
By ( 1 ) , we get
n = 0 J n , λ ( r 1 + + r m ) ( x 1 + + x m ) t n n ! = 2 l o g ( 1 + t ) 1 + λ l o g ( 1 + t ) 1 λ + 1 r 1 + r 2 + + r m ( 1 + λ l o g ( 1 + t ) ) x 1 + x 2 + + x m λ = n 1 = 0 J n 1 , λ ( r 1 ) ( x 1 ) t n 1 n 1 ! n m = 0 J n m , λ ( r m ) ( x m ) t n m n m ! = n = 0 n 1 + n 2 + + n m = n n n 1 , n 2 , , n m J n 1 , λ ( r 1 ) ( x 1 ) J n m , λ ( r m ) ( x m ) t n n ! .
Comparing the coefficients of t n n ! in both sides, we get the identities. □
Corollary 1.
For x i = 0 ( i = 1 , 2 , ) in ( 20 ) , we obtain
n 1 + n 2 + + n m = n n n 1 , n 2 , , , n m J n 1 , λ ( r 1 ) J n 2 , λ ( r 2 ) J n m , λ ( r m ) = J n , λ ( r 1 + r 2 + r m ) .
Corollary 2.
For m = 2 in ( 20 ) , we obtain
m = 0 n n m J m , λ ( r ) ( x ) J n m , λ ( s ) ( y ) = J n , λ ( r + s ) ( x + y ) .
Corollary 3.
For s = 0 in ( 22 ) , we obtain
m = 0 n n m J m , λ ( r ) ( x ) ( y ) n m , λ = J n , λ ( r ) ( x + y ) .
For y = 0 in ( 23 ) , we obtain
m = 0 n n m J m , λ ( r ) ( x ) n m , λ = J n , λ ( r ) ( x ) .
For r = 0 in ( 23 ) , we obtain
m = 0 n n m J m , λ ( x + y ) n m , λ = J n , λ ( x + y ) .
Theorem 2.
For integer n k 1 , we have
d k 1 k ! J n , λ ( r ) ( x ) d x k = m = k n i = k m n m J n m , λ ( r ) ( x ) λ i S 1 ( i , k ) S 1 ( m , i ) .
Proof. 
From generating function ( 1 ) , we have
n = 0 d k ( 1 k ! J n , λ ( r ) ( x ) ) d x k t n n ! = 2 l o g ( 1 + t ) 1 + λ l o g ( 1 + t ) 1 λ + 1 r ( 1 + λ l o g ( 1 + t ) ) x λ l o g k ( 1 + λ l o g ( 1 + t ) ) k ! = n = 0 J n , λ ( r ) ( x ) t n n ! m = k S 1 ( m , k ) λ m l o g ( 1 + t ) m m ! = n = 0 J n , λ ( r ) ( x ) t n n ! m = k S 1 ( m , k ) λ m n = m S 1 ( n , m ) t n n ! = n = 0 J n , λ ( r ) ( x ) t n n ! n = k m = k n λ m S 1 ( m , k ) S 1 ( n , m ) t n n ! = n = 0 m = k n i = k m n m J n m , λ ( r ) ( x ) λ i S 1 ( i , k ) S 1 ( m , i ) t n n ! .
Comparing the coefficients of t n n ! in both sides, we can easily get the identities. □
Corollary 4.
For k = 1 , we have
d J n , λ ( r ) ( x ) d x = m = 1 n i = 1 m n m J n m , λ ( r ) ( x ) λ i ( 1 ) i 1 ( i 1 ) ! S 1 ( m , i ) .
Theorem 3.
For integer n 1 , we have
m = 0 n 1 ( 1 ) n m 1 n m ( n ) n m J m , λ ( r 1 ) ( x ) = J n , λ ( r ) ( x + 1 ) + J n , λ ( r ) ( x ) 2 .
Proof. 
From generating function ( 1 ) , we have
n = 0 ( J n , λ ( r ) ( x + 1 ) + J n , λ ( r ) ( x ) ) t n n ! = 2 l o g ( 1 + t ) 1 + λ l o g ( 1 + t ) 1 λ + 1 r ( 1 + λ l o g ( 1 + t ) ) x + 1 λ + 2 l o g ( 1 + t ) 1 + λ l o g ( 1 + t ) 1 λ + 1 r ( 1 + λ l o g ( 1 + t ) ) x λ = 2 l o g ( 1 + t ) 1 + λ l o g ( 1 + t ) 1 λ + 1 r ( 1 + λ l o g ( 1 + t ) ) x λ [ 1 + λ l o g ( 1 + t ) 1 λ + 1 ] = 2 l o g ( 1 + t ) 1 + λ l o g ( 1 + t ) 1 λ + 1 r 1 ( 1 + λ l o g ( 1 + t ) ) x λ [ 2 l o g ( 1 + t ) ] = n = 0 J n , λ ( r 1 ) ( x ) t n n ! n = 1 2 ( 1 ) n 1 ( n 1 ) ! t n n ! = n = 1 m = 0 n 1 n m J m , λ ( r 1 ) ( x ) 2 ( 1 ) n m 1 ( n m 1 ) ! t n n ! = n = 1 m = 0 n 1 ( 1 ) n m 1 2 n m ( n ) n m J m , λ ( r 1 ) ( x ) t n n ! .
Comparing the coefficients of t n n ! in both sides, we can easily get the identities. □
Corollary 5.
For x = 0 in ( 28 ) , we have
m = 0 n 1 ( 1 ) n m 1 n m ( n ) n m J m , λ ( r 1 ) ( 0 ) = J n , λ ( r ) ( 1 ) + J n , λ ( r ) ( 0 ) 2 .
Corollary 6.
For r = 1 in ( 29 ) , we have
m = 0 n 1 ( 1 ) n m 1 n m ( n ) n m = J n , λ ( 1 ) + J n , λ ( 0 ) 2 .
Theorem 4.
For non-negative integer n, we obtain
m = 1 r j = 0 n l = 0 j n j r m ( m ) l , λ S 1 ( j , l ) J n j , λ ( r ) + J n , λ ( r ) = 2 r r ! S 1 ( n , r ) .
Proof. 
From generating function ( 1 ) , ( 12 ) , we get
On the one hand,
2 r l o g r ( 1 + t ) = 1 + λ l o g ( 1 + t ) 1 λ + 1 r n = 0 J n , λ ( r ) t n n ! = n = 0 J n , λ ( r ) t n n ! + m = 1 r r m 1 + λ l o g ( 1 + t ) m λ n = 0 J n , λ ( r ) t n n ! = n = 0 J n , λ ( r ) t n n ! + m = 1 r r m l = 0 m λ l λ l l o g l ( 1 + t ) n = 0 J n , λ ( r ) t n n ! = n = 0 J n , λ ( r ) t n n ! + m = 1 r r m l = 0 ( m ) l , λ j = l S 1 ( j , l ) t j j ! n = 0 J n , λ ( r ) t n n ! = n = 0 J n , λ ( r ) t n n ! + m = 1 r r m j = 0 l = 0 j ( m ) l , λ S 1 ( j , l ) t j j ! n = 0 J n , λ ( r ) t n n ! = n = 0 J n , λ ( r ) t n n ! + m = 1 r r m n = 0 j = 0 n l = 0 j n j ( m ) l , λ S 1 ( j , l ) J n j , λ ( r ) t n n ! = n = 0 J n , λ ( r ) t n n ! + m = 1 r n = 0 j = 0 n l = 0 j n j r m ( m ) l , λ S 1 ( j , l ) J n j , λ ( r ) t n n ! .
On the other hand,
2 r l o g r ( 1 + t ) = 2 r r ! l o g r ( 1 + t ) r ! = n = r 2 r r ! S 1 ( n , r ) t n n ! .
Therefore, we obtain the result.
For r = 1 in ( 31 ) , we can get the conclusion from [3]:
j = 0 n l = 0 j n j ( 1 ) l , λ S 1 ( j , l ) J n j , λ + J n , λ = 2 ( 1 ) n 1 ( n 1 ) ! .
Theorem 5.
For non-negative integer n 1 , we have
m = 1 n r n m C h n m , λ ( r ) ( x ) S 1 ( m , r ) = J n , λ ( r ) ( x ) r ! .
Proof. 
From generating function (1), we have
n = 0 J n , λ ( r ) ( x ) t n n ! = 2 l o g ( 1 + t ) 1 + λ l o g ( 1 + t ) 1 λ + 1 r ( 1 + λ l o g ( 1 + t ) ) x λ = 2 1 + λ l o g ( 1 + t ) 1 λ + 1 r ( 1 + λ l o g ( 1 + t ) ) x λ l o g r ( 1 + t ) = n = 0 C h n , λ ( r ) ( x ) t n n ! l o g r ( 1 + t ) r ! r ! = n = 0 C h n , λ ( r ) ( x ) t n n ! n = r S 1 ( n , r ) t n n ! r ! = n = r m = 1 n r r ! n m C h n m , λ ( r ) ( x ) S 1 ( m , r ) t n n ! .
Comparing the coefficients of t n n ! in both sides, we obtain the result. □
Corollary 7.
For n 1 , r = 1 in ( 33 ) , we have
m = 1 n r n m C h n m , λ ( x ) ( 1 ) m 1 ( m 1 ) ! = J n , λ ( x ) .
Theorem 6.
For non-negative integer n r , we have
m = 0 n r l = 0 m n r m ε l , λ ( r ) ( x ) S 1 ( m , l ) D n m ( r ) ( x ) = J n , λ ( r ) ( x ) ( n ) r .
Proof. 
From generating function ( 2 ) , ( 12 ) , we get
n = 0 J n , λ ( r ) ( x ) t n n ! = 2 l o g ( 1 + t ) 1 + λ l o g ( 1 + t ) 1 λ + 1 r ( 1 + λ l o g ( 1 + t ) ) x λ = 2 1 + λ l o g ( 1 + t ) 1 λ + 1 r ( 1 + λ l o g ( 1 + t ) ) x λ l o g r ( 1 + t ) t r t r = l = 0 ε l , λ ( r ) ( x ) l o g l ( 1 + t ) l ! n = 0 D n ( r ) ( x ) t n n ! t r = n = 0 l = 0 n ε l , λ ( r ) ( x ) S 1 ( n , l ) t n n ! n = 0 D n ( r ) ( x ) t n n ! t r = n = 0 m = 0 n l = 0 m n m ε l , λ ( r ) ( x ) S 1 ( m , l ) D n m ( r ) ( x ) t n + r n ! = n = r m = 0 n r l = 0 m n r m ( n ) r ε l , λ ( r ) ( x ) S 1 ( m , l ) D n m ( r ) ( x ) t n n ! .
Comparing the coefficients of t n n ! in both sides, we can easily get the identities. □
Corollary 8.
For r = 1 in ( 35 ) , we have
m = 0 n 1 l = 0 m n 1 m ε l , λ ( x ) S 1 ( m , l ) D n m ( x ) = J n , λ ( x ) n .
Theorem 7.
For non-negative integer n r , we have
m = 0 n r j = 0 m n m r ! ( 2 x ) j , λ S 1 ( m , j ) S 1 ( n m , r ) = m = 0 n n m J n m , λ ( r ) ( x ) ε m , λ ( r ) ( x ) .
Proof. 
From generating function (1), (3), we get
n = 0 m = 0 n n m J n m , λ ( r ) ( x ) ε m , λ ( r ) ( x ) t n n ! = n = 0 J n , λ ( r ) ( x ) t n n ! n = 0 ε n , λ ( r ) ( x ) t n n ! = 2 l o g ( 1 + t ) 1 + λ l o g ( 1 + t ) 1 λ + 1 r ( 1 + λ l o g ( 1 + t ) ) x λ 1 + λ l o g ( 1 + t ) 1 λ + 1 2 r ( 1 + λ l o g ( 1 + t ) ) x λ = r ! l o g r ( 1 + t ) r ! ( 1 + λ l o g ( 1 + t ) ) 2 x λ = r ! n = r S 1 ( n , r ) t n n ! j = 0 ( 2 x ) j , λ l o g j ( 1 + t ) j ! = r ! n = r S 1 ( n , r ) t n n ! j = 0 ( 2 x ) j , λ n = j S 1 ( n , j ) t n n ! = r ! n = r S 1 ( n , r ) t n n ! n = 0 j = 0 n ( 2 x ) j , λ S 1 ( n , j ) t n n ! = n = r m = 0 n r j = 0 m n m r ! ( 2 x ) j , λ S 1 ( m , j ) S 1 ( n m , r ) t n n ! .
Comparing the coefficients of t n n ! in both sides, we can easily get the identities. □
Corollary 9.
For r = 1 in ( 37 ) , we have
m = 0 n 1 j = 0 m n m ( 2 x ) j , λ S 1 ( m , j ) ( 1 ) n m 1 ( n m 1 ) ! = m = 0 n n m J n m , λ ( x ) ε m , λ ( 1 ) ( x ) .
Theorem 8.
For non-negative integer n, we have
m = 0 n j = 0 m l = r n m r ! n m m j D m j , λ ( r ) ( x ) C h j , λ ( r ) S 2 , λ ( l , r ) S 1 ( n m , l ) = J n , λ ( r ) ( x ) .
Proof. 
From generating function ( 1 ) , we get
n = 0 J n , λ ( r ) ( x ) t n n ! = 2 l o g ( 1 + t ) 1 + λ l o g ( 1 + t ) 1 λ + 1 r ( 1 + λ l o g ( 1 + t ) ) x λ = r ! l o g ( 1 + t ) 1 + λ l o g ( 1 + t ) 1 λ 1 r ( 1 + λ l o g ( 1 + t ) ) x λ ( 1 + λ l o g ( 1 + t ) 1 λ 1 ) r r ! 2 1 + λ l o g ( 1 + t ) 1 λ + 1 r = r ! n = 0 D n , λ ( r ) ( x ) t n n ! l = r S 2 , λ ( l , r ) l o g l ( 1 + t ) l ! n = 0 C h n , λ ( r ) t n n ! = r ! n = 0 j = 0 n n j D n j , λ ( r ) ( x ) C h j , λ ( r ) t n n ! l = r S 2 , λ ( l , r ) n = l S 1 ( n , l ) t n n ! = r ! n = 0 j = 0 n n j D n j , λ ( r ) ( x ) C h j , λ ( r ) t n n ! n = r l = r n S 2 , λ ( l , r ) S 1 ( n , l ) t n n ! = n = r m = 0 n j = 0 m l = r n m r ! n m m j D m j , λ ( r ) ( x ) C h j , λ ( r ) S 2 , λ ( l , r ) S 1 ( n m , l ) t n n ! .
Therefore, we obtain the required result. □

3. Identities about the Higher Order Degenerate Changhee–Genocchi Numbers and Polynomials of the Second Kind

In this section, by means of the Riordan matrix, we derive some new equalities between the higher order degenerate Changhee–Genocchi numbers and polynomials of the second kind and Striling numbers, Bell numbers, Changhee numbers, and Lah numbers.
Theorem 9.
For non-negative integer n, we have
k = 0 n j = 0 k L ( j , k ) J k , λ ( m ) ( x ) S 2 ( n , k ) = ( 1 ) n G n , λ ( m ) ( x ) .
Proof. 
By Lemma 2 (19), we get
R ( k ! n ! L ( n , k ) ) = ( 1 , t 1 + t ) .
j = 0 k L ( j , k ) J k , λ ( m ) ( x ) = k ! j = 0 k j ! L ( j , k ) k ! J k , λ ( m ) ( x ) j ! = k ! [ t k ] [ 2 l o g ( 1 + y ) ( 1 + λ l o g ( 1 + y ) 1 λ + 1 m ( 1 + λ l o g ( 1 + y ) ) x λ | y = t 1 + t ] = k ! [ t k ] 2 l o g ( 1 + t ) ( 1 λ l o g ( 1 + t ) 1 λ + 1 m ( 1 λ l o g ( 1 + t ) ) x λ .
k = 0 n j = 0 k L ( j , k ) J k , λ ( m ) ( x ) S 2 ( n , k ) = n ! k = 0 n j = 0 k L ( j , k ) J k , λ ( m ) k ! k ! S 2 ( n , k ) n ! = n ! [ t n ] [ 2 l o g ( 1 + y ) ( 1 λ l o g ( 1 + y ) 1 λ + 1 m ( 1 λ l o g ( 1 + y ) ) x λ | y = e t 1 ] = n ! [ t n ] 2 t ( 1 λ t ) 1 λ + 1 m ( 1 λ t ) x λ = n ! [ t n ] n = 0 G n , λ ( m ) ( x ) ( 1 ) n t n n ! = ( 1 ) n G n , λ ( m ) ( x ) .
Corollary 10.
For m = 1 in ( 40 ) , we have
k = 0 n j = 0 k L ( j , k ) J k , λ ( x ) S 2 ( n , k ) = ( 1 ) n G n , λ ( x ) .
By means of L e m m a 1 , the inverse relation ( 16 ) . This leads to the following conclusion,
Theorem 10.
For non-negative integer n, we have
k = 0 n ( 1 ) k G k , λ ( m ) ( x ) S 1 ( n , k ) = j = 0 n L ( j , n ) J j , λ ( m ) ( x ) .
Corollary 11.
For m = 1 in ( 43 ) , we have
k = 0 n ( 1 ) k G k , λ ( x ) S 1 ( n , k ) = j = 0 n L ( j , n ) J j , λ ( x ) .
Theorem 11.
For non-negative integer n, we have
k = 0 n S 2 ( n , k ; r ) J k , λ ( m ) ( x ) = l = 0 n n l r n l G l , λ ( m ) ( x ) .
Proof. 
By using ( 19 ) , we see that
R ( k ! n ! S 2 ( n , k ; r ) ) = ( e r t , e t 1 ) .
k = 0 n S 2 ( n , k ; r ) J k , λ ( m ) ( x ) = n ! k = 0 n k ! S 2 ( n , k ; r ) n ! J k , λ ( m ) ( x ) k ! = n ! [ t n ] e r t [ 2 l o g ( 1 + y ) ( 1 + λ l o g ( 1 + y ) 1 λ + 1 m ( 1 + λ l o g ( 1 + y ) ) x λ | y = e t 1 ] = n ! [ t n ] e r t 2 t ( 1 + λ t ) 1 λ m ( 1 + λ t ) x λ = n ! [ t n ] e r t n = 0 G n , λ ( m ) ( x ) t n n ! = n ! [ t n ] n = 0 r n t n n ! n = 0 G n , λ ( m ) ( x ) t n n ! = n ! [ t n ] n = 0 l = 0 n n l r n l G l , λ ( m ) ( x ) t n n ! = l = 0 n n l r n l G l , λ ( m ) ( x ) .
Therefore, we obtain the required result. □
Corollary 12.
For m = 1 in ( 45 ) , we have
k = 0 n S 2 ( n , k ; r ) J k , λ ( x ) = l = 0 n n l r n l G l , λ ( x ) .
Corollary 13.
For x = 0 in ( 47 ) , we have
k = 0 n S 2 ( n , k ; r ) J k , λ = l = 0 n n l r n l G l , λ .
Corollary 14.
For r = 0 in ( 47 ) , we have
k = 0 n S 2 ( n , k ) J k , λ ( x ) = G l , λ ( x ) .
By the inverse relation ( 17 ) , we have
Theorem 12.
For non-negative integer n, we have
k = 0 n S 1 ( n , k ; r ) G k , λ ( m ) ( x ) = l = 0 n n l ( r ) n l J l , λ ( m ) ( x ) .
Which completes the proof.
Theorem 13.
For integer n 1 , we have
k = 1 n j = 1 k B ( k , j ) J j , λ ( m ) ( x ) S 1 ( n , k ) = G n , λ ( m ) ( x ) .
Proof. 
By ( 19 ) , we get
R ( k ! n ! B ( n , k ) ) = ( 1 , e e t 1 1 ) . R ( k ! n ! S 1 ( n , k ) ) = ( 1 , l o g ( 1 + t ) ) .
j = 1 k B ( k , j ) J j , λ ( m ) ( x ) = k ! j = 1 k j ! B ( k , j ) k ! J j , λ ( m ) ( x ) j ! = k ! [ t k ] [ 2 l o g ( 1 + y ) ( 1 + λ l o g ( 1 + y ) 1 λ + 1 m ( 1 + λ l o g ( 1 + y ) ) x λ | y = e e t 1 1 ] = k ! [ t k ] 2 ( e t 1 ) ( 1 + λ ( e t 1 ) 1 λ + 1 m ( e t 1 ) x λ . k = 1 n j = 1 k B ( k , j ) J j , λ ( m ) ( x ) S 1 ( n , k ) = n ! k = 1 n j = 1 k B ( k , j ) J j , λ ( m ) ( x ) k ! k ! S 1 ( n , k ) n ! = n ! [ t n ] [ 2 ( e y 1 ) ( 1 + λ ( e y 1 ) 1 λ + 1 m ( e y 1 ) x λ | y = l o g ( 1 + t ) ] = n ! [ t n ] 2 t ( 1 + λ t ) 1 λ + 1 m ( 1 + λ t ) x λ = n ! [ t n ] n = 0 G n , λ ( m ) ( x ) t n n ! = G n , λ ( m ) ( x ) .
We acquire the desired result. □
Corollary 15.
For m = 1 in ( 51 ) , we have
k = 1 n j = 1 k B ( k , j ) J j , λ ( x ) S 1 ( n , k ) = G n , λ ( x ) .
By the inverse relation ( 16 ) , we have
Theorem 14.
For integer n 1 , we have
k = 1 n G k , λ ( m ) ( x ) S 2 ( n , k ) = j = 1 n B ( n , j ) J j , λ ( m ) ( x ) .
Theorem 15.
For integer n 1 , we have
k = 0 n ( 2 ) n k n k C h n k ( r ) J k , λ ( m ) ( x ) = l = 0 n r + l 1 l ( n ) l J n l , λ ( m ) ( x ) .
Proof. 
From ( 19 ) , we note that
R ( ( 2 ) n k C h n k ( r ) ( n k ) ! ) = ( 1 ( 1 t ) r , t ) .
k = 0 n ( 2 ) n k n k C h n k ( r ) J k , λ ( m ) ( x ) = n ! [ t n ] 1 ( 1 t ) r [ 2 l o g ( 1 + y ) ( 1 + λ l o g ( 1 + y ) 1 λ + 1 m ( 1 + λ l o g ( 1 + y ) ) x λ | y = t ] = n ! [ t n ] 1 ( 1 t ) r 2 l o g ( 1 + t ) ( 1 + λ l o g ( 1 + t ) 1 λ + 1 m ( 1 + λ l o g ( 1 + t ) ) x λ = n ! [ t n ] n = 0 J n , λ ( m ) ( x ) t n n ! n = 0 r + n 1 n t n = n ! [ t n ] n = 0 l = 0 n J n l , λ ( m ) ( x ) 1 ( n l ) ! r + l 1 l t n = l = 0 n r + l 1 l ( n ) l J n l , λ ( m ) ( x ) .
Which completes the proof. □
Theorem 16.
For integer n 1 , we have
l = 0 n n l α n l β l C h l ( k ) J n l , λ ( m ) ( x ) = j = 1 n C G n k , j ( α , β ) G j , λ ( m ) ( x ) j ! .
Proof. 
By ( 19 ) , we get
R ( C G n k , j ( α , β ) n ! ) = ( 2 k ( 2 + β t ) k , l o g ( 1 + α t ) ) .
j = 1 n C G n k , j ( α , β ) n ! G j , λ ( m ) ( x ) j ! = [ t n ] 2 k ( 2 + β t ) k [ 2 y ( 1 + λ y ) 1 λ + 1 m ( 1 + λ y ) x λ | y = l o g ( 1 + α t ) ] = [ t n ] 2 2 + β t k 2 l o g ( 1 + α t ) ( 1 + λ l o g ( 1 + α t ) ) 1 λ + 1 m ( 1 + λ l o g ( 1 + α t ) ) x λ = [ t n ] l = 0 C h l ( k ) β l t l l ! n = 0 J n , λ ( m ) ( x ) α n t n n ! = [ t n ] n = 0 l = 0 n n l α n l β l C h l ( k ) J n l , λ ( m ) ( x ) t n n ! = l = 0 n 1 ( n l ) ! l ! α n l β l C h l ( k ) J n l , λ ( m ) ( x ) .
Which completes the proof. □
Corollary 16.
For α = β in ( 57 ) , we have
l = 0 n n l α n C h l ( k ) J n l , λ ( m ) ( x ) = j = 1 n C G n k , j ( α , α ) G j , λ ( m ) ( x ) j ! .
Corollary 17.
For m = 1 in ( 57 ) , we have
l = 0 n n l α n l β l C h l ( k ) J n l , λ ( x ) = j = 1 n C G n k , j ( α , β ) G j , λ ( x ) j ! .

4. Conclusions

The degenerate Changhee–Genocchi numbers and polynomials of the second kind are a combinatorial sequence that have been generalized to Changhee–Genocchi polynomials in recent years. In this paper, the basic properties of higher order degenerate Changhee–Genocchi numbers and polynomials of the second kind are given by using generating functions and the Riordan matrix methods. Additionally, the combinatorial constants between the higher order degenerate Changhee–Genocchi numbers and polynomials of the second kind and other special combinatorial sequences are derived. Next, we can further study and generalize them using probabilistic methods, asymptotic methods, etc. More importantly, degenerate Changhee–Genocchi numbers and polynomials of the second kind can be used not only in mathematics, mathematical physics equations, computer science, etc.

Author Contributions

Writing—original draft preparation, L.L., W.; writing—review and editing, W.; funding acquisition, W. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China under Grant 11461050 and The APC was funded by Natural Science Foundation of Inner Mongolia 2020MS01020.

Data Availability Statement

Not applicable.

Acknowledgments

The author sincerely thanks Wuyungaowa for her guidance.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Carlitz, L. A degenerate Staudt-Clausen theorem. Arch. Math. 1956, 7, 28–35. [Google Scholar] [CrossRef]
  2. Carlitz, L. Degenerate Stirling, Bernoulli and Eulerian numbers. Util. Math. 1979, 15, 51–88. [Google Scholar]
  3. Kim, T. Some identities for the Bernoulli, the Euler and the Genocchi numbers and polynomials. Adv. Stud. Contemp. Math. 2009, 19, 39–57. [Google Scholar]
  4. Kim, B.M.; Jang, L.C.; Kim, W.; Kwon, H.I. Degenerate Changhee-Genocchi numbers and polynomials. J. Inequalities Appl. 2017, 2017, 294. [Google Scholar] [CrossRef] [Green Version]
  5. Kim, D.S.; Kim, T. Higher-order degenerate Euler polynomials. Appl. Math. Sci. 2015, 9, 57–73. [Google Scholar] [CrossRef]
  6. Lim, D. Some identities of degenerate Genocchi polynomials. Bull. Korean Math. Soc. 2016, 53, 569–579. [Google Scholar] [CrossRef] [Green Version]
  7. Jang, G.W.; Kim, D.S.; Kim, T. Degenerate Changhee numbers and polynomials of the second kind. Adv. Stud. Contemp. Math. 2017, 27, 609–624. [Google Scholar]
  8. Kim, D.S.; Kim, T.; Kwon, H.-I.; Jang, G.-W. Degenerate Daehee polynomials of the second kind. Proc. Jangjeon Math. Soc. 2018, 21, 83–97. [Google Scholar]
  9. Kim, D.S.; Kim, T.; Seo, J.; Lee, S. Higher-order Changhee numbers and polynomials. Adv. Stud. Theor. Phys. 2014, 8, 365–373. [Google Scholar] [CrossRef] [Green Version]
  10. Kim, B.M.; Jeong, J.; Rim, S.H. Some explicit identities on Changhee-Genocchi polynomials and numbers. Adv. Differ. Equ. 2016, 2016, 202. [Google Scholar] [CrossRef] [Green Version]
  11. Boyadzhiev, K. Lah numbers and Laguerre polynomials of order negative one. Acta Univ. Sapientiae Math. 2016, 8, 22–31. [Google Scholar]
  12. Ma, G.W.; Wuyungaowa. Some identities involving the generalized harmonic numbers. J. Comb. Comb. Comput. 2012, 81, 19–32. [Google Scholar]
  13. Charalambides, C.A. Combinatorial Methods in Discrete Distributions; Wiley-Interscience: Hoboken, NJ, USA, 2005. [Google Scholar]
  14. Wang, W.P. Riordan arrays and harmonic number identities. Comput. Math. Appl. 2010, 60, 1494–1509. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Liu, L.; Wuyungaowa. A Note on Higher Order Degenerate Changhee–Genocchi Numbers and Polynomials of the Second Kind. Symmetry 2023, 15, 56. https://doi.org/10.3390/sym15010056

AMA Style

Liu L, Wuyungaowa. A Note on Higher Order Degenerate Changhee–Genocchi Numbers and Polynomials of the Second Kind. Symmetry. 2023; 15(1):56. https://doi.org/10.3390/sym15010056

Chicago/Turabian Style

Liu, Liwei, and Wuyungaowa. 2023. "A Note on Higher Order Degenerate Changhee–Genocchi Numbers and Polynomials of the Second Kind" Symmetry 15, no. 1: 56. https://doi.org/10.3390/sym15010056

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