Abstract
In this paper, by using the Golden Calculus, we introduce the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials and numbers; additionally, we obtain various fundamental identities and properties associated with these polynomials and numbers, such as summation theorems, difference equations, derivative properties, recurrence relations, and more. Subsequently, we present summation formulas, Stirling–Fibonacci numbers of the second kind, and relationships for these polynomials and numbers. Finally, we define the new family of the generalized Apostol-type Frobenius–Euler–Fibonacci matrix and obtain some factorizations of this newly established matrix. Using Mathematica, the computational formulae and graphical representation for the mentioned polynomials are obtained.
Keywords:
Golden Calculus; Apostol-type Frobenius–Euler polynomials; Apostol-type Frobenius–Euler–Fibonacci polynomials; Stirling–Fibonacci numbers MSC:
11B68; 11B83; 05A15; 05A19
1. Introduction
Recently, numerous scholars [1,2,3] have defined and developed methods of generating functions for new families of special polynomials, including Bernoulli, Euler, and Genocchi polynomials. These authors have established the basic properties of these polynomials and have derived a variety of identities using the generating function. Furthermore, by using the partial derivative operator to these generating functions, some derivative formulae and finite combinatorial sums involving the above-mentioned polynomials and numbers have been obtained. These special polynomials also provide the straightforward derivation of various important identities. As a result, numerous experts in number theory and combinatorics have exhaustively studied their properties and obtained a series of interesting results.
For any , and , the Apostol-type Frobenius–Euler polynomials of order are introduced (see [4,5,6,7]).
For , are called the Apostol-type Frobenius–Euler numbers of order . From (1), we known that
and
where are the Apostol–Euler polynomials of order .
The generalized -Stirling numbers of the second kind are given by (see [8])
for and , where gives the well-known Stirling numbers of the second kind; these are defined as follows (see [9,10]).
The Apostol-type Bernoulli polynomials of order , the Apostol-type Euler polynomials of order , and the Apostol-type Genocchi polynomials of order are defined by (see [8,12]):
and
respectively.
Clearly, we have
The subject of Golden Calculus (or F-calculus) emerged in the nineteenth century due to its wide-ranging applications in fields such as mathematics, physics, and engineering. The -extended finite operator calculus of Rota was studied by A.K. Kwaśniewski [13]. Krot [14] defined and studied F-calculus and gave some properties of these calculus types. Pashaev and Nalci [15] dealt extensively with the Golden Calculus and obtained many properties and used these concepts especially in the field of mathematical physics. The definitions and notation of Golden Calculus (or F-calculus) are taken from [15,16,17,18].
The Fibonacci sequence is defined by the following recurrence relation:
where , . Fibonacci numbers can be expressed explicitly as
where and . is called Golden ratio. The Golden ratio is a frequently occurring number in many branches of science and mathematics. Pashaev and Nalci [15] have thoroughly studied the miscellaneous properties of Golden Calculus. Additional references include Pashaev [18], Krot [14], and Pashaev and Ozvatan [19].
The F-factorial was defined as follows:
where . The binomial theorem for the F-analogues (or the Golden binomial theorem) are given by
in terms of the Golden binomial coefficients, referred to as Fibonomials
with w and l being non-negative integers, . The Fibonomial coefficients have following identity:
The F-derivative is introduced as follows:
respectively. The first and second types of Golden exponential functions are defined as
Briefly, we use the following notations throughout the paper
and
and satisfy the following identity (see [17]).
The Apostol-type Bernoulli–Fibonacci polynomials of order , the Apostol-type Euler–Fibonacci polynomials of order and the Apostol-type Genocchi–Fibonacci polynomials of order are defined by (see [20,21,22]):
and
respectively.
Clearly, we have
In light of the above studies, we define a new family of two-variable polynomials, including the polynomials defined by Equation (1) with the help of the Golden Calculus. Namely, we introduce the concept of the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials and numbers. Thus, we give some properties of this polynomial family, such as recurrence relations, sums formulae, and derivative relations, by using their generating function and functional equations. Additionally, we establish relationships between Apostol-type Frobenius–Euler–Fibonacci polynomials of order and various other polynomial sequences, including Apostol-type Bernoulli–Fibonacci polynomials, Euler–Fibonacci polynomials, Genocchi–Fibonacci polynomials, and the Stirling–Fibonacci numbers of the second kind. We also introduce the new family of the generalized Apostol-type Frobenius–Euler–Fibonacci matrix and derive some factorizations of this newly established matrix. Finally, we provide zeroes and graphical illustrations for the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials.
2. Generalized Apostol-Type Frobenius–Euler–Fibonacci Polynomials
In this part, we introduce Apostol-type Frobenius–Euler–Fibonacci polynomials by means of the Golden Calculus. Some relations for these polynomials are also obtained by using various identities. At this point, we begin with the following definition.
Definition 1.
Let , , the generalized Apostol-type Frobenius–Euler polynomials of order α are defined by means of the following generating function:
When in (20), are called the Apostol-type Frobenius–Euler–Fibonacci numbers of order .
Theorem 1.
The following summation formulas for the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials of order α holds true:
and
Theorem 2.
The following recursive formulas for the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials of order α hold true:
Proof.
Theorem 3.
The following difference formulas for the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials of order α holds true:
and
Theorem 4.
Let , the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials of order α hold true:
and
In the following theorems, we establish some results on the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials of order and some relationships for Apostol-type Frobenius–Euler–Fibonacci polynomials of order related to Apostol-type Bernoulli–Fibonacci polynomials, Apostol-type Euler–Fibonacci polynomials, and Apostol-type Genocchi–Fibonacci polynomials. We now begin with the following theorem.
Theorem 5.
For the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials , one has
Proof.
We set
From the above equation, we see that
through which, in using Equations (16) and (20) in both sides, we have
By applying the Cauchy product rule in the aforementioned equation and subsequently comparing the coefficients of in both sides of the resulting equation, it can be deduced that assertion (30) holds true. □
Theorem 6.
For the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials , one has
Proof.
Using the following identity
we find that
By applying the Cauchy product rule in the aforementioned equation and subsequently comparing the coefficients of in both sides of the resulting equation, it can be deduced that assertion (31) holds true. □
Theorem 7.
For the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials of order α, we obtain
Proof.
By applying the Cauchy product rule in the aforementioned equation and subsequently comparing the coefficients of in both sides of the resulting equation, it can be deduced that assertion (32) holds true. □
Theorem 8.
The following relation between the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials and Apostol-type Bernoulli–Fibonacci polynomials holds true:
Proof.
Theorem 9.
The following relation between the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials and generalized Apostol-type Euler–Fibonacci polynomials holds true:
Proof.
Theorem 10.
The following relation between the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials and Apostol-type Genocchi–Fibonacci polynomials holds true:
Proof.
Theorem 11.
For the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials of order α, we obtain
Proof.
Theorem 12.
For the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials of order α, we have
Proof.
Finally, equating the coefficients of the like powers of , we obtain (40). □
Theorem 13.
Let α and γ be non-negative integers. There is the following relationship between the numbers and the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials of order α, which holds true:
and
where is the Stirling–Fibonacci numbers of the second kind are defined by
Proof.
Now, we define the new family of generalized Apostol-type Frobenius–Euler–Fibonacci matrices. By using this definition, we obtain the factorizations of this newly established matrix in the following theorems.
Definition 2.
Let be the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials. The generalized Apostol-type Frobenius–Euler-Fibonacci matrix, is defined by
Theorem 14.
For the generalized Apostol-type Frobenius–Euler–Fibonacci matrix , we have
Theorem 15.
For the generalized Apostol-type Frobenius–Euler–Fibonacci matrix , we have
where is the generalized Pascal matrix [23] via Fibonomial coefficients of the first kind is defined by
3. Some Values with Graphical Representations and Zeros of the Generalized Apostol-Type Frobenius–Euler–Fibonacci Polynomials
In this section, evidence of the zeros of the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials is displayed, along with visually appealing graphical representations. A few of them are presented here:
We investigate the beautiful zeros of the generalized Apostol-type Frobenius–Euler polynomials of order by using a computer. We plot the zeros of generalized Apostol-type Frobenius–Euler polynomials of order 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 generalized Apostol-type Frobenius–Euler polynomials of order 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 .
Plots of real zeros of the generalized Apostol-type Frobenius–Euler polynomials of order for are presented (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 .
Next, we calculated an approximate solution satisfying the generalized Apostol-type Frobenius–Euler polynomials of order . The results are given in Table 1. We choose and .
Table 1.
Approximate solutions of .
4. Conclusions
In this article, our objective was to introduce the F-analogues of the Apostol-type Frobenius–Euler polynomials, which we have denoted as generalized Apostol-type Frobenius–Euler–Fibonacci polynomials. We have employed the Golden Calculus to introduce these polynomials and subsequently explored their properties. Our work represents a generalization of the previously published articles [24]. In our future research studies, we intend to utilize the Golden Calculus to introduce the parametric types of certain special polynomials and to derive a plethora of combinatorial identities through their generating functions.
Author Contributions
Conceptualization, M.S.A., W.A.K., C.K. and C.S.R.; formal analysis, M.S.A., W.A.K., C.K. and C.S.R.; funding acquisition, M.S.A. and W.A.K.; investigation, W.A.K. and C.K.; methodology, M.S.A., W.A.K., C.K. and C.S.R.; project administration, M.S.A., W.A.K., C.K. and C.S.R.; software, M.S.A., W.A.K., C.K. and C.S.R.; writing—original draft, W.A.K. and C.K.; writing—review and editing, M.S.A., W.A.K., C.K. and C.S.R. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
No data were used to support this study.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Alam, N.; Khan, W.A.; Ryoo, C.S. A note on Bell-based Apostol-type Frobenius–Euler polynomials of complex variable with its certain applications. Mathematics 2022, 10, 2109. [Google Scholar] [CrossRef]
- Khan, W.A.; Haroon, H. Some symmetric identities for the generalized Bernoulli, Euler and Genocchi polynomials associated with Hermite polynomials. Springer Plus 2016, 5, 1920. [Google Scholar] [CrossRef] [PubMed]
- Pathan, M.A.; Khan, W.A. A new class of generalized Apostol-type Frobenius–Euler–Hermite polynomials. Honam Math. J. 2020, 42, 477–499. [Google Scholar]
- Carlitz, L. Eulerian numbers and polynomials. Mat. Mag. 1959, 32, 164–171. [Google Scholar] [CrossRef]
- Kurt, B.; Simsek, Y. On the generalized Apostol-type Frobenius–Euler polynomials. Adv. Differ. Equ. 2013, 2013, 1. [Google Scholar] [CrossRef]
- Kim, D.S.; Kim, T. Some new identities of Frobenius–Euler numbers and polynomials. J. Inequal. Appl. 2012, 2012, 307. [Google Scholar] [CrossRef]
- Ryoo, C.S. A note on the Frobenius Euler polynomials. Proc. Jangjeon Math. Soc. 2011, 14, 495–501. [Google Scholar]
- Luo, Q.M.; Srivastava, H.M. Some generalizations of the Apostol-Bernoulli and Apostol–Euler polynomials. J. Math. Anal. Appl. 2005, 308, 290–302. [Google Scholar] [CrossRef]
- Milovanović, C. On generalized Stirling number and polynomials. Math. Balk. New Ser. 2004, 18, 241–248. [Google Scholar]
- Jamei, M.J.; Milovanović, G.; Dagli, M.C. A generalization of the array type polynomials. Math. Morav. 2022, 26, 37–46. [Google Scholar] [CrossRef]
- Simsek, Y. Generating functions for generalized Stirling type numbers, Array type polynomials, Eulerian type polynomials and their applications. J. Fixed Point Theory Appl. 2013, 2013, 87. [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]
- Kwaśniewski, A.K. Towards ψ-extension of Rota’s finite operator calculus. Rep. Math. Phys. 2001, 47, 305–342. [Google Scholar] [CrossRef]
- Krot, E. An introduction to finite fibonomial calculus. Cent. Eur. J. Math. 2004, 2, 754–766. [Google Scholar] [CrossRef]
- Pashaev, O.K.; Nalci, S. Golden quantum oscillator and Binet–Fibonacci calculus. J. Phys. A Math. Theor. 2012, 45, 015303. [Google Scholar] [CrossRef]
- Kus, S.; Tuglu, N.; Kim, T. Bernoulli F-polynomials and Fibo-Bernoulli matrices. Adv. Differ. Equ. 2019, 2019, 145. [Google Scholar] [CrossRef]
- Özvatan, M. Generalized Golden-Fibonacci Calculus and Applications. Master’s Thesis, Izmir Institute of Technology, Urla, Türkiye, 2018. [Google Scholar]
- Pashaev, O.K. Quantum calculus of Fibonacci divisors and infinite hierarchy of bosonic-fermionic golden quantum oscillators. Int. J. Geom. Methods Mod. Phys. 2021, 18, 2150075. [Google Scholar] [CrossRef]
- Pashaev, O.K.; Ozvatan, M. Bernoulli–Fibonacci Polynomials. arXiv 2020, arXiv:2010.15080. [Google Scholar]
- Gulal, E.; Tuglu, N. Apostol-Bernoulli–Fibonacci polynomials, Apostol–Euler–Fibonacci polynomials and their generating functions. Turk. J. Math. Comput. Sci. 2023, 15, 202–210. [Google Scholar] [CrossRef]
- Kızılateş, C.; Öztürk, H. On parametric types of Apostol Bernoulli–Fibonacci Apostol Euler–Fibonacci and Apostol Genocchi–Fibonacci polynomials via Golden Calculus. AIMS Math. 2023, 8, 8386–8402. [Google Scholar] [CrossRef]
- Tuğlu, N.; Ercan, E. Some properties of Apostol Bernoulli Fibonacci and Apostol Euler Fibonacci Polynomials. In Proceedings of the International Conference on Mathematics and Mathematics Education, Ankara, Turkey, 16–18 September 2021; pp. 32–34. [Google Scholar]
- Tuglu, N.; Yesil, F.; Gokcen Kocer, E.; Dziemiańczuk, M. The F-Analogue of Riordan Representation of Pascal Matrices via Fibonomial Coefficients. J. Appl. Math. 2014, 2014, 841826. [Google Scholar] [CrossRef]
- Urielesa, A.; Ramırezb, W.; Ha, L.C.P.; Ortegac, M.J.; Arenas-Penalozac, J. On F-Frobenius–Euler polynomials and their matrix approach. J. Math. Comput. Sci. 2024, 32, 377–386. [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. |
© 2024 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/).


