Next Article in Journal
Influence of Box Height on Inter-Limb Asymmetry and Box Jump Performance
Previous Article in Journal
Solution for Convergence Problem in DEMATEL Method: DEMATEL of Finite Sum of Influences
Previous Article in Special Issue
Symmetry Analysis of a Model of Option Pricing and Hedging
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Some Explicit Properties of Frobenius–Euler–Genocchi Polynomials with Applications in Computer Modeling

1
Department of Mathematics, College of Science, University of Ha’il, Ha’il 2440, Saudi Arabia
2
Department of Mathematics and Natural Sciences, Prince Mohammad Bin Fahd University, P.O. Box 1664, Al Khobar 31952, Saudi Arabia
3
Department of Mathematics, Faculty of Science, Zonguldak Bülent Ecevit University, 67100 Zonguldak, Turkey
4
Department of Basic Sciences, Deanship of Preparatory Year, University of Ha’il, Ha’il 2440, Saudi Arabia
5
Department of Mathematics, Hannam University, Daejeon 34430, Republic of Korea
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(7), 1358; https://doi.org/10.3390/sym15071358
Submission received: 31 May 2023 / Revised: 10 June 2023 / Accepted: 16 June 2023 / Published: 4 July 2023

Abstract

:
Many properties of special polynomials, such as recurrence relations, sum formulas, and symmetric properties, have been studied in the literature with the help of generating functions and their functional equations. In this study, we define Frobenius–Euler–Genocchi polynomials and investigate some properties by giving many relations and implementations. We first obtain different relations and formulas covering addition formulas, recurrence rules, implicit summation formulas, and relations with the earlier polynomials in the literature. With the help of their generating function, we obtain some new relations, including the Stirling numbers of the first and second kinds. We also obtain some new identities and properties of this type of polynomial. Moreover, using the Faà di Bruno formula and some properties of the Bell polynomials of the second kind, we obtain an explicit formula for the Frobenius–Euler polynomials of order α . We provide determinantal representations for the ratio of two differentiable functions. We find a recursive relation for the Frobenius–Euler polynomials of order α . Using the Mathematica program, the computational formulae and graphical representation for the aforementioned polynomials are obtained.

1. Introduction

Recently, a lot of mathematicians [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22] have introduced and formulated generating functions for new families of special polynomials, such as Bernoulli, Euler, Genocchi, etc., using Frobenius–Euler polynomials and Frobenius–Genocchi polynomials. These types of papers have provided basic properties and different applications for these polynomials. After Frobenius–Euler and Frobenius–Genocchi polynomials, modified generating functions for the Frobenius–Euler and the Frobenius–Genocchi polynomials have been given by many researchers almost regularly every year. Most of this research consists of modifying or unifying existing generating functions by adding either parameters or a few polynomials to the coefficients of existing generating functions. Recently Belbachir et al. [23] introduced the Euler–Genocchi polynomials, and Goubi [6] generalized them to the Euler–Genocchi polynomials of order α . From this idea of generalized Euler–Genocchi polynomials, we introduce Frobenius–Euler–Genocchi polynomials and higher-order Frobenius–Euler–Genocchi polynomials of order α . In addition, we introduce Changhee–Frobenius–Euler–Genocchi polynomials. The aim of this paper is to study certain properties and identities involving those polynomials, the Stirling numbers of the first and second kinds, higher-order Frobenius–Euler polynomials of order α , and generalized falling factorials. Furthermore, we derive some properties of Bell polynomials of the second kind by using the Faà di Bruno formula and also derive determinantal representation for the ratio of the two differentiable functions.
For these fundamental reasons, the main motivation of this article is to focus on the generating functions constructed below and to explore their properties.

2. Preliminaries

In order to present our results, we need to give some special classes of polynomials and numbers with their generating functions.
The ordinary Bernoulli, Euler, and Genocchi polynomials are introduced by (see [2,11])
2 τ e τ + 1 e ξ τ = ω = 0 B ω ( ξ ) τ ω ω ! τ < 2 π ,
2 e τ + 1 e ξ τ = ω = 0 E ω ( ξ ) τ ω ω ! τ < π ,
and
2 τ e τ + 1 e ξ τ = ω = 0 G ω ( ξ ) τ ω ω ! τ < π ,
respectively.
In the case when ξ = 0 , B ω = B ω ( 0 ) , E ω = E ω ( 0 ) and G ω = G ω ( 0 ) are called the Bernoulli, Euler, and Genocchi numbers.
We note that
G 0 ( ξ ) = 0 , E ω ( ξ ) = G ω + 1 ( ξ ) ω + 1 ( ω 0 ) .
The Stirling numbers of the first kind are provided by
1 ν ! ( log ( 1 + τ ) ) ν = ω = ν S 1 ( ω , ν ) τ ω ω ! ( ν 0 ) .
The Stirling numbers of the second kind are provided by
1 ν ! ( e τ 1 ) ν = ω = ν S 2 ( ω , ν ) τ ω ω ! ( ν 0 ) .
The Bernoulli polynomials of the second kind are introduced by (see [24])
τ log ( 1 + τ ) ( 1 + τ ) ξ = ω = 0 b ω ( ξ ) τ ω ω ! .
When ξ = 0 , b ω = b ω ( 0 ) are called the Bernoulli numbers of the second kind.
The Changhee polynomials are introduced by (see [12])
2 2 + τ ( 1 + τ ) ξ = ω = 0 C h ω ( ξ ) τ ω ω ! .
When ξ = 0 , C h ω = C h ω ( 0 ) are called the Changhee numbers.
The Changhee–Genocchi polynomials are introduced by the generating function (see [1,13])
2 log ( 1 + τ ) 2 + τ ( 1 + τ ) ξ = ω = 0 C G ω ( ξ ) τ ω ω ! .
When ξ = 0 , C G ω = C G ω ( 0 ) are termed as the Changhee–Genocchi numbers.
Recently, Kim et al. [14] introduced the modified Changhee–Genocchi polynomials as follows:
2 τ 2 + τ ( 1 + τ ) ξ = ω = 0 C G ω * ( ξ ) τ ω ω ! .
When ξ = 0 , C G ω * = C G ω * ( 0 ) are termed as the modified Changhee–Genocchi numbers.
From (2) and (9), we see that
2 τ 2 + τ ( 1 + τ ) ξ = 2 τ e log ( 1 + τ ) + 1 e ξ log ( 1 + τ )
= τ ν = 0 E ν ( ξ ) 1 ν ! ( log ( 1 + τ ) ) ν
= τ ω = 0 ν = 0 ω E ν ( ξ ) S 1 ( ω , ν ) τ ω ω ! .
Thus, from (9) and (10), we obtain
C G ω + 1 * ( ξ ) ω + 1 = ν = 0 ω E ν ( ξ ) S 1 ( ω , ν ) ( ω 0 ) .
For u C with u 1 , the Frobenius–Euler polynomials are defined by (see [5])
1 u e τ u e ξ τ = ω = 0 H ω ( ξ ; u ) τ ω ω ! .
When ξ = 0 , H ω ( u ) = H ω ( 0 ; u ) are termed as the Frobenius–Euler numbers.
For u C with u 1 , the Frobenius–Genocchi polynomials are introduced by (see [15])
( 1 u ) τ e τ u e ξ τ = ω = 0 G ω F ( ξ ; u ) τ ω ω ! .
When ξ = 0 , G ω F ( u ) = G ω F ( 0 ; u ) are termed as the Frobenius–Genocchi numbers.
The generalized λ -Stirling numbers of the second kind S m ω ( λ ) are provided by (see [21,22])
( λ e τ 1 ) m m ! = ω = 0 S m ω ( λ ) τ ω ω ! ,
for λ C and m N 0 = { 0 , 1 , 2 , , } , where λ = 1 gives the well-known Stirling numbers of the second kind.
By virtue of (13), the λ -array type polynomials S m ω ( ξ , λ ) are defined by (see [21])
( λ e τ 1 ) m m ! e ξ τ = ω = 0 S m ω ( ξ , λ ) τ ω ω ! .
The following paper is as follows. In Section 3, we introduce Frobenius–Euler–Genocchi numbers and polynomials. We examine some new properties of these numbers and polynomials and obtain some new identities and relations between the Frobenius–Euler–Genocchi numbers and polynomials and Stirling numbers of the first and second kinds. In Section 4, for r = 0 , using the Faà di Bruno formula and some properties of the Bell polynomials of the second kind, we give an explicit formula for the Frobenius–Euler polynomials of order α . We provide determinantal representations for the ratio of two differentiable functions. We obtain a recursive relation for the Frobenius–Euler polynomials of order α . In Section 5, we give new definitions and derive some beautiful results. In Section 6, we provide zeros and graphical representations of the Frobenius–Euler–Genocchi polynomials. Finally, in the last section, we give certain zeros and graphical representations for the Changhee–Frobenius–Euler–Genocchi polynomials.

3. The Frobenius–Euler–Genocchi Polynomials

In this section, we introduce Frobenius–Euler–Genocchi polynomials and investigate some explicit expressions of Frobenius–Euler–Genocchi polynomials. We start with the following definition:
For u C with u 1 and r Z with r 0 , we consider the Frobenius–Euler–Genocchi polynomials given by
( 1 u ) τ r e τ u e ξ τ = ω = 0 A ω ( r ) ( ξ ; u ) τ ω ω ! .
Note that A 0 ( r ) ( ξ ; u ) = A 1 ( r ) ( ξ ; u ) = = A r 1 ( r ) ( ξ ; u ) = 0 .
At the point ξ = 0 , A ω ( r ) ( u ) = A ω ( r ) ( 0 ; u ) are termed as the Frobenius–Euler–Genocchi numbers. Observe that
A ω ( 0 ) ( ξ ; u ) = H ω ( ξ ; u ) , A ω ( 1 ) ( ξ ; u ) = G ω F ( ξ ; u ) ( ω 0 ) .
From (15), we have
ω = 0 A ω ( r ) ( ξ + 1 ; u ) τ ω ω ! = ( 1 u ) τ r e τ u e ( ξ + 1 ) τ
= ω = 0 ν = 0 ω ω ν A ν ( r ) ( ξ ; u ) τ ω ω ! .
Therefore, we have
A ω ( r ) ( ξ + 1 ; u ) = ν = 0 ω ω ν A ν ( r ) ( ξ ; u ) ( ω 0 ) .
Theorem 1.
For ω 0 , we have
ξ ω = 1 ( 1 u ) ( ω + r ) r ν = 0 ω ω + r ν + r A ν + r ( r ) ( ξ ; u ) u A ω + r ( r ) ( ξ ; u ) ,
where
α n = Γ ( α + n ) Γ ( α ) .
Proof. 
Using (15), we note that
ω = 0 ξ ω τ ω ω ! = 1 ( 1 u ) τ r ν = 0 A ν ( r ) ( ξ ; u ) τ ν ν ! ( e τ u )
= 1 1 u ν = 0 A ν + r ( r ) ( ξ ; u ) τ ν ( ν + r ) ! ω = 0 τ ω ω ! u
= 1 1 u ω = 0 ν = 0 ω ω + r ν + r ω ! ( ω + r ) ! A ν + r ( r ) ( ξ ; u ) τ ω ω ! u 1 u ω = 0 A ω + r ( r ) ( ξ ; u ) ω ! ( ω + r ) ! τ ω ω !
= ω = 0 1 1 u ν = 0 ω ω + r ν + r A ν + r ( r ) ( ξ ; u ) ( ω + r ) r u A ω + r ( r ) ( ξ ; u ) ( ω + r ) r τ ω ω ! .
Therefore, by (19), we obtain the result. □
Corollary 1.
For u = 1 and r = 0 in Theorem 1, we obtain
ξ ω = 1 2 E ω ( ξ ) + ν = 0 ω ω ν E ν ( ξ ) .
Corollary 2.
For u = 1 and r = 1 in Theorem 1, we obtain
ξ ω = 1 2 ( ω + 1 ) G ω + 1 ( ξ ) + ν = 0 ω ω + 1 ν + 1 G ν + 1 ( ξ ) .
Theorem 2.
For ω , r 0 with ω r , we have
A ω ( r ) ( ξ ; u ) = ( ω ) r H ω r ( ξ ; u ) .
Proof. 
By using (15), we see that
ω = r A ω ( r ) ( ξ ; u ) τ ω ω ! = τ r ( 1 u ) e τ u e ξ τ
= τ r ω = 0 H ω ( ξ ; u ) τ ω ω !
= ω = r H ω r ( ξ ; u ) ω ! ( ω r ) ! τ ω ω ! = ω = r ( ω ) r H ω r ( ξ ; u ) τ ω ω ! .
Therefore, by (15) and (23), we obtain the result. □
Theorem 3.
For ω 0 , we have
A ω + 1 ( r ) ( ξ ; u ) = ξ + r τ A ω ( r ) ( ξ ; u ) 1 1 u ν = 0 ω ω ν A ω ν ( 0 ) ( 1 ; u ) A ν ( r ) ( ξ ; u ) .
Proof. 
Differentiating both sides of (15) with respect to τ yields
d d τ ω = 0 A ω ( r ) ( ξ ; u ) τ ω ω ! = ( 1 u ) ξ τ r e τ u e ξ τ + ( 1 u ) r τ r 1 ( e τ u ) ( 1 u ) τ r e τ ( e τ u ) 2 e ξ τ
= ξ ω = 0 A ω ( r ) ( ξ ; u ) τ ω ω ! + r τ ω = 0 A ω ( r ) ( ξ ; u ) τ ω ω !
e τ e τ u ω = 0 A ω ( r ) ( ξ ; u ) τ ω ω !
= ξ + r τ ω = 0 A ω ( r ) ( ξ ; u ) τ ω ω ! 1 1 u ω = 0 A ω ( 0 ) ( 1 ; u ) τ ω ω ! ω = 0 A ω ( r ) ( ξ ; u ) τ ω ω !
ω = 0 A ω + 1 ( r ) ( ξ ; u ) τ ω ω ! = ξ + r τ ω = 0 A ω ( r ) ( ξ ; u ) τ ω ω ! 1 1 u ω = 0 v = 0 ω A ω v ( 0 ) ( 1 ; u ) A v ( r ) ( ξ ; u ) τ ω ω !
1 1 u ω = 0 v = 0 ω A ω v ( 0 ) ( 1 ; u ) A v ( r ) ( ξ ; u ) τ ω ω ! .
In view of (25), we obtain (24). □
Let α , u C with u 1 and r Z with r 0 ; we consider the Frobenius–Euler–Genocchi polynomials of order α which are given by
τ r 1 u e τ u α e ξ τ = ω = 0 A ω ( r , α ) ( ξ ; u ) τ ω ω ! .
When ξ = 0 , A ω ( r , α ) ( u ) = A ω ( r , α ) ( 0 ; u ) are called the Frobenius–Euler–Genocchi numbers of order α .
We mention here that these polynomials can be viewed as a special case of polynomials L ω ( f , g , h ) defined by the generating function
f ( τ ) g h ( τ ) = ω 0 L ω ( f , g , h ) τ ω ω ! ,
which are recently studied by Goubi [6]. For this, one can take
f ( τ ) = τ r e ξ τ , g ( τ ) = τ α , h ( τ ) = 1 u e τ u .
Theorem 4.
For ω 0 , we have
A ω ( r , α ) ( ξ ; u ) = ν = 0 ω ω ν A ν ( r , α ) ( u ) ξ ω ν ,
A ω ( r , α ) ( ξ + η ; u ) = ν = 0 ω ω ν A ν ( r , α ) ( ξ ; u ) η ω ν ,
and
A ω ( r , α + β ) ( ξ ; u ) = ν = 0 ω ω ν A ω ν ( r , α ) ( ξ ; u ) H ν ( β ) ( u ) .
Proof. 
By using (26), we can easily furnish a proof of (27) and (28). Again, we write the generating function (24) in the following form
ω = 0 A ω ( r , α + β ) ( ξ ; u ) τ ω ω ! = τ r 1 u e τ u α + β e ξ τ
= ω = 0 A ω ( r , α ) ( ξ ; u ) τ ω ω ! ν = 0 H ν ( β ) ( u ) τ ν ν !
= ω = 0 ν = 0 ω ω ν A ω ν ( r , α ) ( ξ ; u ) H ν ( β ) ( u ) τ ω ω ! .
Comparing the coefficients of τ ω , we obtain the result. □
Theorem 5.
For ω 0 , we have
A ω ( r , m ) ( ξ ; u ) = u 1 u m ( ω ) r k = 0 m m k ( u ) k ( k + ξ ) ω r .
Proof. 
Let α = m ( m N ) . Then, by (26), we obtain
ω = 0 A ω ( r , m ) ( ξ ; u ) τ ω ω ! = τ r ( 1 u ) m ( e τ u ) m e ξ τ
= τ r ( 1 u ) m k = 0 m m k ( u ) m k e ( k + ξ ) τ
= u 1 u m ω = 0 k = 0 m m k ( u ) k ( k + ξ ) ω τ ω + r ω !
= u 1 u m ω = 0 k = 0 m m k ( u ) k ( k + ξ ) ω r ( ω ) r τ ω ω ! .
Therefore, by (26) and (32), we obtain the result. □
Corollary 3.
For ξ = 0 in Theorem 5, we have
A ω ( r , m ) ( u ) = u 1 u m ( ω ) r k = 0 m m k ( u ) k k ω r .
Corollary 4.
For ω 0 , we have
A ω ( r , m ) ( ξ ; u ) = u 1 u m k = 0 ω j = 0 m ω k m j ( u ) j ( j ) ω k r ( ω k ) r ξ k .
Proof. 
By (27) and (33), we have
A ω ( r , m ) ( ξ ; u ) = ν = 0 ω ω ν A ω ν ( r , m ) ( u ) ξ ν
= u 1 u m k = 0 ω j = 0 m ω k m j ( u ) j ( j ) ω k r ( ω k ) r ξ k .
The complete proof of the corollary. □
Theorem 6.
For ω , r 0 with ω r , we have
A ω ( r , α ) ( ξ ; u ) = ( ω ) r H ω r ( α ) ( ξ ; u ) .
Proof. 
From (26), we observe that
ω = r A ω ( r , α ) ( ξ ; u ) τ ω ω ! = τ r 1 u e τ u α e ξ τ
= τ r ω = 0 H ω ( α ) ( ξ ; u ) τ ω ω !
= ω = r H ω r ( α ) ( ξ ; u ) ω ! ( ω r ) ! τ ω ω !
= ω = r ( ω ) r H ω r ( α ) ( ξ ; u ) τ ω ω ! .
By (26) and (37), we obtain the result. □
Corollary 5.
For ξ = 0 in Theorem 6, we have
A ω ( r , α ) ( u ) = ( ω ) r H ω r ( α ) ( u ) .
Theorem 7.
For ω 0 , we have
A ω ( r , α ) ( ξ ; u ) = ( ω ) r ( ξ ) ω r + ( ω ) r ν = 0 ω r 1 ω r ν H ω ν r ( α ) ( u ) ξ ν .
Proof. 
By using (27) and (38), we see that
A ω ( r , α ) ( ξ ; u ) = ν = 0 ω ω ν A ω ν ( r , α ) ( u ) ξ ν
= ν = 0 ω r ω ν A ω ν ( α ) ( u ) ξ ν
= ν = 0 ω r ω ν ( ω ν ) r H ω ν r ( α ) ( u ) ξ ν = ( ω ) r ν = 0 ω r ω r ν H ω ν r ( α ) ( u ) ξ ν
= ( ω ) r ξ ω r + ( ω ) r ν = 0 ω r 1 ω r ν H ω ν r ( α ) ( u ) ξ ν .
Therefore, by (39), we obtain the result. □
Theorem 8.
For ω 0 , we have
A ω ( r , α γ ) ( ξ ; u ) = γ ! u 1 u γ ω = 0 ν = 0 ω ω ν A ν ( r , α ) ( ξ ; u ) S γ ω ν ( u 1 ) τ ω ω ! .
Proof. 
We write the generating function (26) in the following form:
ω = 0 A ω ( r , α γ ) ( ξ ; u ) τ ω ω ! = τ r 1 u e τ u α e ξ τ e τ u γ ( 1 u ) γ
= γ ! u 1 u γ ω = 0 A ω ( r , α ) ( ξ ; u ) τ ω ω ! ν = 0 S γ ν ( u 1 ) τ ν ν !
= γ ! u 1 u γ ω = 0 ν = 0 ω ω ν A ν ( r , α ) ( ξ ; u ) S γ ω ν ( u 1 ) τ ω ω ! .
In view of (37), we obtain the result. □
Theorem 9.
For ω 0 , we have
A ω ( r , α ) ( ξ ; u ) = μ = 0 ω ν = 0 μ ω μ ( ξ ) ν A ω ν ( r , α ) ( u ) S 2 ( μ , ν ) .
Proof. 
From (26), we have
ω = 0 A ω ( r , α ) ( ξ ; u ) τ ω ω ! = τ r 1 u e τ u α e ξ τ
= τ r 1 u e τ u α ( e τ 1 + 1 ) ξ
= τ r 1 u e τ u α ν = 0 ξ ν ( e τ 1 ) ν
= ω = 0 A ω ( r , α ) ( u ) τ ω ω ! ν = 0 ( ξ ) ν μ = ν S 2 ( μ , ν ) τ μ μ !
= ω = 0 μ = 0 ω ν = 0 μ ω μ ( ξ ) ν A ω ν ( r , α ) ( u ) S 2 ( μ , ν ) τ ω ω ! .
In view of (41), we obtain the result. □
Theorem 10.
For ω 0 , we have
( 1 u ) γ A ω ( r , α γ ) ( ξ ; u ) = ν = 0 ω ω ν A ω ν ( r , α ) ( ξ ; u ) p = 0 γ γ p p ν ( u ) γ p .
Proof. 
We write the generating function (26) in the following form
ω = 0 A ω ( r , α γ ) ( ξ ; u ) τ ω ω ! = τ r 1 u e τ u α e ξ τ e τ u γ ( 1 u ) γ
= ( 1 u ) γ ω = 0 A ω ( r , α ) ( ξ ; u ) τ ω ω ! ν = 0 p = 0 γ γ p p ν ( u ) γ p τ ν ν !
= ( 1 u ) γ ω = 0 ν = 0 ω ω ν A ω ν ( r , α ) ( ξ ; u ) p = 0 γ γ p p ν ( u ) γ p τ ω ω ! .
In view of (45), we obtain the result. □

4. Some Applications of Frobenius–Euler–Genocchi Polynomials of Order α

In this part of the paper, by virtue of the Faà di Bruno Formula (46) in Lemma 1 and identities (47) and (48) in Lemmas 2 and 3 for the Bell polynomials of the second kind B n , k , we obtain an explicit formula for Frobenius–Euler–Genocchi polynomials of order α , for r = 0 . We also obtain a determinantal representation of Frobenius–Euler polynomials of order α A ω ( 0 , α ) ( ξ ; u ) = H ω ( α ) ( ξ ; u ) by using a general derivative Formula (49) in Lemma 4 for the ratio of two differentiable functions. Finally, a recursive relation for the Frobenius–Euler polynomials of order α is given. In order to prove our theorems, we give several lemmas below. For previous papers using this method, please see [25,26,27,28,29,30,31].
Lemma 1
([32]). For 0 k n , the Bell polynomials of the second kind are defined by
B n , k ξ 1 , ξ 2 , , ξ n k + 1 = 1 i n l i 0 N i = 1 n i l i = n i = 1 n l i = k n ! i = 1 l k + 1 l i ! i = 1 l k + 1 ξ i i ! l i .
The Faà di Bruno formula can be described in terms of the Bell polynomials of the second kind B n , k ξ 1 , ξ 2 , , ξ n k + 1 ,
d n d t n p g ( t ) = k = 0 n p ( k ) g ( t ) B n , k g ( t ) , g ( t ) , , g n k + 1 ( t ) .
Lemma 2
([32]). For 0 k n , we have
B n , k a b ξ 1 , a b 2 ξ 2 , , a b n k + 1 ξ n k + 1 = a k b n B n , k ξ 1 , ξ 2 , , ξ n k + 1 ,
where a and b are any complex number.
Lemma 3
([32]). For n k 0 , we have
B n , k 1 , 1 , , 1 = S 2 ( n , k ) .
Lemma 4
([33]). Let t ( τ ) and v ( τ ) 0 be differentiable functions; then the kth derivative of the ratio t ( τ ) v ( τ ) can be computed by
d k d τ k t ( τ ) v ( τ ) = ( 1 ) k v k + 1 ( τ ) t ( τ ) v ( τ ) 0 0 0 t ( τ ) v ( τ ) v ( τ ) 0 0 t ( τ ) v ( τ ) 2 1 v ( τ ) 0 0 t ( k 2 ) ( τ ) v ( k 2 ) ( τ ) k 2 1 v ( k 3 ) ( τ ) v ( τ ) 0 t ( k 1 ) ( τ ) v ( k 1 ) ( τ ) k 1 1 v ( k 2 ) ( τ ) k 1 k 2 v ( τ ) v ( τ ) t ( k ) ( τ ) v ( k ) ( τ ) k 1 v ( k 1 ) ( τ ) k k 2 v ( τ ) k k 1 v ( τ )
Theorem 11.
For ω 0 , the Frobenius–Euler polynomials of order α ; H ω ( α ) ( ξ ; u ) can be expressed as
H ω ( α ) ( ξ ; u ) = i = 0 ω ω i 1 u α ξ i j = 0 ω i α j 1 u α + j S 2 ( n i , j ) ,
where
α ω = Γ ( α + ω ) Γ ( α ) .
Proof. 
Applying p ( v ) = 1 v α and v = g ( τ ) = e τ u to the Faà di Bruno Formula (46) and using the identities (47) and (48) yield
d k d τ k 1 e τ u α = i = 0 k 1 v α i B k , i v ( τ ) , v ( τ ) , , v k i + 1 ( τ ) = i = 0 k α i e τ u α i B k , i e τ , e τ , , e τ i = 0 k α i e τ u α i e τ i B k , i 1 , 1 , , 1 = i = 0 k α i 1 u α i S 2 ( k , i ) ,
as τ 0 . It is easy to see that
d k d τ k 1 u α e ξ τ = 1 u α ξ k ,
as τ 0 . By virtue of Leibniz’s formula for the derivative of product of two functions and considering the generating function (26), we obtain
H ω ( α ) ( ξ ; u ) = lim τ 0 d ω d τ ω 1 u e τ u α e ξ τ = i = 0 ω ω i 1 u α ξ i j = 0 ω i α j 1 u α + j S 2 ( ω i , j ) .
So, the proof is completed. □
Theorem 12.
For ω 0 , the determinantal representation of Frobenius–Euler polynomials of order α ; H ω ( α ) ( ξ ; u ) can be computed by
H ω ( α ) ( ξ ; u ) = ( 1 ) ω 1 η 0 0 0 0 ρ 1 η 1 η 0 0 0 ρ 2 η 2 2 1 η 1 0 0 ρ ω η ω 2 ω 2 1 η ω 3 η 0 0 ρ ω 1 η ω 1 ω 1 1 η ω 2 ω 1 ω 2 η 1 η 0 ρ ω η ω ω 1 η ω 1 ω ω 2 η 2 ω ω 1 η 1 ,
where
ρ ω = ξ ω ,
and
η ω = i = 0 ω ( α ) i 1 u i S 2 ( k , i ) .
Proof. 
Let us apply Lemma 4 to t ( τ ) = 1 u α e ξ τ and v ( τ ) = e τ u α . Using a similar approach as in the proof of Theorem 11, we obtain
lim τ 0 d ω t ( τ ) d τ ω = 1 u α ξ ω ,
and
lim τ 0 d ω v ( τ ) d τ ω = 1 u α i = 0 ω ( α ) i 1 u i S 2 ( k , i ) .
Thus, we find that
d ω d τ ω 1 u e τ u α e ξ τ = ( 1 ) ω e τ u α ( ω + 1 ) × t ( τ ) v ( τ ) 0 0 0 t ( τ ) v ( τ ) v ( τ ) 0 0 t ( τ ) v ( τ ) 2 1 v ( τ ) 0 0 t ( ω 2 ) ( τ ) v ( ω 2 ) ( τ ) ω 2 1 v ( ω 3 ) ( τ ) v ( τ ) 0 t ( ω 1 ) ( τ ) v ( ω 1 ) ( τ ) ω 1 1 v ( ω 2 ) ( τ ) ω 1 ω 2 v ( τ ) v ( τ ) t ( ω ) ( τ ) v ( ω ) ( τ ) ω 1 v ( ω 1 ) ( τ ) ω ω 2 v ( τ ) ω ω 1 v ( τ ) ( 1 ) ω ρ 0 η 0 0 0 0 ρ 1 η 1 η 0 0 0 ρ 2 η 2 2 1 η 1 0 0 ρ ω 2 η ω 2 ω 2 1 η ω 3 η 0 0 ρ ω 1 η ω 1 ω 1 1 η ω 2 ω 1 ω 2 η 1 η 0 ρ ω η ω ω 1 η ω 1 ω ω 2 η 2 ω ω 1 η 1 ,
as τ 0 . By virtue of generating function (26), we obtain the desired result. □
Theorem 13.
For ω 0 , the Frobenius–Euler polynomials of order α ; H ω ( α ) ( ξ ; u ) satisfy the recurrence relation as follows:
k = 0 ω ω k i = 0 ω k α i 1 u i S 2 ( ω k , i ) H k ( α ) ( ξ ; u ) = ξ ω .
Proof. 
Differentiating ω times both sides of the following equation with respect to τ ,
e τ u α 1 u e τ u α e ξ τ = 1 u α e ξ τ ,
we have
k = 0 ω ω k d ω k d τ ω k e τ u α d k d τ k 1 u e τ u α e ξ τ = d ω d τ ω 1 u α e ξ τ .
Taking the limit τ 0 , taking into account the Formula (26), and using the Faà di Bruno Formula (46), we obtain
k = 0 ω ω k i = 0 ω k α i 1 u i S 2 ( ω k , i ) H k ( α ) ( ξ ; u ) = ξ ω .

5. Further Remarks

In this section, we introduce Changhee–Frobenius–Euler–Genocchi polynomials and investigate some explicit expressions of Changhee–Frobenius–Euler–Genocchi polynomials. We start with the following definition as.
For u C with u 1 and r Z with r 0 , the Changhee–Frobenius–Euler–Genocchi polynomials are defined by means of the following generating function:
( 1 u ) ( log ( 1 + τ ) ) r ( 1 + τ ) u ( 1 + τ ) ξ = ω = 0 C G ω ( r ) ( ξ ; u ) τ ω ω ! .
At the point ξ = 0 , C G ω ( r ) ( u ) = C G ω ( r ) ( 0 ; u ) are called the Changhee–Frobenius–Euler–Genocchi numbers.
For u = 1 and r = 1 in (50), we obtain (see [14])
2 τ 2 + τ ( 1 + τ ) ξ = ω = 0 C G ω ( ξ ) τ ω ω ! .
Thus, by (50) and (51), we have
C G ω ( 1 ) ( ξ ; 1 ) = C G ω ( ξ ) ( ω 0 ) .
Theorem 14.
For ω 0 , we have
C G ω ( r ) ( ξ ; u ) = σ = 0 ω ν = 0 σ ω σ C G ω σ ( r ) ( u ) ξ ν S 1 ( σ , ν ) .
Proof. 
By using (4) and (50), we see that
ω = 0 C G ω ( ξ ; u ) τ ω ω ! = ( 1 u ) ( log ( 1 + τ ) ) r ( 1 + τ ) u e ξ log 1 + τ
= ω = 0 C G ω ( r ) ( u ) τ ω ω ! ν = 0 ξ ν log ( 1 + τ ) ν ν !
= ω = 0 C G ω ( r ) ( u ) τ ω ω ! σ = 0 ν = 0 σ ξ ν S 1 ( σ , ν ) τ σ σ !
= ω = 0 σ = 0 ω ν = 0 σ ω σ C G ω σ ( r ) ( u ) ξ ν S 1 ( σ , ν ) τ ω ω ! .
Therefore, by (50) and (53), we obtain the result. □
Theorem 15.
For ω 0 , we have
A ω ( r ) ( ξ ; u ) = ν = 0 ω C G ν ( ξ ; u ) S 2 ( ω , ν ) .
Proof. 
By replacing τ by e τ 1 in (50) and using (5), we obtain
( 1 u ) τ r e τ u e ξ τ = ν = 0 C G ω ( r ) ( ξ ; u ) ( e τ 1 ) ν ν !
= ν = 0 C G ν ( r ) ( ξ ; u ) ω = ν S 2 ( ω , ν ) τ ω ω !
= ω = 0 ν = 0 ω C G ν ( r ) ( ξ ; u ) S 2 ( ω , ν ) τ ω ω ! .
Therefore, by (15) and (55), we obtain at the required result. □
Theorem 16.
For ω 0 , we have
C G ω ( ξ ; u ) = ν = 0 ω G ν F ( ξ ; u ) S 1 ( ω , ν ) .
Proof. 
Replacing τ by log ( 1 + τ ) in (12) and using (4), we obtain
( 1 u ) log ( 1 + τ ) ( 1 + τ ) u ( 1 + τ ) ξ = ν = 0 G ν F ( ξ ; u ) 1 ν ! log ( 1 + τ ) ν
= ν = 0 G ν F ( ξ ; u ) ω = ν S 1 ( ω , ν ) τ ω ω !
= ω = 0 ν = 0 ω G ν F ( ξ ; u ) S 1 ( ω , ν ) τ ω ω ! .
By using (50) and (57), we acquire at the desired result. □

6. Computational Values and Graphical Representations of Frobenius–Euler–Genocchi Polynomials

In this section, certain zeros of the Frobenius–Euler–Genocchi polynomials A ω ( 2 ) ( ξ ; u ) and beautifully graphical representations are shown. A few of them are
A 0 ( 2 ) ( ξ ; u ) = 0 , A 1 ( 2 ) ( ξ ; u ) = 0 , A 2 ( 2 ) ( ξ ; u ) = 2 , A 3 ( 2 ) ( ξ ; u ) = 6 1 + u 6 ξ 1 + u + 6 u ξ 1 + u , A 4 ( 2 ) ( ξ ; u ) = 12 ( 1 + u ) 2 + 12 u ( 1 + u ) 2 24 ξ ( 1 + u ) 2 + 24 u ξ ( 1 + u ) 2 + 12 ξ 2 ( 1 + u ) 2 24 u ξ 2 ( 1 + u ) 2 + 12 u 2 ξ 2 ( 1 + u ) 2 , A 5 ( 2 ) ( ξ ; u ) = 20 ( 1 + u ) 4 60 u ( 1 + u ) 4 + 60 u 2 ( 1 + u ) 4 + 20 u 3 ( 1 + u ) 4 60 ξ ( 1 + u ) 3 + 60 u 2 ξ ( 1 + u ) 3 60 ξ 2 ( 1 + u ) 2 + 60 u ξ 2 ( 1 + u ) 2 + 20 ξ 3 1 u 20 u ξ 3 1 u , A 6 ( 2 ) ( ξ ; u ) = 720 ( 1 u ) 5 1080 ( 1 u ) 4 + 420 ( 1 u ) 3 30 ( 1 u ) 2 720 u ( 1 u ) 5 + 1080 u ( 1 u ) 4 420 u ( 1 u ) 3 + 30 u ( 1 u ) 2 120 ξ ( 1 + u ) 4 360 u ξ ( 1 + u ) 4 + 360 u 2 ξ ] ( 1 + u ) 4 + 120 u 3 ξ ( 1 + u ) 4 180 ξ 2 ( 1 + u ) 3 + 180 u 2 ξ 2 ( 1 + u ) 3 120 ξ 3 ( 1 + u ) 2 + 120 u ξ 3 ( 1 + u ) 2 + ( 30 ξ 4 1 u 30 u ξ 4 1 u .
We investigate the beautiful zeros of the Frobenius–Euler–Genocchi polynomials A ω ( 2 ) ( ξ ; u ) by using a computer. We plot the zeros of the Frobenius–Euler–Genocchi polynomials A ω ( 2 ) ( ξ ; u ) = 0 for ω = 40 (Figure 1).
In Figure 1 (top left), we choose r = 2 and u = 7 . In Figure 1 (top right), we choose r = 2 and u = 3 . In Figure 1 (bottom-left), we choose r = 2 and u = 3 . In Figure 1 (bottom-right), we choose r = 2 and u = 7 .
Stacks of zeros of the Frobenius–Euler–Genocchi polynomials A ω ( r ) ( ξ ; u ) = 0 for 3 ω 40 , forming a 3D structure, are presented (Figure 2).
In Figure 2 (top left), we choose r = 2 and u = 7 . In Figure 2 (top right), we choose r = 2 and u = 3 . In Figure 2 (bottom-left), we choose r = 2 and u = 3 . In Figure 2 (bottom-right), we choose r = 2 and u = 7 .
Next, we calculated an approximate solution satisfying the Frobenius–Euler–Genocchi polynomials A ω ( 2 ) ( ξ ; u ) = 0 for u = 3 . The results are given in Table 1.

7. Computational Values and Graphical Representations of Changhee–Frobenius–Euler–Genocchi Polynomials

In this section, certain zeros of the Changhee–Frobenius–Euler–Genocchi C G ω ( r ) ( ξ ; u ) and beautifully graphical representations are shown. A few of them are
C G 1 ( 2 ) ( ξ ; u ) = 0 , C G 2 ( 2 ) ( ξ ; u ) = 2 , C G 3 ( 2 ) ( ξ ; u ) = 12 1 + u 6 u 1 + u 6 ξ 1 + u + 6 u ξ 1 + u , C G 4 ( 2 ) ( ξ ; u ) = 70 ( 1 + u ) 2 68 u ( 1 + u ) 2 + 22 u 2 ( 1 + u ) 2 60 ξ ( 1 + u ) 2 + 96 u ξ ( 1 + u ) 2 36 u 2 ξ ( 1 + u ) 2 + 12 ξ 2 ( 1 + u ) 2 24 u ξ 2 ( 1 + u ) 2 + 12 u 2 ξ 2 ( 1 + u ) 2 , C G 5 ( 2 ) ( ξ ; u ) = 450 ( 1 + u ) 3 640 u ( 1 + u ) 3 + 410 u 2 ( 1 + u ) 3 100 u 3 ( 1 + u ) 3 510 ξ ( 1 + u ) 3 + 1110 u ξ ( 1 + u ) 3 810 u 2 ξ ( 1 + u ) 3 + 210 u 3 ξ ( 1 + u ) 3 + 180 ξ 2 ( 1 + u ) 3 480 u ξ 2 ( 1 + u ) 3 + 420 u 2 ξ 2 ( 1 + u ) 3 120 u 3 ξ 2 ( 1 + u ) 3 20 ξ 3 ( 1 + u ) 3 + 60 u ξ 3 ( 1 + u ) 3 60 u 2 ξ 3 ( 1 + u ) 3 + 20 u 3 ξ 3 ( 1 + u ) 3 ,
C G 6 ( 2 ) ( ξ ; u ) = 720 ( 1 u ) 5 + 660 ( 1 u ) 3 + 548 1 u + 720 ( 1 + u ) 4 + 600 ( 1 + u ) 2 720 u ( 1 u ) 5 660 u ( 1 u ) 3 548 u 1 u 720 u ( 1 + u ) 4 600 u ( 1 + u ) 2 1080 ξ ( 1 u ) 3 1350 ξ 1 u 720 ξ ( 1 + u ) 4 1260 ξ ( 1 + u ) 2 + 1080 u ξ ( 1 u ) 3 + 350 u ξ 1 u + 720 u ξ ( 1 + u ) 4 + 1260 u ξ ( 1 + u ) 2 + 360 ξ 2 ( 1 u ) 3 + 1020 ξ 2 1 u + 720 ξ 2 ( 1 + u ) 2 360 u ξ 2 ( 1 u ) 3 1020 u ξ 2 1 u 720 u ξ 2 ( 1 + u ) 2 300 ξ 3 1 u 120 ξ 3 ( 1 + u ) 2 + 300 u ξ 3 1 u + 120 u ξ 3 ( 1 + u ) 2 + 30 ξ 4 1 u 30 u ξ 4 1 u .
We plot the zeros of the Changhee–Frobenius–Euler–Genocchi C G ω ( r ) ( ξ ; u ) = 0 for ω = 50 (Figure 3).
In Figure 3 (top left), we choose r = 2 and u = 7 . In Figure 3 (top right), we choose r = 2 and u = 3 . In Figure 3 (bottom left), we choose r = 2 and u = 3 . In Figure 3 (bottom right), we choose r = 2 and u = 7 .
Stacks of zeros of the Changhee–Frobenius–Euler–Genocchi C G ω ( r ) ( ξ ; u ) = 0 for 3 ω 50 , forming a 3D structure, are presented (Figure 4).
In Figure 4 (top left), we choose r = 2 and u = 7 . In Figure 4 (top right), we choose r = 2 and u = 3 . In Figure 4 (bottom left), we choose r = 2 and u = 3 . In Figure 4 (bottom right), we choose r = 2 and u = 7 .
Next, we calculated an approximate solution satisfying the Changhee–Frobenius–Euler–Genocchi C G ω ( r ) ( ξ ; u ) = 0 . The results are given in Table 2.

8. Conclusions

The theory of multidimensional or multi-index special functions is a very relevant field of investigation to simplify a wide range of operational relations. It has also been shown that Bell polynomials play a fundamental role in the extension of the classical special functions to the multidimensional case. In this article, we discuss a new class of generalized Frobenius–Euler–Genocchi polynomials and related special cases for the particular values of the parameters. We have used the generating Functions (15) and (26) to study their properties and related results. Using our result (15) and (26) to generalize the well-known class of Bernoulli, Euler, Genocchi, Changhee–Genocchi, and Bernoulli polynomials of the second kind. Moreover, for r = 0 , using the Faà di Bruno formula and some properties of the Bell polynomials of the second kind, we have presented an explicit formula for the Frobenius–Euler polynomials of order α . We have given determinantal representations for the ratio of two differentiable functions. We have obtained a recursive relation for the Frobenius–Euler polynomials of order α . Finally, we have checked the roots and graphical representations of these types of polynomials by making use of Mathematica software. Based on this article, readers can apply the method we presented in the article to many polynomials.

Author Contributions

Conceptualization, W.A.K., C.K.; Formal analysis, W.A.K., C.K.; Funding acquisition, N.A., W.A.K., S.O. and N.S.D.; Investigation, W.A.K.; Methodology, W.A.K.; Project administration, N.A., W.A.K., S.O. and N.S.D.; Software, C.S.R.; Writing—original draft, W.A.K., C.K.; Writing—review and editing, W.A.K., C.K., C.S.R. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Research Deanship at the University of Ha’il, Saudi Arabia, through Project No. RG-21 144.

Data Availability Statement

No data were used to support this study.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Alatawi, M.S.; Khan, W.A. New type of degenerate Changhee-Genocchi polynomials. Axioms 2022, 11, 355. [Google Scholar] [CrossRef]
  2. Luo, Q.-M. On the Apostol Bernoulli polynomials. Cent. Eur. J. Math. 2004, 2, 509–515. [Google Scholar] [CrossRef]
  3. Belbachir, H.; Hadj-Brahim, S. Some explicit formulas of Euler-Genocchi polynomials. Integers 2019, 19, 1–14. [Google Scholar]
  4. Carlitz, L. Eulerian numbers and polynomials. Math. Mag. 1959, 32, 247–260. [Google Scholar] [CrossRef]
  5. Choi, J.; Kim, D.S.; Kim, T.; Kim, Y.H. A note on some identities of Frobenius-Euler numbers and polynomials. Int. J. Math. Math. Sci. 2012, 2012, 861797. [Google Scholar] [CrossRef] [Green Version]
  6. Goubi, M. On a generalized family of Euler-Genocchi polynomials. Integers 2021, 21, 1–13. [Google Scholar]
  7. Iqbal, A.; Khan, W.A.; Nadeem, M. New Type of Degenerate Changhee-Genocchi Polynomials of the Second Kind. In Soft Computing: Theories and Applications; Kumar, R., Verma, A.K., Sharma, T.K., Verma, O.P., Sharma, S., Eds.; Lecture Notes in Networks and Systems; Springer: Berlin/Heidelberg, Germany, 2023; Volume 627. [Google Scholar]
  8. Iqbal, A.; Khan, W.A. A New Family of Generalized Euler-Genocchi Polynomials Associated with Hermite Polynomials. In Soft Computing: Theories and Applications; Kumar, R., Verma, A.K., Sharma, T.K., Verma, O.P., Sharma, S., Eds.; Lecture Notes in Networks and Systems; Springer: Berlin/Heidelberg, Germany, 2023; Volume 627. [Google Scholar]
  9. Kim, T.; Kim, D.S.; Kim, H.K. On generalized degenerate Euler-Genocchi polynomials. Appl. Math. Sci. Eng. 2023, 31, 1. [Google Scholar] [CrossRef]
  10. Nadeem, M.; Khan, W.A. Symmetric Identities For Degenerate q-Poly-Genocchi Numbers And Polynomials. South East Asian J. Math. Math. Sci. 2023, 19, 17–28. [Google Scholar] [CrossRef]
  11. Srivastava, H.M.; Pinter, A. Remarks on some relationships between the Bernoulli and Euler polynomials. Appl. Math. Lett. 2004, 17, 375–380. [Google Scholar] [CrossRef] [Green Version]
  12. Kim, D.S.; Kim, T.; Seo, J. A note on Changhee polynomials and numbers. Adv. Stud. Theor. Phys. 2013, 7, 993–1003. [Google Scholar] [CrossRef]
  13. Kwon, H.-I.; Kim, T.; Park, J.W. A note on degenerate Changhee-Genocchi polynomials and numbers. Glob. J. Pure Appl. Math. 2016, 12, 4057–4064. [Google Scholar]
  14. Kim, B.-M.; Jeong, J.; Rim, S.-H. Some explicit identities on Changhee-Genocchi polynomials and numbers. Adv. Differ. Equ. 2016, 202, 1–12. [Google Scholar] [CrossRef] [Green Version]
  15. Yasar, B.Y.; Ozarslan, M.A. Frobenius-Euler and Frobenius-Genocchi polynomials and their differential equations. New Trend Math. Sci. 2015, 3, 172–180. [Google Scholar]
  16. Kim, D.S.; Kim, T. Some new identities of Frobenius-Euler numbers and polynomials. J. Inequal. Appl. 2012, 2012, 307. [Google Scholar] [CrossRef] [Green Version]
  17. Kim, D.S.; Kim, T. Higher-order Frobenius-Euler and poly-Bernoulli mixed-type polynomials. Adv. Differ. Equ. 2013, 2013, 251. [Google Scholar] [CrossRef] [Green Version]
  18. Srivastava, H.M.; Boutiche, M.A.; Rahmani, M. Some explicit formulas for the Frobenius- Euler polynomials of higher order. Appl. Math. Inf. Sci. 2017, 11, 621–626. [Google Scholar] [CrossRef]
  19. Kurt, B.; Simsek, Y. On the generalized Apostol-type Frobenius-Euler polynomials. Adv. Differ. Equ. 2013, 2013, 1. [Google Scholar] [CrossRef] [Green Version]
  20. Cakić, N.P.; Milovanović, G. On generalized Stirling number and polynomials. Math. Balk. 2004, 18, 241–248. [Google Scholar]
  21. Jamei, M.J.; Milovanović, G.; Dagli, M.C. A generalization of the array type polynomials. Math. Moravica 2022, 26, 37–46. [Google Scholar] [CrossRef]
  22. Luo, Q.M.; Srivastava, H.M. Some generalization of the Apostol-Genocchi polynomials and Stirling numbers of the second kind. Appl. Math. Comput. 2011, 217, 5702–5728. [Google Scholar] [CrossRef]
  23. Belbachir, H.; Hadj-Brahim, S.; Rachidi, M. On another approach for a family of Appell polynomials. Filomat 2018, 12, 4155–4164. [Google Scholar] [CrossRef]
  24. Borisov, B.S. The p-binomial transform Cauchy numbers and figurate numbers. Proc. Jangjeon Math. Soc. 2016, 19, 631–644. [Google Scholar]
  25. Wang, Y.; Dagli, M.C.; Liu, X.-M.; Qi, F. Explicit, determinantal, and recurrent formulas of generalized Eulerian polynomials. Axioms 2021, 10, 37. [Google Scholar] [CrossRef]
  26. Qi, F.; Guo, B.-N. Explicit formulas for special values of the Bell polynomials of the second kind and for the Euler numbers and polynomials. Mediterr. J. Math. 2017, 14, 140. [Google Scholar] [CrossRef]
  27. Kızılateş, C. Explicit, determinantal, recursive formulas, and generating functions of generalized Humbert-Hermite polynomials via generalized Fibonacci Polynomials. Math. Methods Appl Sci. 2023, 46, 9205–9216. [Google Scholar] [CrossRef]
  28. Dagli, M.C. Explicit, determinantal, recursive formulas and relations of the Peters polynomials and numbers. Math. Methods Appl. Sci. 2022, 45, 2582–2591. [Google Scholar] [CrossRef]
  29. Qi, F.; Dağlı, M.C.; Lim, D. Several explicit formulas for (degenerate) Narumi and Cauchy polynomials and numbers. Open Math. 2021, 19, 833–849. [Google Scholar] [CrossRef]
  30. Qi, F.; Zheng, M.-M. Explicit expressions for a family of the Bell polynomials and applications. Appl. Math. Comput. 2015, 258, 597–607. [Google Scholar] [CrossRef] [Green Version]
  31. Qi, F.; Niu, D.-W.; Lim, D.; Yao, Y.-H. Special values of the Bell polynomials of the second kind for some sequences and functions. J. Math. Anal. Appl. 2020, 491, 124382. [Google Scholar] [CrossRef]
  32. Comtet, L. Advanced Combinatorics: The Art of Finite and Infinite Expansions; Springer Science & Business Media: Berlin/Heidelberg, Germany, 1974. [Google Scholar]
  33. Bourbaki, N. Functions of a Real Variable, Elementary Theory, Translated from the 1976 French original by Philip Spain. In Elements of Mathematics; Springer: Berlin/Heidelberg, Germany, 2004. [Google Scholar]
Figure 1. Zeros   of   A ω ( r ) ( ξ ; u ) = 0 .
Figure 1. Zeros   of   A ω ( r ) ( ξ ; u ) = 0 .
Symmetry 15 01358 g001aSymmetry 15 01358 g001b
Figure 2. Zeros   of   A ω ( r ) ( ξ ; u ) = 0 .
Figure 2. Zeros   of   A ω ( r ) ( ξ ; u ) = 0 .
Symmetry 15 01358 g002
Figure 3. Zeros   of   C G ω ( r ) ( ξ ; u ) = 0 .
Figure 3. Zeros   of   C G ω ( r ) ( ξ ; u ) = 0 .
Symmetry 15 01358 g003
Figure 4. Zeros   of   H n , q ( α , c ) ( x , y ; u ; λ ) .
Figure 4. Zeros   of   H n , q ( α , c ) ( x , y ; u ; λ ) .
Symmetry 15 01358 g004
Table 1. Approximate solutions of A ω ( 2 ) ( ξ ; u ) = 0 .
Table 1. Approximate solutions of A ω ( 2 ) ( ξ ; u ) = 0 .
Degree ω ξ
3−0.50000
4−0.50000 − 0.86603i, −0.50000 + 0.86603 i
5−1.0800, −0.2100 − 1.5819 i, −0.2100 + 1.5819 i
6−1.1991 − 0.7701 i, −1.1991 + 0.7701 i,
0.1991 − 2.2101 i, 0.1991 + 2.2101 i
7−1.6268, −1.1130 − 1.4787i, −1.1130 + 1.4787 i,
0.6764 − 2.7763 i, 0.6764 + 2.7763 i
8−1.7906 − 0.7321 i, −1.7906 + 0.7321i, −0.9087 − 2.1385 i,
−0.9087 + 2.1385 i, 1.1993 − 3.2957i, 1.1993 + 3.2957 i
9−2.1611, −1.7990 − 1.4290 i, −1.7990 + 1.4290 i, −0.6261 − 2.7580 i,
−0.6261 + 2.7580 i, 1.7556 − 3.7778 i, 1.7556 + 3.7778 i
10−2.3477 − 0.7111 i, −2.3477 + 0.7111 i, −1.7030 − 2.0940 i,
−1.7030 + 2.0940 i, −0.2870 − 3.3436 i, −0.2870 + 3.3436 i,
2.3378 − 4.2296 i, 2.3378 + 4.2296 i
11−2.6889, −2.4100 − 1.3992 i, −2.4100 + 1.3992 i,
−1.5315 − 2.7306 i, −1.5315 + 2.7306 i, 0.0952 − 3.8998 i,
0.0952 + 3.8998 i, 2.9407 − 4.6560 i, 2.9407 + 4.6560 i
Table 2. Approximate solutions of C G ω ( 2 ) ( ξ ; 3 ) = 0 .
Table 2. Approximate solutions of C G ω ( 2 ) ( ξ ; 3 ) = 0 .
Degree ω ξ
31.2500
40.97272, 2.5273
50.83715, 2.2045, 3.7084
60.75834, 2.0289, 3.3703, 4.8425
70.70700, 1.9225, 3.1696, 4.5035, 5.9475
80.67047, 1.8533, 3.0413, 4.2873, 5.6152, 7.0324
90.64266, 1.8052, 2.9562, 4.1418, 5.3905, 6.7113, 8.1024
100.62043, 1.7695, 2.8973, 4.0421, 5.2320, 6.4829, 7.7949, 9.1609
110.60202, 1.7414, 2.8545, 3.9723, 5.1194, 6.3151, 7.5666, 8.8684, 10.210
120.58638, 1.7185, 2.8218, 3.9220, 5.0389, 6.1915, 7.3925, 8.6427, 9.9333, 11.252
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

Alam, N.; Khan, W.A.; Kızılateş, C.; Obeidat, S.; Ryoo, C.S.; Diab, N.S. Some Explicit Properties of Frobenius–Euler–Genocchi Polynomials with Applications in Computer Modeling. Symmetry 2023, 15, 1358. https://doi.org/10.3390/sym15071358

AMA Style

Alam N, Khan WA, Kızılateş C, Obeidat S, Ryoo CS, Diab NS. Some Explicit Properties of Frobenius–Euler–Genocchi Polynomials with Applications in Computer Modeling. Symmetry. 2023; 15(7):1358. https://doi.org/10.3390/sym15071358

Chicago/Turabian Style

Alam, Noor, Waseem Ahmad Khan, Can Kızılateş, Sofian Obeidat, Cheon Seoung Ryoo, and Nabawia Shaban Diab. 2023. "Some Explicit Properties of Frobenius–Euler–Genocchi Polynomials with Applications in Computer Modeling" Symmetry 15, no. 7: 1358. https://doi.org/10.3390/sym15071358

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