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.
Keywords:
Changhee–Genocchi polynomials; Changhee–Frobenius-Euler polynomials; Changhee–Frobenius–Genocchi polynomials and numbers MSC:
11B83; 11B73; 05A19
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])
and
respectively.
In the case when , , and are called the Bernoulli, Euler, and Genocchi numbers.
We note that
The Stirling numbers of the first kind are provided by
The Stirling numbers of the second kind are provided by
The Bernoulli polynomials of the second kind are introduced by (see [24])
When , are called the Bernoulli numbers of the second kind.
The Changhee polynomials are introduced by (see [12])
When , are called the Changhee numbers.
The Changhee–Genocchi polynomials are introduced by the generating function (see [1,13])
When , are termed as the Changhee–Genocchi numbers.
Recently, Kim et al. [14] introduced the modified Changhee–Genocchi polynomials as follows:
When , are termed as the modified Changhee–Genocchi numbers.
For with , the Frobenius–Euler polynomials are defined by (see [5])
When , are termed as the Frobenius–Euler numbers.
For with , the Frobenius–Genocchi polynomials are introduced by (see [15])
When , are termed as the Frobenius–Genocchi numbers.
The generalized -Stirling numbers of the second kind are provided by (see [21,22])
for and , where gives the well-known Stirling numbers of the second kind.
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 , 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 with and with , we consider the Frobenius–Euler–Genocchi polynomials given by
Note that .
At the point are termed as the Frobenius–Euler–Genocchi numbers. Observe that
Therefore, we have
Theorem 1.
For , we have
where
Corollary 1.
For and in Theorem 1, we obtain
Corollary 2.
For and in Theorem 1, we obtain
Theorem 2.
For with , we have
Theorem 3.
For , we have
Let with and with ; we consider the Frobenius–Euler–Genocchi polynomials of order which are given by
When , are called the Frobenius–Euler–Genocchi numbers of order .
We mention here that these polynomials can be viewed as a special case of polynomials defined by the generating function
which are recently studied by Goubi [6]. For this, one can take
Theorem 4.
For , we have
and
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
Comparing the coefficients of , we obtain the result. □
Theorem 5.
For , we have
Corollary 3.
For in Theorem 5, we have
Corollary 4.
For , we have
Theorem 6.
For with , we have
Corollary 5.
For in Theorem 6, we have
Theorem 7.
For , we have
Theorem 8.
For , we have
Proof.
In view of (37), we obtain the result. □
Theorem 9.
For , we have
Theorem 10.
For , we have
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 we obtain an explicit formula for Frobenius–Euler–Genocchi polynomials of order , for . We also obtain a determinantal representation of Frobenius–Euler polynomials of order 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 the Bell polynomials of the second kind are defined by
The Faà di Bruno formula can be described in terms of the Bell polynomials of the second kind
Lemma 2
([32]). For we have
where a and b are any complex number.
Lemma 3
([32]). For we have
Lemma 4
([33]). Let and be differentiable functions; then the kth derivative of the ratio can be computed by
Theorem 11.
For the Frobenius–Euler polynomials of order can be expressed as
where
Proof.
Theorem 12.
For the determinantal representation of Frobenius–Euler polynomials of order can be computed by
where
and
Proof.
Let us apply Lemma 4 to and Using a similar approach as in the proof of Theorem 11, we obtain
and
Thus, we find that
as By virtue of generating function (26), we obtain the desired result. □
Theorem 13.
For , the Frobenius–Euler polynomials of order satisfy the recurrence relation as follows:
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 with and with , the Changhee–Frobenius–Euler–Genocchi polynomials are defined by means of the following generating function:
At the point are called the Changhee–Frobenius–Euler–Genocchi numbers.
Theorem 14.
For , we have
Theorem 15.
For , we have
Proof.
Theorem 16.
For , we have
6. Computational Values and Graphical Representations of Frobenius–Euler–Genocchi Polynomials
In this section, certain zeros of the Frobenius–Euler–Genocchi polynomials and beautifully graphical representations are shown. A few of them are
We investigate the beautiful zeros of the Frobenius–Euler–Genocchi polynomials by using a computer. We plot the zeros of the Frobenius–Euler–Genocchi polynomials for (Figure 1).

Figure 1.
.
In Figure 1 (top left), we choose and . In Figure 1 (top right), we choose and . In Figure 1 (bottom-left), we choose and . In Figure 1 (bottom-right), we choose and .
Stacks of zeros of the Frobenius–Euler–Genocchi polynomials for , forming a 3D structure, are presented (Figure 2).
Figure 2.
.
In Figure 2 (top left), we choose and . In Figure 2 (top right), we choose and . In Figure 2 (bottom-left), we choose and . In Figure 2 (bottom-right), we choose and .
Next, we calculated an approximate solution satisfying the Frobenius–Euler–Genocchi polynomials for . The results are given in Table 1.
Table 1.
Approximate solutions of .
7. Computational Values and Graphical Representations of Changhee–Frobenius–Euler–Genocchi Polynomials
In this section, certain zeros of the Changhee–Frobenius–Euler–Genocchi and beautifully graphical representations are shown. A few of them are
We plot the zeros of the Changhee–Frobenius–Euler–Genocchi for (Figure 3).
Figure 3.
.
In Figure 3 (top left), we choose and . In Figure 3 (top right), we choose and . In Figure 3 (bottom left), we choose and . In Figure 3 (bottom right), we choose and .
Stacks of zeros of the Changhee–Frobenius–Euler–Genocchi for , forming a 3D structure, are presented (Figure 4).
Figure 4.
.
In Figure 4 (top left), we choose and . In Figure 4 (top right), we choose and . In Figure 4 (bottom left), we choose and . In Figure 4 (bottom right), we choose and .
Next, we calculated an approximate solution satisfying the Changhee–Frobenius–Euler–Genocchi . The results are given in Table 2.
Table 2.
Approximate solutions of .
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 , 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
- Alatawi, M.S.; Khan, W.A. New type of degenerate Changhee-Genocchi polynomials. Axioms 2022, 11, 355. [Google Scholar] [CrossRef]
- Luo, Q.-M. On the Apostol Bernoulli polynomials. Cent. Eur. J. Math. 2004, 2, 509–515. [Google Scholar] [CrossRef]
- Belbachir, H.; Hadj-Brahim, S. Some explicit formulas of Euler-Genocchi polynomials. Integers 2019, 19, 1–14. [Google Scholar]
- Carlitz, L. Eulerian numbers and polynomials. Math. Mag. 1959, 32, 247–260. [Google Scholar] [CrossRef]
- 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]
- Goubi, M. On a generalized family of Euler-Genocchi polynomials. Integers 2021, 21, 1–13. [Google Scholar]
- 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]
- 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]
- Kim, T.; Kim, D.S.; Kim, H.K. On generalized degenerate Euler-Genocchi polynomials. Appl. Math. Sci. Eng. 2023, 31, 1. [Google Scholar] [CrossRef]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Kim, D.S.; Kim, T. Some new identities of Frobenius-Euler numbers and polynomials. J. Inequal. Appl. 2012, 2012, 307. [Google Scholar] [CrossRef]
- Kim, D.S.; Kim, T. Higher-order Frobenius-Euler and poly-Bernoulli mixed-type polynomials. Adv. Differ. Equ. 2013, 2013, 251. [Google Scholar] [CrossRef]
- 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]
- Kurt, B.; Simsek, Y. On the generalized Apostol-type Frobenius-Euler polynomials. Adv. Differ. Equ. 2013, 2013, 1. [Google Scholar] [CrossRef]
- Cakić, N.P.; Milovanović, G. On generalized Stirling number and polynomials. Math. Balk. 2004, 18, 241–248. [Google Scholar]
- Jamei, M.J.; Milovanović, G.; Dagli, M.C. A generalization of the array type polynomials. Math. Moravica 2022, 26, 37–46. [Google Scholar] [CrossRef]
- 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]
- Belbachir, H.; Hadj-Brahim, S.; Rachidi, M. On another approach for a family of Appell polynomials. Filomat 2018, 12, 4155–4164. [Google Scholar] [CrossRef]
- Borisov, B.S. The p-binomial transform Cauchy numbers and figurate numbers. Proc. Jangjeon Math. Soc. 2016, 19, 631–644. [Google Scholar]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Comtet, L. Advanced Combinatorics: The Art of Finite and Infinite Expansions; Springer Science & Business Media: Berlin/Heidelberg, Germany, 1974. [Google Scholar]
- 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]
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. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).