Next Article in Journal
Research on a Class of Optimization Problems of Higher Education Cost with Cobb–Douglas Constraint Condition
Previous Article in Journal
A Symmetric Deep Learning Approach for Dynamic Reserve Evaluation of Tight Sandstone Gas Wells
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Identities Involving the Higher-Order Degenerate Type 2 ω-Daehee Polynomials

Department of Mathematics and Computer Science, Hetao College, Bayannur 015000, China
*
Author to whom correspondence should be addressed.
Symmetry 2025, 17(12), 2034; https://doi.org/10.3390/sym17122034
Submission received: 28 October 2025 / Revised: 15 November 2025 / Accepted: 19 November 2025 / Published: 28 November 2025
(This article belongs to the Section Mathematics)

Abstract

In this paper, based on previous study of type 2 ω -Daehee polynomials and some of their properties, we further introduce the generating function definition for the higher-order degenerate type 2 ω -Daehee polynomials. By employing the methods of generating functions and Riordan arrays, we investigate the properties of these higher-order degenerate polynomials in depth and establish identities that relate them to certain special combinatorial sequences.

1. Introduction

Considerable interest in degenerate versions of special polynomials is driven by their role as a conceptual bridge connecting classical analysis to discrete mathematics. The degenerative limiting process uncovers novel combinatorial identities and algebraic symmetries that are obscured in the classical setting, thus providing unified perspectives and profound theoretical insights across multiple mathematical disciplines.
In recent years, the study of various extensions and degenerate versions of classical special polynomials has attracted considerable attention across number theory, combinatorics, and mathematical physics. This resurgence, partly inspired by Carlitz’s early work on degenerate versions, has been significantly advanced by Kim et al. [1,2], who systematically developed degenerate Bernoulli and Euler polynomials. Their introduction of relevant functions (e.g., the degenerate polylogarithm and polyexponential functions) provides a robust basis for further generalizations in the field [3]. Concurrently, the exploration of type 2 polynomial families, including type 2 Bernoulli, Euler, and Daehee polynomials [4,5], has revealed rich algebraic and combinatorial structures. These are frequently derived using advanced techniques such as p-adic integrals and generating function methods [6,7], highlighting the profound connections between p-adic analysis and classical polynomial sequences.
Several research streams have contributed to this rapidly expanding landscape. For example, Ma and Lim [6] investigated type 2 ω -Daehee polynomials using p-adic invariant integrals on Z p , establishing several fundamental properties and symmetric identities. In parallel, Kim et al. [1] and Sharma et al. [8] developed degenerate versions of Daehee and Bernoulli polynomials, revealing their close connections with degenerate Stirling numbers of both kinds and the degenerate polylogarithm function. These works collectively underscore a persistent trend: the fusion of degenerate analogues with poly-type functions and higher-order constructions, leading to the discovery of novel identities and deeper combinatorial symmetries.
A key methodology emerging from these studies involves the use of generating functions and p-adic integral equations. For instance, the derivation of identities using weighted Stirling numbers [9] and the construction of new polynomial classes via modified polyexponential functions [10] or Riordan arrays [11] have become common themes. Additionally, the exploration of poly-Daehee polynomials within frameworks such as the Apostol–Euler basis further exemplifies the utility of generating functions in uncovering new identities and implicit summation formulae [12]. Furthermore, the exploration of symmetric identities through bosonic and fermionic p-adic integrals has connected these polynomial sequences to probabilistic interpretations, such as moments of random variables derived from Laplace distributions [4].
Building upon these developments, a clear impetus has emerged to unify and extend these concepts into a more comprehensive framework. The synthesis of higher-order, degenerate, and type 2 structures—spearheaded by researchers such as Kim and their collaborators [5,10,13,14,15]—points toward a promising direction for future inquiry. It is within this integrated context that the systematic study of higher-order degenerate type 2 ω -Daehee polynomials arises as a natural and meaningful generalization. Such polynomials are anticipated to encapsulate several known polynomial families—including degenerate Daehee, type 2 Daehee, and poly-Daehee polynomials—while providing a unified platform for exploring new combinatorial identities, asymptotic behavior, and potential applications in symmetric function theory and probabilistic modeling. The investigation of higher-order degenerate type 2 ω -Daehee polynomials can be naturally linked to the theory of generalized Bernoulli numbers. This connection is powerfully illustrated by the work of Leinartas and Shishkina [16], who employed these numbers to derive a multidimensional analog of the Euler-Maclaurin formula, thereby showcasing their utility and providing a valuable framework for our research.
We are now in a position to state some special numbers and polynomials, which will be used in the paper.
Let p be a fixed prime number. Throughout this paper, Z p , Q p , and C p will denote the ring of p-adic integers, the field of p-adic rational numbers, and the completion of the algebraic closure of Q p , respectively.
For n 0 , the generalized Stirling numbers of the first kind are defined by (see [2,17])
n = k s ( n , k ; r ) t n n ! = ( 1 + t ) r ( ln ( 1 + t ) ) k k ! , f o r k Z + { 0 } ,
when r = 0 , the above expression becomes the Stirling numbers of the first kind:
n = k s ( n , k ) t n n ! = ( ln ( 1 + t ) ) k k ! ,
and the generalized Stirling numbers of the second kind are defined by
n = k S ( n , k ; r ) t n n ! = e r t ( e t 1 ) k k ! , f o r k Z + { 0 } ,
when r = 0 , the above expression becomes the Stirling numbers of the second kind:
n = k S ( n , k ) t n n ! = ( e t 1 ) k k ! .
For any nonzero λ R , the degenerate exponential function is defined by (see [3])
e λ x ( t ) = ( 1 + λ t ) x λ , e λ ( t ) = ( 1 + λ t ) 1 λ .
In the limit as λ 0 , the degenerate versions of exponential and logarithmic functions reduce to their classical counterparts. Note that
lim λ 0 e λ x ( t ) = n = 0 x n t n n ! = e x t .
The degenerate Stirling numbers of the first and second kind are defined by (see [1])
n = k s 1 , λ ( n , k ) t n n ! = ( 1 λ [ ( 1 + t ) λ 1 ] ) k k ! ,
n = k S 2 , λ ( n , k ) t n n ! = ( ( 1 + λ t ) 1 λ 1 ) k k ! .
The generalized Lah numbers L ( n , k ; r ) have the following generating function (see [18])
n = k L ( n , k ; r ) t n n ! = ( 1 + t ) r 1 k ! t 1 + t k .
The higher-order type 2 Bernoulli polynomials have the following generating function (see [4,5])
n = 0 b n ( r ) ( x ) t n n ! = t e t e t r e x t .
The central factorial numbers of the second kind have the following generating function (see [5,6])
n = k T ( n , k ) t n n ! = 1 k ! ( e t 2 e t 2 ) k .
The generalized harmonic numbers have the following generating function (see [11])
n = 0 H n , h t n = ( ln ( 1 t ) ) h h ! ( 1 t ) .
The two kinds of generalized Bell numbers B ( n , k ) and β ( n , k ) are defined by the generating function
n = k B ( n , k ) t n n ! = 1 k ! ( e e t 1 1 ) k ,
n = k β ( n , k ) t n n ! = 1 k ! ( ln ( 1 + ln ( 1 + t ) ) ) k .
The present work is motivated by the premise that the synergistic combination of degeneracy, type 2 structure, and the parameter ω leads to a polynomial family with profoundly richer properties and broader applicability. The degenerate parameter λ provides a continuous deformation that probes discrete analogues and reveals hidden combinatorial landscapes. The type 2 aspect incorporates distinct symmetries and connections to hyperbolic functions, yielding identities orthogonal to the classical theory. Finally, the parameter ω acts as a generative weight, crucial for deriving the most general symmetric identities and providing a tunable degree of freedom.

2. Methods

In this paper, let f ( t ) be the generating function of the sequence { f n } n 0 , that is, f ( t ) = n = 0 f n t n , and let [ t n ] f ( t ) be the coefficient of t n in the series f ( t ) [17].
A Riordan array is a formal power series pair ( g ( t ) , f ( t ) ) , where g ( t ) = k 0 g k t k , f ( t ) = k 1 f k t k ; if g ( t ) is a reversible series and f ( t ) is a delta series, then the Riordan array is called normal. The Riordan array ( g ( t ) , f ( t ) ) defines an infinite triangular matrix ( d n , k ) n , k C according to the following rules: d n , k = [ t n ] g ( t ) ( f ( t ) ) k , where g ( t ) ( f ( t ) ) k is called the column generating function of the Riordan matrix, and d n , k is called the general element of the Riordan matrix [5].
Lemma 1
([11]). Let  D = ( g ( t ) , f ( t ) ) = ( d n , k ) n , k N be a Riordan matrix, and let h ( t ) = k 0 h k t k be the occurrence function of the sequence { h n } ; then
k = 0 n d n , k h k = [ t n ] g ( t ) h ( f ( t ) ) .
Lemma 2
([9,17]). Let { f n } and { g n } be two sequences whose generating functions are
f = n = 0 f n t n n ! , g = n = 0 g n t n n ! ,
Then we have the following inversion formula:
f n = k = 0 n s ( n , k ) g k g n = k = 0 n S ( n , k ) f k ,
f n = k = 0 n s ( n , k ; r ) g k g n = k = 0 n S ( n , k ; r ) f k ,
f n = k = 0 n s 1 , λ ( n , k ) g k g n = k = 0 n S 2 , λ ( n , k ) f k .

3. Higher-Order Degenerate Type 2 ω -Daehee Numbers and Polynomials

Ma and Lim [1] gave the generating function of higher-order type 2 ω -Daehee polynomials:
n = 0 d n , ω ( α ) ( x ) t n n ! = ln ( 1 + t ) ( 1 + t ) ω ( 1 + t ) ω α ( 1 + t ) x ,
when x = 0 ,   d n , ω ( α ) = d n , ω ( α ) ( 0 ) are called type 2 ω -Daehee numbers of order α .
Motivated by (9), we define the higher-order degenerate type 2 ω -Daehee polynomials.
Definition 1.
Let n be a non-negative integer, α, λ be real numbers, and λ 0 . The generating function of the higher-order degenerate type 2 ω-Daehee polynomial is defined as follows, for t , x C p and ω N :
n = 0 d n , ω , λ ( α ) ( x ) t n n ! = 1 λ ln ( 1 + λ ln ( 1 + t ) ) ( 1 + λ ln ( 1 + t ) ) ω λ ( 1 + λ ln ( 1 + t ) ) ω λ α ( 1 + λ ln ( 1 + t ) ) x λ ,
when x = 0 ,   d n , ω , λ ( α ) = d n , ω , λ ( α ) ( 0 ) are called higher-order degenerate type 2 ω-Daehee numbers of order α.
Theorem 1.
Let n be a nonnegative integer, and let r i 0 be integers for i [ m ] with m 1 . Then the higher-order degenerate type 2 ω-Daehee polynomials satisfy the following property:
d n , ω , λ ( r 1 + r 2 + + r m ) ( x 1 + x 2 + + x m ) = n 1 + n 2 + + n m = n n n 1 , n 2 , , n m d n 1 , ω , λ ( r 1 ) ( x 1 ) d n 2 , ω , λ ( r 2 ) ( x 2 ) d n m , ω , λ ( r m ) ( x m ) .
Proof. 
From the generating function (10), we obtain
n = 0 d n , ω , λ ( r 1 + r 2 + + r m ) ( x 1 + x 2 + + x m ) t n n ! = n = 0 d n , ω , λ ( r 1 ) ( x 1 ) t n n ! n = 0 d n , ω , λ ( r 2 ) ( x 2 ) t n n ! n = 0 d n , ω , λ ( r m ) ( x m ) t n n ! = n = 0 n 1 + n 2 + + n m = n n n 1 , n 2 , , n m d n 1 , ω , λ ( r 1 ) ( x 1 ) d n 2 , ω , λ ( r 2 ) ( x 2 ) d n m , ω , λ ( r m ) ( x m ) t n n ! .
By comparing the coefficients of t n n ! in the first and last expressions, Theorem 1 is proved. □
Corollary 1.
When x i = 0 , i [ m ] in (11), we get higher-order degenerate type 2 ω-Daehee number property
d n , ω , λ ( r 1 + r 2 + + r m ) = n 1 + n 2 + + n m = n n n 1 , n 2 , , n m d n 1 , ω , λ ( r 1 ) d n 2 , ω , λ ( r 2 ) d n m , ω , λ ( r m ) .
In (11), let m = 2 , r 1 = 0 , r 2 = α , we have
d n , ω , λ ( α ) ( x 1 + x 2 ) = l = 0 n k = 0 l n l ( x 1 ) k , λ s ( l , k ) d n l , ω , λ ( α ) ( x 2 ) ,
where ( x 1 ) 0 , λ = 1 , ( x 1 ) k , λ = x 1 ( x 1 λ ) ( x 1 ( k 1 ) λ ) , for k 1 .
Theorem 2.
Let n 1 be an integer. Then the higher-order degenerate type 2 ω-Daehee polynomials satisfy the following equality:
d n 1 , ω , λ ( α ) ( x + y ) d n 1 , ω , λ ( α ) ( x ) = 1 n l = 1 n k = 1 n l n l l ( y ) k , λ s ( n l , k ) d l 1 , ω , λ ( α ) ( x ) .
Proof. 
From the generating function (10), we obtain
n = 1 n d n 1 , ω , λ ( α ) ( x + y ) d n 1 , ω , λ ( α ) ( x ) t n n ! = t 1 λ ln ( 1 + λ ln ( 1 + t ) ) ( 1 + λ ln ( 1 + t ) ) ω λ ( 1 + λ ln ( 1 + t ) ) ω λ α ( 1 + λ ln ( 1 + t ) ) x λ [ ( 1 + λ ln ( 1 + t ) ) y λ 1 ] = n = 1 n d n 1 , ω , λ ( α ) ( x ) t n n ! k = 1 ( y ) k , λ ( ln ( 1 + t ) ) k k ! = n = 1 n d n 1 , ω , λ ( α ) ( x ) t n n ! n = 1 k = 1 n ( y ) k , λ s ( n , k ) t n n ! = n = 1 l = 1 n k = 1 n l n l l ( y ) k , λ s ( n l , k ) d l 1 , ω , λ ( α ) ( x ) t n n ! .
By comparing the coefficients of t n n ! on both sides, Theorem 2 is proved. □
Corollary 2.
In (13), set y = λ , we obtain
d n 1 , ω , λ ( α ) ( x + λ ) d n 1 , ω , λ ( α ) ( x ) = 1 n l = 1 n k = 1 n l n l l ( λ ) k , λ s ( n l , k ) d l 1 , ω , λ ( α ) ( x ) = 1 n l = 1 n k = 0 n l n l ( 1 ) n l 1 l ( n l 1 ) ! ω k α λ m k + 1 s ( m , k ) s ( l 1 , m ) b k ( α ) x ω .
Corollary 3.
In (13), set α = 1 , x = ω λ , y = 2 ω λ , and when n 2 , we obtain
d n 1 , ω , λ ( ω λ ) d n 1 , ω , λ ( ω λ ) = 1 n l = 1 n k = 1 n l n l l ( 2 ω λ ) k , λ s ( n l , k ) d l 1 , ω , λ ( ω λ ) = l = 1 n 1 ( λ ) l 1 ( l 1 ) ! s ( n 1 , l ) .
In this section, we first presented the definition of the higher-order degenerate type 2 ω -Daehee polynomials. Subsequently, starting from this definition, we proceeded to establish and prove several inherent properties of these polynomials.

4. Some Identities of Higher-Order Degenerate Type 2 ω -Daehee Polynomials and Numbers with Special Sequences

Theorem 3.
Let n be a nonnegative integer, the following identity holds:
k = 0 n λ k α s ( n , k ; r ) d k , ω λ ( α ) x λ = k = 0 n n k ( r ) n k d k , ω , λ ( α ) ( x ) .
Proof. 
By Lemma 1 and (1), we obtain the Riordan matrix
k ! n ! λ k s ( n , k ; r ) = ( 1 + λ t ) r , λ ln ( 1 + t ) ,
and
n ! k = 0 n k ! n ! λ k s ( n , k ; r ) d k , ω λ ( α ) x λ k ! = n ! [ t n ] ( 1 + t ) r ln ( 1 + y ) ( 1 + y ) ω λ ( 1 + y ) ω λ α ( 1 + y ) x λ | y = λ ln ( 1 + t ) = n ! [ t n ] λ α ( 1 + t ) r 1 λ ln ( 1 + λ ln ( 1 + t ) ) ( 1 + λ ln ( 1 + t ) ) ω λ ( 1 + λ ln ( 1 + t ) ) ω λ α ( 1 + λ ln ( 1 + t ) ) x λ = n ! [ t n ] λ α n = 0 ( r ) n t n n ! n = 0 d n , ω , λ ( α ) ( x ) t n n ! = n ! [ t n ] λ α n = 0 k = 0 n n k ( r ) n k d k , ω , λ ( α ) ( x ) t n n ! = λ α k = 0 n n k ( r ) n k d k , ω , λ ( α ) ( x ) .
By simplifying both sides of the above equation, Theorem 3 is proved. □
Corollary 4.
When r = 0 in (14), the following equation holds:
k = 0 n λ k α s ( n , k ) d k , ω λ ( α ) x λ = d k , ω , λ ( α ) ( x ) .
By the inversion relation (7) and (14), the following equation holds:
d n , ω λ ( α ) x λ = λ α n k = 0 n j = 0 k k j ( r ) k j S ( n , k ; r ) d j , ω , λ ( α ) ( x ) .
Theorem 4.
Let n be a nonnegative integer, the following identity holds:
k = 0 n S ( n , k ; r ) d k , ω , λ ( α ) x = k = 0 n n k λ k α r n k d k , ω λ ( α ) x λ = k = 0 n j = 0 n n k ω j α λ k j r n k s ( k , j ) b j ( α ) x ω .
Proof. 
By Lemma 1 and (2), we obtain the Riordan matrix
k ! n ! S ( n , k ; r ) = e r t , e t 1 ,
so we can obtain
n ! k = 0 n k ! n ! S ( n , k ; r ) d k , ω , λ ( α ) ( x ) k ! = n ! [ t n ] e r t 1 λ ln ( 1 + λ ln ( 1 + y ) ) ( 1 + λ ln ( 1 + y ) ) ω λ ( 1 + λ ln ( 1 + y ) ) ω λ α ( 1 + λ ln ( 1 + y ) ) x λ | y = e t 1 = n ! [ t n ] e r t 1 λ ln ( 1 + λ t ) ( 1 + λ t ) ω λ ( 1 + λ t ) ω λ α ( 1 + λ t ) x λ = n ! [ t n ] λ α n = 0 r n t n n ! n = 0 λ n d n , ω λ ( α ) x λ t n n ! = n ! [ t n ] n = 0 k = 0 n n k λ k α r n k d k , ω λ ( α ) x λ t n n ! = k = 0 n n k λ k α r n k d k , ω λ ( α ) x λ .
From the above proof process, we get
n ! k = 0 n k ! n ! S ( n , k ; r ) d k , ω , λ ( α ) ( x ) k ! = n ! [ t n ] e r t 1 λ ln ( 1 + λ t ) ( 1 + λ t ) ω λ ( 1 + λ t ) ω λ α ( 1 + λ t ) x λ = n ! [ t n ] ω α n = 0 r n t n n ! j = 0 ω λ j b j ( α ) x ω [ ln ( 1 + λ t ) ] j j ! = n ! [ t n ] n = 0 k = 0 n j = 0 k n k ω j α λ k j r n k s ( k , j ) b j ( α ) x ω t n n ! = k = 0 n j = 0 k n k ω j α λ k j r n k s ( k , j ) b j ( α ) x ω .
Thus, the proof is complete. □
Corollary 5.
When r = 0 in (15), the following equation holds:
λ n α d n , ω λ ( α ) x λ = k = 0 n S ( n , k ) d k , ω , λ ( α ) x = k = 0 n ω k α λ n k s ( n , k ) b k ( α ) x ω .
The identity establishes the equivalence between two combinatorial decompositions of a scaled generating function: one employing set partitions, and the other utilizing the cycle structure of permutations, governed by Stirling numbers of the second and first kind, respectively.
It is noteworthy that a key corollary of our main result (Corollary 5) subsumes the important finding of Minyoung Ma (2019) (see [6]). Specifically, by setting the parameters λ = 1 and α = 1 in Corollary 5, we directly recover Theorem 1 of [6]. This connection not only validates the correctness of our more general framework but also highlights how it extends the existing theory.
Theorem 5.
Let n be a nonnegative integer, the following equality holds:
m = 0 n k = 0 m s 1 , λ ( n , m ) S ( m , k ; r ) d k , ω , λ ( α ) ( x ) = m = 0 n k = 0 m n m r k s 1 , λ ( m , k ) d n m , ω ( α ) ( x ) .
Proof. 
From the proof of Theorem 4, we obtain
n = 0 k = 0 n S ( n , k ; r ) d k , ω , λ ( α ) ( x ) t n n ! = e r t 1 λ ln ( 1 + λ t ) ( 1 + λ t ) ω λ ( 1 + λ t ) ω λ α ( 1 + λ t ) x λ .
Thus, we obtain the Riordan matrix
k ! n ! s 1 , λ ( n , k ) = 1 , 1 λ [ ( 1 + t ) λ 1 ] ,
and we get
n ! m = 0 n m ! n ! s 1 , λ ( n , m ) 1 m ! k = 0 m S ( m , k ; r ) d k , ω , λ ( α ) ( x ) = n ! [ t n ] e r y 1 λ ln ( 1 + λ y ) ( 1 + λ y ) ω λ ( 1 + λ y ) ω λ α ( 1 + λ y ) x λ | y = 1 λ [ ( 1 + t ) λ 1 ] = n ! [ t n ] e r · 1 λ [ ( 1 + t ) λ 1 ] ln ( 1 + t ) ( 1 + t ) ω ( 1 + t ) ω α ( 1 + t ) x = n ! [ t n ] n = 0 k = 0 n r k s 1 , λ ( n , k ) t n n ! n = 0 d n , ω ( α ) ( x ) t n n ! = n ! [ t n ] n = 0 m = 0 n k = 0 m n m r k s 1 , λ ( m , k ) d n m , ω ( α ) ( x ) t n n ! = m = 0 n k = 0 m n m r k s 1 , λ ( m , k ) d n m , ω ( α ) ( x ) .
Thus, the proof is complete. □
Corollary 6.
When r = 0 in (16), the following equation holds:
d n , ω ( α ) ( x ) = m = 0 n k = 0 m s 1 , λ ( n , m ) S ( m , k ) d k , ω , λ ( α ) ( x ) .
By the inverse relations (7), (8) and (16), the following equalities hold:
j = 0 n S ( n , j ; r ) d j , ω , λ ( α ) ( x ) = m = 0 n l = 0 m k = 0 l m l r k s 1 , λ ( l , k ) S 2 , λ ( n , m ) d m l , ω ( α ) ( x ) ,
and
d n , ω , λ ( α ) ( x ) = j = 0 n m = 0 j l = 0 m k = 0 l m l r k s 1 , λ ( l , k ) s ( n , j ; r ) S 2 , λ ( n , m ) d m l , ω ( α ) ( x ) .
Theorem 6.
Let n be a nonnegative integer, the following equality holds:
k = 0 n L ( n , k ; r ) d k , ω , λ ( α ) ( x ) = k = 0 n n k ( r ) n k d k , ω , λ ( α ) ( x ) = k = 0 n l = 0 k j = 0 l n k ( 1 ) l ( r ) n k ω j α λ l j s ( l , j ) s ( k , l ) b j ( α ) x ω .
Proof. 
By Lemma 1 and (3), we obtain the Riordan matrix
k ! n ! L ( n , k ; r ) = ( 1 + t ) r , t 1 + t ,
so we can obtain
n ! k = 0 n k ! n ! L ( n , k ; r ) d k , ω , λ ( α ) ( x ) k ! = n ! [ t n ] ( 1 + t ) r 1 λ ln ( 1 + λ ln ( 1 + y ) ) ( 1 + λ ln ( 1 + y ) ) ω λ ( 1 + λ ln ( 1 + y ) ) ω λ α ( 1 + λ ln ( 1 + y ) ) x λ | y = t 1 + t = n ! [ t n ] ( 1 + t ) r 1 λ ln ( 1 λ ln ( 1 + t ) ) ( 1 λ ln ( 1 + t ) ) ω λ ( 1 λ ln ( 1 + t ) ) ω λ α ( 1 λ ln ( 1 + t ) ) x λ = n ! [ t n ] n = 0 ( r ) n t n n ! n = 0 d n , ω , λ ( α ) ( x ) t n n ! = n ! [ t n ] n = 0 k = 0 n n k ( r ) n k d k , ω , λ ( α ) ( x ) t n n ! = k = 0 n n k ( r ) n k d k , ω , λ ( α ) ( x ) .
From the above proof process, we obtain
n ! k = 0 n k ! n ! L ( n , k ; r ) d k , ω , λ ( α ) ( x ) k ! = n ! [ t n ] ω α ( 1 + t ) r ω λ ln ( 1 λ ln ( 1 + t ) ) e ω λ ln ( 1 λ ln ( 1 + t ) ) e ω λ ln ( 1 λ ln ( 1 + t ) ) α e x ω · ω λ ln ( 1 λ ln ( 1 + t ) ) = n ! [ t n ] n = 0 ( r ) n t n n ! n = 0 l = 0 n j = 0 l ( 1 ) l ω j α λ l j s ( l , j ) s ( n , l ) b j ( α ) ( x ω ) t n n ! = n ! [ t n ] n = 0 k = 0 n l = 0 k j = 0 l n k ( 1 ) l ( r ) n k ω j α λ l j s ( l , j ) s ( k , l ) b j ( α ) ( x ω ) t n n ! = k = 0 n l = 0 k j = 0 l n k ( 1 ) l ( r ) n k ω j α λ l j s ( l , j ) s ( k , l ) b j ( α ) ( x ω ) .
Thus, the proof is complete. □
Corollary 7.
When r = 0 in (17), the following equation holds:
d n , ω , λ ( α ) ( x ) = k = 0 n L ( n , k ) d k , ω , λ ( α ) ( x ) = k = 0 n j = 0 k ( 1 ) k ω j α λ k j s ( k , j ) s ( n , k ) b j ( α ) x ω .
By the inversion relation (6) and (18), the following equation holds:
k = 0 n S ( n , k ) d k , ω , λ ( α ) ( x ) = k = 0 n j = 0 k S ( n , k ) L ( k , j ) d j , ω , λ ( α ) ( x ) = k = 0 n ( 1 ) n ω k α λ n k s ( n , k ) b k ( α ) x ω .
Theorem 6 reveals a fundamental combinatorial equivalence: the sum of generalized Lah numbers and higher-order degenerate type 2 ω -Daehee polynomials can be transformed into a triple sum involving Stirling numbers of the first kind and Bernoulli polynomials. This identity underscores a deep connection between partition-based enumerations and permutation cycles, emphasizing invariance under parameter shifts and sign changes.
Theorem 7.
Let n be a nonnegative integer, the following equation holds:
k = 0 n λ k α H n , r d k , ω λ ( α ) x λ = k = 0 n d k , ω , λ ( α ) ( x ) k ! .
Proof. 
By Lemma 1 and (4), we obtain the Riordan matrix
( 1 ) n r r ! λ r H n , k = 1 1 + t , λ ln ( 1 + t ) ,
so we can obtain
k = 0 n ( 1 ) n k k ! λ k H n , k d k , ω λ ( α ) x λ k ! = [ t n ] 1 1 + t ln ( 1 + y ) ( 1 + y ) ω λ ( 1 + y ) ω λ α ( 1 + y ) x λ | y = λ ln ( 1 + t ) = [ t n ] λ α 1 1 + t 1 λ ln ( 1 + λ ln ( 1 + t ) ) ( 1 + λ ln ( 1 + t ) ) ω λ ( 1 + λ ln ( 1 + t ) ) ω λ α ( 1 + λ ln ( 1 + t ) ) x λ = [ t n ] λ α n = 0 ( 1 ) n t n n = 0 d n , ω , λ ( α ) ( x ) t n n ! = k = 0 n ( 1 ) n k λ α d k , ω , λ ( α ) ( x ) k ! .
By simplifying both sides of the above equation, Theorem 7 is proved. □
Theorem 8.
Let n be a nonnegative integer, the following equation holds:
k = 0 n s ( n , k ; r ) d k , ω , λ ( α ) ( x ) = k = 0 n j = 0 k i = 0 j n k ω i α λ j i ( r ) n k s ( j , i ) β ( k , j ) b i ( α ) x ω .
Proof. 
By Lemma 1, we obtain
n ! k = 0 n k ! n ! s ( n , k ; r ) d k , ω , λ ( α ) ( x ) k ! = n ! [ t n ] ω α n = 0 ( r ) n t n n ! i = 0 ω λ i b i ( α ) x ω j = i λ j s ( j , i ) k = j β ( k , j ) t k k ! = k = 0 n j = 0 k i = 0 j n k ω i α λ j i ( r ) n k s ( j , i ) β ( k , j ) b i ( α ) x ω .
By simplifying both sides of the above equation, Theorem 8 is proved. □
Corollary 8.
When r = 0 in (19), the following equation holds:
k = 0 n s ( n , k ) d k , ω , λ ( α ) ( x ) = k = 0 n j = 0 k ω j α λ k j s ( k , j ) β ( n , k ) b j ( α ) x ω .
By the inversion relation (7) and (19), the following equation holds:
d n , ω , λ ( α ) ( x ) = m = 0 n k = 0 m j = 0 k i = 0 j m k ω i α λ j i ( r ) m k s ( j , i ) β ( k , j ) S ( n , m ; r ) b i ( α ) x ω .
Theorem 9.
Let n be a nonnegative integer, the following equation holds:
m = 0 n k = 0 m s ( m , k ; r ) B ( n , m ) d k , ω , λ ( α ) ( x ) = m = 0 n k = 0 m n m ( r ) k λ n m α S ( m , k ) d n m , ω λ ( α ) x λ .
Proof. 
By Lemma 1 and the proof process of Theorem 8, we obtain
n ! m = 0 n m ! n ! B ( n , m ) 1 m ! k = 0 m s ( m , k ; r ) d k , ω , λ ( α ) ( x ) = n ! [ t n ] [ ( 1 + y ) r 1 λ ln ( 1 + λ ln ( 1 + ln ( 1 + y ) ) ) ( 1 + λ ln ( 1 + ln ( 1 + y ) ) ) ω λ ( 1 + λ ln ( 1 + ln ( 1 + y ) ) ) ω λ · ( 1 + λ ln ( 1 + ln ( 1 + y ) ) ) x λ | y = e e t 1 1 ] = n ! [ t n ] e r ( e t 1 ) 1 λ ln ( 1 + λ t ) ( 1 + λ t ) ω λ ( 1 + λ t ) ω λ α ( 1 + λ t ) x λ = n ! [ t n ] λ α n = 0 k = 0 n ( r ) k S ( n , k ) t n n ! n = 0 λ n d n , ω λ ( α ) x λ t n n ! = m = 0 n k = 0 m n m ( r ) k λ n m α S ( m , k ) d n m , ω λ ( α ) x λ .
By simplifying both sides of the above equation, Theorem 9 is proved. □
Theorem 10.
Let n be a nonnegative integer, the following equation holds:
( 2 ω ) n + k T ( n + k , k ) = n + k k m = 0 n l = 0 m λ n m S ( m , l ) S ( n , m ) d l , ω , λ ( k ) .
Proof. 
Let α = k , x = 0 in the generating function of the higher-order degenerate type 2 ω -Daehee polynomials, and set t = e 1 λ ( e λ t 2 1 ) 1 , then we have
l = 0 d l , ω , λ ( k ) ( e 1 λ ( e λ t 2 1 ) 1 ) l l ! = 2 t k e ω t 2 e ω t 2 k = 2 k k ! t k l = k ω l T ( l , k ) t l l ! = 2 k k ! n = 0 ω n + k T ( n + k , k ) t n ( n + k ) ! = 2 k n = 0 ω n + k T ( n + k , k ) 1 n + k k t n n ! .
The left-hand side of the equation equals
l = 0 d l , ω , λ ( k ) ( e 1 λ ( e λ t 2 1 ) 1 ) l l ! = l = 0 d l , ω , λ ( k ) m = l S ( m , l ) λ m n = m S ( n , m ) λ 2 n t n n ! = n = 0 1 2 n m = 0 n l = 0 m λ n m S ( m , l ) S ( n , m ) d l , ω , λ ( k ) t n n ! .
Equating the coefficients of t n n ! in the above two expressions yields the desired result. □
Theorem 10 reveals a combinatorial identity where the central factorial numbers T ( n + k , k ) , scaled by ( 2 ω ) n + k , are expressed as a double sum involving binomial coefficients, Stirling numbers of the second kind, and higher-order degenerate type 2 ω -Daehee polynomials. This demonstrates a fundamental link between enumeration problems for factorial numbers and those involving set partitions and polynomial sequences, emphasizing invariance under parameter transformations.
The primary focus of this section was to explore and reveal the relationships linking the higher-order degenerate type 2 ω -Daehee polynomials with a family of significant special polynomials and numbers. These interconnected entities included the generalized Stirling numbers, higher-order type 2 Bernoulli polynomials, degenerate Stirling numbers, generalized Lah numbers, generalized Bell numbers, and central factorial numbers of the second kind.

5. Symmetric Identities for Higher-Order Degenerate Type 2 ω -Daehee Polynomials

To study symmetric identities related to higher-order degenerate type 2 ω -Daehee polynomials, by setting α = ω = 1 in the higher-order degenerate type 2 ω -Daehee polynomials (10), we obtain:
1 λ ln ( 1 + λ ln ( 1 + t ) ) ( 1 + λ ln ( 1 + t ) ) 1 λ ( 1 + λ ln ( 1 + t ) ) 1 λ ( 1 + λ ln ( 1 + t ) ) x λ = n = 0 d n , 1 , λ ( x ) t n n ! .
Let n be a nonnegative integer and N 1 be an integer. From the above, we observe:
( 1 + λ ln ( 1 + t ) ) 1 λ ln ( 1 + λ ln ( 1 + t ) ) λ n = 0 l = 0 N 1 2 n ( l ) n , λ 2 ( ln ( 1 + t ) ) n n ! = ( 1 + λ ln ( 1 + t ) ) 1 λ ln ( 1 + λ ln ( 1 + t ) ) λ l = 0 N 1 ( 1 + λ ln ( 1 + t ) ) 2 l λ = ( 1 + λ ln ( 1 + t ) ) 1 λ ln ( 1 + λ ln ( 1 + t ) ) λ ( 1 + λ ln ( 1 + t ) ) 2 N λ 1 ( 1 + λ ln ( 1 + t ) ) 2 λ 1 = λ n 1 n = 0 d n , 1 λ 2 N λ d n , 1 λ ( ln ( 1 + t ) ) n n ! .
Rearranging, we get:
l = 0 N 1 ( l ) n , λ 2 = λ 2 n d n , 1 λ 2 N λ d n , 1 λ ( 1 + λ ln ( 1 + t ) ) 1 λ ln ( 1 + λ ln ( 1 + t ) ) .
Theorem 11.
Let n be a nonnegative integer, ω 1 , ω 2 , m N , the following equation holds:
j = 0 n i = 0 j k = 0 i n j j i d n j , ω 2 , λ ( m 1 ) ( ω 1 ω 2 y ) ( 2 ω 2 ) k s ( i , k ) T k , λ 2 ω 2 ( ω 1 1 l ) d j i , ω 1 , λ ( m ) ( ω 1 ω 2 x + ω 2 ) = j = 0 n i = 0 j k = 0 i n j j i d n j , ω 1 , λ ( m 1 ) ( ω 1 ω 2 y ) ( 2 ω 1 ) k s ( i , k ) T k , λ 2 ω 1 ( ω 2 1 l ) d j i , ω 2 , λ ( m ) ( ω 1 ω 2 x + ω 1 ) .
Proof. 
Let T k , λ ( n | l ) = l = 0 n ( l ) k , λ , where n is a nonnegative integer, and ω 1 , ω 2 , m N . We consider the following functional equation derived from the generating function for the m-order degenerate type 2 ω -Daehee polynomials:
I ( ω 1 , ω 2 ) = 1 λ ln ( 1 + λ ln ( 1 + t ) ) ( 1 + λ ln ( 1 + t ) ) 2 ω 1 λ 1 m ( 1 + λ ln ( 1 + t ) ) ω 1 ω 2 x + m ω 1 λ · λ ( 1 + λ ln ( 1 + t ) ) 2 ω 1 ω 2 λ 1 ln ( 1 + λ ln ( 1 + t ) ) × 1 λ ln ( 1 + λ ln ( 1 + t ) ) ( 1 + λ ln ( 1 + t ) ) 2 ω 2 λ 1 m ( 1 + λ ln ( 1 + t ) ) ω 1 ω 2 y + m ω 2 λ = n = 0 d n , ω 1 , λ ( m ) ( ω 1 ω 2 x + ω 2 ) t n n ! l = 0 ω 1 1 ( 1 + λ ln ( 1 + t ) ) 2 ω 2 l λ n = 0 d n , ω 2 , λ ( m 1 ) ( ω 1 ω 2 y ) t n n ! = n = 0 d n , ω 1 , λ ( m ) ( ω 1 ω 2 x + ω 2 ) t n n ! n = 0 k = 0 n s ( n , k ) ( 2 ω 2 ) k l = 0 ω 1 1 ( l ) k , λ 2 ω 2 t n n ! n = 0 d n , ω 2 , λ ( m 1 ) ( ω 1 ω 2 y ) t n n ! = n = 0 d n , ω 1 , λ ( m ) ( ω 1 ω 2 x + ω 2 ) t n n ! n = 0 k = 0 n s ( n , k ) ( 2 ω 2 ) k T k , λ 2 ω 2 ( ω 1 1 l ) n = 0 d n , ω 2 , λ ( m 1 ) ( ω 1 ω 2 y ) t n n ! = n = 0 i = 0 n n i d n i , ω 1 , λ ( m ) ( ω 1 ω 2 x + ω 2 ) k = 0 i s ( i , k ) ( 2 ω 2 ) k T k , λ 2 ω 2 ( ω 1 1 l ) t n n ! n = 0 d n , ω 2 , λ ( m 1 ) ( ω 1 ω 2 y ) t n n ! = n = 0 j = 0 n i = 0 j k = 0 i n j j i d n j , ω 2 , λ ( m 1 ) ( ω 1 ω 2 y ) ( 2 ω 2 ) k s ( i , k ) T k , λ 2 ω 2 ( ω 1 1 l ) d j i , ω 1 , λ ( m ) ( ω 1 ω 2 x + ω 2 ) t n n ! .
Similarly, by the symmetry of ω 1 and ω 2 in I ( ω 1 , ω 2 ) , we obtain
I ( ω 1 , ω 2 ) = n = 0 j = 0 n i = 0 j k = 0 i n j j i d n j , ω 1 , λ ( m 1 ) ( ω 1 ω 2 y ) ( 2 ω 1 ) k s ( i , k ) T k , λ 2 ω 1 ( ω 2 1 l ) d j i , ω 2 , λ ( m ) ( ω 1 ω 2 x + ω 1 ) t n n ! .
Comparing the coefficients of t n n ! on both sides proves the theorem. □
Corollary 9.
Let y = 0 and m = 1 in (20), then the equation holds:
i = 0 n n i d n i , ω 1 , λ ( m ) ( ω 1 ω 2 x + ω 2 ) k = 0 i s ( i , k ) ( 2 ω 2 ) k T k , λ 2 ω 2 ( ω 1 1 l ) = i = 0 n n i d n i , ω 2 , λ ( m ) ( ω 1 ω 2 x + ω 1 ) k = 0 i s ( i , k ) ( 2 ω 1 ) k T k , λ 2 ω 1 ( ω 2 1 l ) .
Corollary 10.
Let ω 2 = 1 in (21), then the following equation holds:
i = 0 n λ i 1 s ( n , i ) d i , 1 λ ( m ) ω 1 x + ω 1 λ = i = 0 n k = 0 i n i d n i , ω 1 , λ ( m ) ( ω 1 x + 1 ) s ( i , k ) 2 k T k , λ 2 ( ω 1 1 l ) .
And from the inversion relation (6), we obtain
d n , 1 λ ( m ) ω 1 x + ω 1 λ = λ 1 n j = 0 n i = 0 j k = 0 i j i d j i , ω 1 , λ ( m ) ( ω 1 x + 1 ) s ( i , k ) S ( n , j ) 2 k T k , λ 2 ( ω 1 1 l ) .
Theorem 12.
Let n be a nonnegative integer, ω 1 , ω 2 , m N , then the following equation holds:
k = 0 n n k l = 0 ω 1 1 d k , ω 1 , λ ( m ) ( ω 1 ω 2 x + 2 ω 2 l ) d n k , ω 2 , λ ( m 1 ) ( ω 1 ω 2 y + ω 2 ) = k = 0 n n k l = 0 ω 2 1 d k , ω 2 , λ ( m ) ( ω 1 ω 2 x + 2 ω 1 l ) d n k , ω 1 , λ ( m 1 ) ( ω 1 ω 2 y + ω 1 ) .
Proof. 
From the proof process of Theorem 11, we obtain
I ( ω 1 , ω 2 ) = 1 λ ln ( 1 + λ ln ( 1 + t ) ) ( 1 + λ ln ( 1 + t ) ) 2 ω 1 λ 1 m ( 1 + λ ln ( 1 + t ) ) ω 1 ω 2 x + m ω 1 λ · λ ( 1 + λ ln ( 1 + t ) ) 2 ω 1 ω 2 λ 1 ln ( 1 + λ ln ( 1 + t ) ) × 1 λ ln ( 1 + λ ln ( 1 + t ) ) ( 1 + λ ln ( 1 + t ) ) 2 ω 2 λ 1 m ( 1 + λ ln ( 1 + t ) ) ω 1 ω 2 y + m ω 2 λ = 1 λ ln ( 1 + λ ln ( 1 + t ) ) ( 1 + λ ln ( 1 + t ) ) 2 ω 1 λ 1 m ( 1 + λ ln ( 1 + t ) ) ω 1 ω 2 x + m ω 1 λ l = 0 ω 1 1 ( 1 + λ ln ( 1 + t ) ) 2 ω 2 l λ × 1 λ ln ( 1 + λ ln ( 1 + t ) ) ( 1 + λ ln ( 1 + t ) ) 2 ω 2 λ 1 m 1 ( 1 + λ ln ( 1 + t ) ) ω 1 ω 2 y + m ω 2 λ = n = 0 l = 0 ω 1 1 d n , ω 1 , λ ( m ) ( ω 1 ω 2 x + 2 ω 2 l ) t n n ! n = 0 d n , ω 2 , λ ( m 1 ) ( ω 1 ω 2 y + ω 2 ) t n n ! = n = 0 k = 0 n n k l = 0 ω 1 1 d k , ω 1 , λ ( m ) ( ω 1 ω 2 x + 2 ω 2 l ) d n k , ω 2 , λ ( m 1 ) ( ω 1 ω 2 y + ω 2 ) t n n ! .
Similarly, by the symmetry of ω 1 and ω 2 in I ( ω 1 , ω 2 ) , we obtain
I ( ω 1 , ω 2 ) = n = 0 k = 0 n n k l = 0 ω 2 1 d k , ω 2 , λ ( m ) ( ω 1 ω 2 x + 2 ω 1 l ) d n k , ω 1 , λ ( m 1 ) ( ω 1 ω 2 y + ω 1 ) t n n ! .
Comparing the coefficients of t n n ! on both sides proves the theorem. □
Corollary 11.
Let y = 0 , m = 1 in (22), then the following equation holds:
m = 0 n k = 0 m l = 0 ω 1 1 n m ( ω 2 ) k , λ s ( m , k ) d n m , ω 1 , λ ( ω 1 ω 2 x + 2 ω 2 l ) = m = 0 n k = 0 m l = 0 ω 2 1 n m ( ω 1 ) k , λ s ( m , k ) d n m , ω 2 , λ ( ω 1 ω 2 x + 2 ω 1 l ) .
One fundamental characteristic of these results lies in the fact that their coefficients admit straightforward combinatorial interpretations in the context of enumerating discrete structures. Specifically, the identities presented in Corollary 5 and Theorem 6 unveil an equinumerous relationship between the enumerations of set partitions, permutation cycles, and ordered partitions—with this relationship mediated by the Stirling numbers and Lah numbers. Furthermore, Theorem 10 establishes a connection between the enumeration of symmetric structures (counted via the central factorial numbers) and sum expressions involving set partitions as well as the higher-order degenerate type 2 ω -Daehee polynomials.

6. Conclusions

Building on previous work, this study systematically investigated the higher-order degenerate type 2 ω -Daehee polynomials and numbers using generating functions and Riordan arrays. We derived explicit expressions and established various identities connecting these polynomials with generalized Stirling numbers, higher-order type 2 Bernoulli polynomials, degenerate Stirling numbers, generalized Lah numbers, generalized Bell numbers, and central factorial numbers of the second kind. Furthermore, symmetric identities for these polynomials were obtained via functional relations from their generating function, which highlighted broader combinatorial connections.
Based on our research findings and the intrinsic relationships with generalized Stirling and Bell numbers, this work may offer novel analytical tools for investigating weighted set partitions, coloring problems of signed graphs, and other complex combinatorial configurations. The derived results—including generating functions, explicit formulae, and profound connections with other polynomial families—hold promising potential for applications in the refined enumeration of combinatorial structures.

Author Contributions

Conceptualization, P.Z.; methodology, P.Z.; writing—original draft, P.Z.; validation, P.Z.; writing—review and editing, Y.Y.; funding acquisition, Y.Y.; supervision, Y.Y.; project administration, Y.Y.; supervision, H.W.; validation, H.W. All authors have read and agreed to the published version of the manuscript.

Funding

This study was supported by the Hetao College High-level Talent Introduction Research Startup Funding Project (Grant No. HYRC202503).

Data Availability Statement

No new data were created or analyzed in this study.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Kim, D.S.; Kim, T. A note on a new type of degenerate Bernoulli numbers. Russ. J. Math. Phys. 2020, 27, 227–235. [Google Scholar] [CrossRef]
  2. Kim, T.; Kim, D.S. Degenerate polyexponential functions and degenerate Bell polynomials. J. Math. Anal. Appl. 2020, 487, 124017. [Google Scholar] [CrossRef]
  3. Kim, T.; Kim, D.S.; Kwon, J.; Lee, H. Degenerate polyexponential functions and type 2 degenerate poly-Bernoulli numbers and polynomials. Adv. Differ. Equ. 2020, 2020, 399–406. [Google Scholar] [CrossRef]
  4. Kim, D.S.; Kim, H.Y.; Kim, D.; Kim, T. Identities of symmetry for type 2 Bernoulli and Euler polynomials. Symmetry 2019, 11, 613. [Google Scholar] [CrossRef]
  5. Kim, T.; Kim, D.S. A note on type 2 Changhee and Daehee polynomials. Rev. Real Acad. Cienc. Exactas Físicas Nat. Ser. A Matemáticas 2019, 113, 2763–2771. [Google Scholar] [CrossRef]
  6. Ma, M.; Lim, D. A note on type 2 ω-Daehee polynomials. Mathematics 2019, 7, 697. [Google Scholar] [CrossRef]
  7. Jang, L.C.; Kim, D.S.; Kim, T.; Lee, H. p-Adic integral on Zp associated with degenerate Bernoulli polynomials of the second kind. Adv. Differ. Equ. 2020, 2020, 278. [Google Scholar] [CrossRef]
  8. Kumar Sharma, S.; Khan, W.A.; Araci, S.; Ahmed, S.S. New type of degenerate Daehee polynomials of the second kind. Adv. Differ. Equ. 2020, 2020, 428. [Google Scholar] [CrossRef]
  9. Cenkci, M.; Young, P.T. Generalizations of poly-Bernoulli and poly-Cauchy numbers. Eur. J. Math. 2015, 1, 799–828. [Google Scholar] [CrossRef]
  10. Lee, D.S.; Kim, H.K.; Jang, L.C. Type 2 degenerate poly-Euler polynomials. Symmetry 2020, 12, 1011. [Google Scholar] [CrossRef]
  11. Cheon, G.S.; El-Mikkawy, M.E.A. Generalized harmonic numbers with Riordan arrays. J. Number Theory 2008, 128, 413–425. [Google Scholar] [CrossRef]
  12. Saif, M.; Nadeem, R. Evaluation of apostol–Euler based poly Daehee polynomials. Int. J. Appl. Comput. Math. 2019, 6, 323–330. [Google Scholar] [CrossRef]
  13. Kim, T.; Kim, D.S.; Lee, H.; Kwon, J. Degenerate binomial coefficients and degenerate hypergeometric functions. Adv. Differ. Equ. 2020, 2020, 16–23. [Google Scholar] [CrossRef]
  14. Kim, D.S.; Kim, T.; Lee, S.H.; Seo, J.J. A note on the lambda-Daehee polynomials. Int. J. Math. Anal. 2013, 7, 3069–3080. [Google Scholar] [CrossRef]
  15. Kim, T.; Kim, D.S.; Kim, H.Y.; Kwon, J. Some results on degenerate Daehee and Bernoulli numbers and polynomials. Adv. Differ. Equ. 2020, 2020, 311. [Google Scholar] [CrossRef]
  16. Leinartas, E.K.; Shishkina, O.A. The Euler-Maclaurin formula in the problem of summation over lattice points of a simplex. J. Sib. Fed. Univ. Math. Phys. 2022, 15, 108–113. [Google Scholar] [CrossRef]
  17. Wuyungaowa. Identities on products of Genocchi numbers. J. Inequalities Appl. 2013, 2013, 422. [Google Scholar] [CrossRef]
  18. Wuyungaowa, N. Some identities involving the higher-order Changhee numbers and polynomials. J. Appl. Math. Phys. 2018, 6, 647. [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

Zhang, P.; Yang, Y.; Wang, H. Identities Involving the Higher-Order Degenerate Type 2 ω-Daehee Polynomials. Symmetry 2025, 17, 2034. https://doi.org/10.3390/sym17122034

AMA Style

Zhang P, Yang Y, Wang H. Identities Involving the Higher-Order Degenerate Type 2 ω-Daehee Polynomials. Symmetry. 2025; 17(12):2034. https://doi.org/10.3390/sym17122034

Chicago/Turabian Style

Zhang, Pengfei, Yonglin Yang, and Huihui Wang. 2025. "Identities Involving the Higher-Order Degenerate Type 2 ω-Daehee Polynomials" Symmetry 17, no. 12: 2034. https://doi.org/10.3390/sym17122034

APA Style

Zhang, P., Yang, Y., & Wang, H. (2025). Identities Involving the Higher-Order Degenerate Type 2 ω-Daehee Polynomials. Symmetry, 17(12), 2034. https://doi.org/10.3390/sym17122034

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

Article Metrics

Article metric data becomes available approximately 24 hours after publication online.
Back to TopTop