Next Article in Journal
Gauging Fractons and Linearized Gravity
Next Article in Special Issue
Coefficient Bounds for Symmetric Subclasses of q-Convolution-Related Analytical Functions
Previous Article in Journal
Chromatic Differentiation of Functional Mappings of the Composition of Nucleic Acids
Previous Article in Special Issue
On Some Bounds for the Gamma Function
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Generalized Bivariate (p,q)-Bernoulli–Fibonacci Polynomials and Generalized Bivariate (p,q)-Bernoulli–Lucas Polynomials

1
Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China
2
School of Computer Science of Information Technology, Qiannan Normal University for Nationalities, Duyun 558000, China
3
Department of Mathematics and Natural Sciences, Prince Mohammad Bin Fahd University, P.O. Box 1664, Al Khobar 31952, Saudi Arabia
4
Department of Mathematics, Zonguldak Bülent Ecevit University, Zonguldak 67100, Turkey
*
Authors to whom correspondence should be addressed.
Symmetry 2023, 15(4), 943; https://doi.org/10.3390/sym15040943
Submission received: 17 March 2023 / Revised: 8 April 2023 / Accepted: 17 April 2023 / Published: 20 April 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 paper, we define the generalized ( p , q ) -Bernoulli–Fibonacci and generalized ( p , q ) -Bernoulli–Lucas polynomials and numbers by using the ( p , q ) -Bernoulli numbers, unified ( p , q ) -Bernoulli polynomials, h ( x ) -Fibonacci polynomials, and h ( x ) -Lucas polynomials. We also introduce the generalized bivariate ( p , q ) -Bernoulli–Fibonacci and generalized bivariate ( p , q ) -Bernoulli–Lucas polynomials and numbers. Then, we derive some properties of these newly established polynomials and numbers by using their generating functions with their functional equations. Finally, we provide some families of bilinear and bilateral generating functions for the generalized bivariate ( p , q ) -Bernoulli–Fibonacci polynomials.

1. Introduction

Special polynomials and special numbers are frequently used in many branches of mathematics, especially in areas such as mathematical physics, mathematical modeling, difference equations, and analytical number theory. With the help of the generating functions of these polynomials and numbers, some identities, sum formulas, and symmetric identities containing these polynomials have been obtained. Many special numbers and special polynomials including Fibonacci and Lucas numbers have been studied with interest by mathematicians from past to present. For n 2 , Fibonacci and Lucas numbers [1] are defined by
F n = F n 1 + F n 2 ,
and
L n = L n 1 + L n 2 ,
with the initial values F 0 = 0 , F 1 = 1 , L 0 = 2 , and L 1 = 1 . In [2], Nalli and Haukkanen defined the h ( x ) -Fibonacci polynomials and h ( x ) -Lucas polynomials, including the Fibonacci polynomials, Pell polynomials, Lucas polynomials, and Pell–Lucas polynomials. Let h ( x ) be a polynomial with real coefficients. The recurrence relations of the h ( x ) -Fibonacci polynomials and h ( x ) -Lucas polynomials are defined by
F n , h ( x ) = h ( x ) F n 1 , h ( x ) + F n 2 , h ( x ) , n 2
and
L n , h ( x ) = h ( x ) L n 1 , h ( x ) + L n 2 , h ( x ) , n 2
where F 0 , h ( x ) = 0 , F 1 , h ( x ) = 1 , L 0 , h ( x ) = 2 , and L 1 , h ( x ) = h ( x ) . They derived the generating functions of h ( x ) -Fibonacci polynomials and h ( x ) -Lucas polynomials as follows:
n = 0 F n , h ( x ) ζ n = ζ 1 h ( x ) ζ ζ 2 ,
and
n = 0 L n , h ( x ) ζ n = 2 h ( x ) ζ 1 h ( x ) ζ ζ 2 .
For more information on Fibonacci- and Lucas-type polynomials, numbers, and their applications, for example, in the theory of geometric functions, see [3,4,5,6,7,8,9,10,11,12,13,14,15]. On the other hand, the Bernoulli numbers B n are defined with the help of the following generating function as [16]
n = 0 B n ζ n n ! = ζ e ζ 1 , ζ < 2 π .
In [17], Rahmani defined the p-Bernoulli numbers by means of the following generating function as
n = 0 B n , p ζ n n ! = 2 F 1 ( 1 , 1 ; p + 2 ; 1 e ζ ) ,
where p 1 integer and 2 F 1 ( a , b ; c ; u ) denotes the Gaussian hypergeometric function defined by
2 F 1 ( a , b ; c ; u ) = n = 0 a n b n c n u n n ! ,
and x n denotes the shifted factorial defined by x n = x x + 1 x + 2 x + n 1 for n > 0 , x 0 = 1 , and x any real or complex number. Substituting p = 0 into (1), B n , 0 = B n , ordinary Bernoulli numbers are obtained. Moreover, Rahmani gave some important properties of p-Bernoulli numbers. Rahmani also defined the p-Bernoulli polynomials as follows:
n = 0 B n , p x ζ n n ! = e x ζ 2 F 1 ( 1 , 1 ; p + 2 ; 1 e ζ ) .
Substituting x = 0 into (2), B n , p 0 = B n , p , p-Bernoulli numbers are obtained. The readers can also see [18]. After Rahmani, Pathan [19] generalized these numbers and polynomials called p , q -Bernoulli numbers and p , q -Bernoulli polynomials, respectively. The p , q -Bernoulli numbers are defined by means of the following generating function as
2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e ζ ) = n = 0 B n , p , q ζ n n ! .
For q = 0 , (3) reduces to (1). Moreover, the author introduced the unified ( p , q ) -Bernoulli polynomials defined by
e x ζ 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e ζ ) = n = 0 B n , p , q ( x ) ζ n n ! ,
for every integer p 1 . For x = 0 , (4) reduces to (3).
In the light of the above paper, with the help of the p , q -Bernoulli numbers, unified ( p , q ) -Bernoulli polynomials, h ( x ) -Fibonacci polynomials, and h ( x ) -Lucas polynomials, we define the generalized ( p , q ) -Bernoulli–Fibonacci and generalized ( p , q ) -Bernoulli–Lucas polynomials and numbers. We also introduce the generalized bivariate ( p , q ) -Bernoulli–Fibonacci and generalized bivariate ( p , q ) -Bernoulli–Lucas polynomials and numbers. Then, we derive some properties of these newly established polynomials and numbers by using their generating functions with their functional equations. Finally, we provide some families of bilinear and bilateral generating functions for the generalized bivariate ( p , q ) -Bernoulli–Fibonacci polynomials.

2. Generalized ( p , q ) -Bernoulli–Fibonacci and Generalized ( p , q ) -Bernoulli–Lucas Polynomials and Numbers

In this part of the paper, we introduce the generalized ( p , q ) -Bernoulli–Fibonacci polynomials and generalized ( p , q ) -Bernoulli–Lucas polynomials. Then, we derive some properties of these polynomials by using the their generating functions.
Definition 1. 
The generalized ( p , q ) -Bernoulli–Fibonacci polynomials B F n , h , p , q ( x ) are given by the following generating function:
ζ ( 1 h ( x ) ζ ζ 2 ) 1 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e ζ ) = n = 0 B F n , h , p , q ( x ) ζ n n ! ,
for every integer p 1 .
Some special cases of the generalized ( p , q ) -Bernoulli–Fibonacci polynomials B F n , h , p , q ( x ) are as follows:
  • Setting q = 0 into (5), B F n , h , p , 0 ( x ) = B F n , h , p ( x ) , generalized p-Bernoulli–Fibonacci polynomials are obtained.
  • Setting h ( x ) = x into (5), generalized ( p , q ) -Bernoulli–Fibonacci polynomials become ( p , q ) -Bernoulli–Fibonacci polynomials.
  • Setting h ( x ) = 1 into (5), generalized ( p , q ) -Bernoulli–Fibonacci polynomials become ( p , q ) -Bernoulli–Fibonacci numbers.
  • Setting h ( x ) = 2 x into (5), generalized ( p , q ) -Bernoulli–Fibonacci polynomials become ( p , q ) -Bernoulli–Pell polynomials.
  • Setting h ( x ) = 2 into (5), generalized ( p , q ) -Bernoulli–Fibonacci polynomials become ( p , q ) -Bernoulli–Pell numbers.
Definition 2. 
The generalized ( p , q ) -Bernoulli–Lucas polynomials B L n , h , p , q ( x ) are given by the following generating function:
( 2 h ( x ) ζ ) ( 1 h ( x ) ζ ζ 2 ) 1 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e ζ ) = n = 0 B L n , h , p , q ( x ) ζ n n ! .
Some special cases of the generalized ( p , q ) -Bernoulli–Lucas polynomials B L n , h , p , q ( x ) are as follows:
  • Setting q = 0 into (6), B L n , h , p , 0 ( x ) = B L n , h , p ( x ) , generalized p-Bernoulli–Lucas polynomials are obtained.
  • Setting h ( x ) = x into (6), generalized ( p , q ) -Bernoulli–Lucas polynomials become ( p , q ) -Bernoulli–Lucas polynomials.
  • Setting h ( x ) = 1 into (6), generalized ( p , q ) -Bernoulli–Lucas polynomials become ( p , q ) -Bernoulli–Lucas numbers.
  • Setting h ( x ) = 2 x into (6), generalized ( p , q ) -Bernoulli–Lucas polynomials become ( p , q ) -Bernoulli–Pell–Lucas polynomials.
  • Setting h ( x ) = 2 into (6), generalized ( p , q ) -Bernoulli–Lucas polynomials become ( p , q ) -Bernoulli–Pell–Lucas numbers.
We can rewrite (5) as
n = 0 B F n , h , p , q ( x ) ζ n n ! = n = 0 F n , h ( x ) ζ n j = 0 B j , p , q ζ j j ! .
Comparing the coefficients of ζ n on both sides of the above equation, we have
B F n , h , p , q ( x ) = n ! j = 0 n F n j , h ( x ) B j , p , q j ! .
Similarly, we may reformulate (6) as
n = 0 B L n , h , p , q ( x ) ζ n n ! = n = 0 L n , h ( x ) ζ n m = 0 B m , p , q ζ m m ! .
Thus, we have
B L n , h , p , q ( x ) = n ! m = 0 n L n m , h ( x ) B m , p , q m ! .
Theorem 1. 
The representation of ( p , q ) -Bernoulli numbers in terms of generalized ( p , q ) -Bernoulli–Fibonacci polynomials is
B n , p , q n ! = B F n + 1 , h , p , q ( x ) ( n + 1 ) ! h ( x ) B F n , h , p , q ( x ) n ! B F n 1 , h , p , q ( x ) ( n 1 ) ! , n 1 .
Proof. 
By using (5), we have
2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e ζ ) = ( 1 h ( x ) ζ ζ 2 ) n = 0 B F n , h , p , q ( x ) ζ n 1 n !
n = 0 B n , p , q ζ n n ! = ( 1 h ( x ) ζ ζ 2 ) n = 0 B F n , h , p , q ( x ) ζ n 1 n ! .
Comparing the coefficients of ζ n , we obtain the desired result. □
Theorem 2. 
For n 1 , we have
B F n , h , p , q ( x ) = n ! m = 0 n i = 0 [ m 1 2 ] m i 1 i B n m , p , q ( n m ) ! h m 2 i 1 ( x ) ,
where h ( x ) ζ + ζ 2 < 1 .
Proof. 
Using (5), we obtain
ζ ( 1 h ( x ) ζ ζ 2 ) 1 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e ζ )
= ζ 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e ζ ) n = 0 ( h ( x ) ζ + ζ 2 ) n = ζ 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e ζ ) n = 0 i = 0 n n i ( h ( x ) ζ ) n i ( ζ 2 ) i = 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e ζ ) n = 0 i = 0 n n i ( h ( x ) ζ ) n i ( ζ 2 i + 1 ) .
On writing n + i + 1 = m in the right hand-side of the above equation, we have
ζ ( 1 h ( x ) ζ ζ 2 ) 1 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e ζ )
= 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e ζ ) m = 0 i = 0 [ m 1 2 ] m i 1 i h m 2 i 1 ( x ) ζ m
n = 0 B F n , h , p , q ( x ) ζ n n ! = n = 0 B n , p , q ζ n n ! m = 0 i = 0 [ m 1 2 ] m i 1 i h m 2 i 1 ( x ) ζ m .
Replace n with n m and compare the coefficients of ζ n to obtain the result (7). □
Theorem 3. 
For n 2 , we have
B n , p , q 2 n ! = h ( x ) B F n , h , p , q ( x ) 1 n ! + B L n , h , p , q ( x ) 1 n ! h ( x ) h ( x ) B F n 1 , h , p , q ( x ) 1 ( n 1 ) ! + B L n 1 , h , p , q ( x ) 1 ( n 1 ) ! h ( x ) B F n 2 , h , p , q ( x ) 1 ( n 2 ) ! + B L n 2 , h , p , q ( x ) 1 ( n 2 ) ! ,
and
B L n , h , p , q ( x ) 1 n ! = B F n + 1 , h , p , q ( x ) 2 ( n + 1 ) ! h ( x ) B F n , h , p , q ( x ) 1 n ! .
Proof. 
Through the following equation, we have
2 ( 1 h ( x ) ζ ζ 2 ) 1 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e ζ ) = h ( x ) n = 0 B F n , h , p , q ( x ) ζ n n ! + n = 0 B L n , h , p , q ( x ) ζ n n ! .
So, we obtain
2 n = 0 B n , p , q ζ n n ! = ( 1 h ( x ) ζ ζ 2 ) h ( x ) n = 0 B F n , h , p , q ( x ) ζ n n ! + n = 0 B L n , h , p , q ( x ) ζ n n ! = h ( x ) n = 0 B F n , h , p , q ( x ) ζ n n ! + n = 0 B L n , h , p , q ( x ) ζ n n ! h ( x ) ζ h ( x ) n = 0 B F n , h , p , q ( x ) ζ n n ! + n = 0 B L n , h , p , q ( x ) ζ n n ! ζ 2 h ( x ) n = 0 B F n , h , p , q ( x ) ζ n n ! + n = 0 B L n , h , p , q ( x ) ζ n n ! .
Comparing the coefficients of ζ n , we obtain the result (8). By virtue of (6), we obtain
( 2 h ( x ) ζ ) ( 1 h ( x ) ζ ζ 2 ) 1 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e ζ ) = n = 0 B L n , h , p , q ( x ) ζ n n !
2 n = 0 B F n , h , p , q ( x ) ζ n 1 n ! h ( x ) n = 0 B F n , h , p , q ( x ) ζ n n ! = n = 0 B L n , h , p , q ( x ) ζ n n ! .
Comparing the coefficients of ζ n , we obtain the our assertion (9). □

3. Generalized Bivariate ( p , q ) -Bernoulli–Fibonacci and Generalized Bivariate ( p , q ) -Bernoulli–Lucas Polynomials and Numbers

Definition 3. 
The generalized bivariate ( p , q ) -Fibonacci–Bernoulli polynomials are defined by the following generating function as
ζ ( 1 h ( x ) ζ ζ 2 ) 1 e y ζ 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e ζ ) = n = 0 B F n , h , p , q ( x , y ) ζ n n ! ,
for every integer p 1 .
Letting y = 0 in (10), B F n , h , p , q ( x , 0 ) = B F n , h , p , q ( x ) , the generalized ( p , q ) -Bernoulli–Fibonacci polynomials are obtained.
Definition 4. 
The generalized bivariate ( p , q ) -Lucas–Bernoulli polynomials are defined by the following generating function as
( 2 h ( x ) ζ ) ( 1 h ( x ) ζ ζ 2 ) 1 e y ζ 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e ζ ) = n = 0 B L n , h , p , q ( x , y ) ζ n n ! ,
for every integer p 1 .
Letting y = 0 in (11), B L n , h , p , q ( x , 0 ) = B L n , h , p , q ( x ) , the generalized ( p , q ) -Bernoulli–Lucas polynomials are obtained.
Theorem 4. 
The following summation formula holds true:
B F n , h , p , q ( x ) = m = 0 n n m ( y ) m B F n m , h , p , q ( x , y ) ,
and
B L n , h , p , q ( x ) = m = 0 n n m ( y ) m B L n m , h , p , q ( x , y ) .
Proof. 
By using (10), we have
ζ ( 1 h ( x ) ζ ζ 2 ) 1 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e ζ ) = e y ζ n = 0 B F n , h , p , q ( x , y ) ζ n n ! = m = 0 ( y ) m ζ m m ! n = 0 B F n , h , p , q ( x , y ) ζ n n ! n = 0 B F n , h , p , q ( x ) ζ n n ! = n = 0 m = 0 ( y ) m B F n m , h , p , q ( x , y ) ζ n m ! n m ! .
Using the Cauchy product and comparing the coefficients of ζ n , we obtain (12). The proof of (13) is similar. □
Theorem 5. 
Let p 1 . The following representations for generalized bivariate ( p , q ) -Bernoulli–Fibonacci polynomials and generalized bivariate ( p , q ) -Bernoulli–Lucas polynomials involving Euler polynomials E n ( x ) hold true:
B F n , h , p , q ( x , y ) = 1 2 m = 0 n k = 0 m n m m k E n m ( y ) B F m k , h , p , q ( x ) + m = 0 n n m E n m ( y ) B F m , h , p , q ( x ) ,
and
B L n , h , p , q ( x , y ) = 1 2 m = 0 n k = 0 m n m m k E n m ( y ) B L m k , h , p , q ( x ) + m = 0 n n m E n m ( y ) B L m , h , p , q ( x ) .
Proof. 
The generating function for the Euler polynomials E n ( y ) gives
e y ζ = e ζ + 1 2 n = 0 E n ( y ) ζ n n ! .
Substituting this values of e y ζ in (10) gives
e ζ + 1 2 n = 0 E n ( y ) ζ n n ! ζ ( 1 h ( x ) ζ ζ 2 ) 1 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e ζ )
= n = 0 B F n , h , p , q ( x , y ) ζ n n !
1 2 m = 0 ζ m m ! n = 0 E n ( y ) ζ n n ! n = 0 B F n , h , p , q ( x ) ζ n n ! + n = 0 E n ( y ) ζ n n ! n = 0 B F n , h , p , q ( x ) ζ n n !
= n = 0 B F n , h , p , q ( x , y ) ζ n n ! .
Using the Cauchy product and comparing the coefficients of ζ n , we obtain (14). The proof of (15) is similar. □

4. Some Families of Generating Functions for the Generalized Bivariate ( p , q ) -Bernoulli–Fibonacci and Generalized Bivariate ( p , q ) -Bernoulli–Lucas Polynomials

In this section, we derive bilinear and bilateral generating functions for the generalized bivariate ( p , q ) -Bernoulli–Fibonacci polynomials by using some methods that were used earlier in [20] (see also [21,22,23,24]).
Theorem 6. 
Suppose that Λ μ ( T ) is an identically non-vanishing function of m complex variables t 1 , , t s   ( m N ) and of complex order μ . Additionally, let the function Λ μ ( T ) have the following generating function:
Υ μ , ν ( T ; w ) : = k = 0 a k Λ μ + ν k ( T ) w k a k 0 ; μ , ν C ; T = t 1 , , t s ; s N .
Then, for Ψ n , r , μ , ν ( x , y ; T ; h ) given by
Ψ n , r , μ , ν ( x , y ; T ; h ) : = k = 0 [ n / r ] a k B F n r k , h , p , q ( x , y ) n r k ! Λ μ + ν k ( T ) h k ,
n = 0 Ψ n , r , μ , ν x , y ; T ; ϖ v r v n = Υ μ , ν ( T ; ϖ ) v ( 1 h ( x ) v v 2 ) 1 e y v 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e v ) ,
where n , r N .
Proof. 
By substituting
Ψ n , r , μ , ν x , y ; T ; ϖ v r
from the definition (16) into the left-hand side of (17), we can write the following form of the left-hand side of the equality (17) of Theorem 6:
n = 0 Ψ n , r , μ , ν x , y ; T ; ϖ v r v n = n = 0 k = 0 [ n / r ] a k B F n r k , h , p , q ( x , y ) n r k ! Λ μ + ν k ( T ) ϖ k v n r k ,
which, upon replacing n with n + r k , we have
n = 0 Ψ n , r , μ , ν x , y ; T ; ϖ v r v n = n = 0 k = 0 a k B F n , h , p , q ( x , y ) n ! Λ μ + ν k ( T ) ϖ k v n = k = 0 a k Λ μ + ν k ( T ) ϖ k n = 0 B F n , h , p , q ( x , y ) v n n ! = Υ μ , ν ( T ; ϖ ) v ( 1 h ( x ) v v 2 ) 1 e y v 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e v ) ,
which is the right-hand side of the generating function (17) asserted by Theorem 6. □
To give some examples of the generating functions expressed by Theorem 6 above, we first set
s = 1 and Λ μ + ν k ( γ ) = B μ + ν k , p γ k , μ , ν N 0
in Theorem 6. Here, B n , p x denotes the p-Bernoulli polynomials defined by (2). Thus, we deduce from Theorem 6 the following result, which provides a class of bilateral generating functions for the p-Bernoulli polynomials and the generalized bivariate ( p , q ) -Bernoulli–Fibonacci polynomials.
Corollary 1. 
If Υ μ , ν ( γ ; w ) : = k = 0 a k B μ + ν k , p γ w k , ( a k 0 , k , μ , ν N 0 ) , and
W n , r , μ , ν ( x , y ; γ ; ζ ) : = k = 0 [ n / r ] a k B F n r k , h , p , q ( x , y ) n r k ! B μ + ν k , p γ ζ k
where n , μ , ν N 0 ; r N , then
n = 0 W n , r , μ , ν x , y ; γ ; u t r t n = Υ μ , ν ( γ ; u ) t ( 1 h ( x ) t t 2 ) 1 e y t 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e t ) .
Remark 1. 
Using (10) and taking a k = 1 k ! , μ = 0 , ν = 1 , we have
n = 0 k = 0 [ n / r ] B F n r k , h , p , q ( x , y ) n r k ! B k , p γ k ! u k t n r k
= e γ u 2 F 1 ( 1 , 1 ; p + 2 ; 1 e u ) t ( 1 h ( x ) t t 2 ) 1 e y t 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e t ) .
Finally, in terms of the generalized bivariate ( p , q ) -Fibonacci–Bernoulli polynomials B F n , h , p , q ( x , y ) generated by (10), we set
s = 2 and Λ μ + ν k ( x 1 , y 1 ) = B F n , h , p , q ( x 1 , y 1 )
in Theorem 6. We find that the following class of bilinear generating functions for the bivariate polynomials B F n , h , p , q ( x , y ) .
Corollary 2. 
If Υ μ , ν ( x 1 , y 1 ; w ) : = k = 0 a k B F n , h , p , q ( x 1 , y 1 ) w k , ( a k 0 , μ , ν N 0 ) , and
W n , r , μ , ν ( x , y ; x 1 , y 1 ; ζ ) : = k = 0 [ n / r ] a k B F n r k , h , p , q ( x , y ) n r k ! B F μ + ν k , h , p , q ( x 1 , y 1 ) ζ k
where n , μ , ν N 0 and r N , then
n = 0 W n , r , μ , ν x , y ; x 1 , y 1 ; u t r t n = Υ μ , ν ( x 1 , y 1 ; u ) t ( 1 h ( x ) t t 2 ) 1 e y t 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e t ) .
Remark 2. 
By virtue of (10), and if we set a k = 1 k ! , μ = 0 , ν = 1 , we have
n = 0 k = 0 [ n / r ] B F n r k , h , p , q ( x , y ) n r k ! B F k , h , p , q ( x 1 , y 1 ) k ! u k t n r k = u ( 1 h ( x 1 ) u u 2 ) 1 e y 1 u 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e u ) × t ( 1 h ( x ) t t 2 ) 1 e y t 2 F 1 ( 1 , q + 1 ; p + 2 ; 1 e t ) .

5. Conclusions

In this paper, using the p , q -Bernoulli numbers, unified ( p , q ) -Bernoulli polynomials, h ( x ) -Fibonacci polynomials, and h ( x ) -Lucas polynomials, we define the generalized ( p , q ) -Bernoulli–Fibonacci and generalized ( p , q ) -Bernoulli–Lucas, generalized bivariate ( p , q ) -Bernoulli–Fibonacci, and generalized bivariate ( p , q ) -Bernoulli–Lucas polynomials and numbers, respectively. We obtain some important identities and relations of these newly established polynomials by using their generating functions and functional equations. Finally, we provide some generating functions for the generalized bivariate ( p , q ) -Bernoulli–Fibonacci polynomials. For the last section, every proper choice of the coefficients a k ( k N 0 ) , if the multivariable function Λ μ + ν k ( t 1 , , t s ) , ( s N ) , is expressed as a proper product of many ordinary functions, the allegations of Theorem 6, are able to be applied to obtain various families of bilinear and bilateral generating functions for the families of the polynomials B F n , h , p , q ( x , y ) . With the help of this article, different types of polynomial families can be defined. Different types of polynomial families can be defined by taking bivariate Fibonacci and bivariate Lucas polynomials instead of h ( x ) -Fibonacci and h ( x ) -Lucas polynomials, which we discussed in this article. Our work is to define a new polynomial family with the help of different types of polynomial families that differ from previous studies. For future studies, researchers can define different types of polynomials with the help of this study.

Author Contributions

Conceptualization, H.G., W.A.K. and C.K.; formal analysis, H.G., W.A.K. and C.K.; funding acquisition, H.G. and W.A.K.; investigation, W.A.K. and C.K.; methodology, H.G., W.A.K. and C.K.; project administration, H.G., W.A.K. and C.K.; software, H.G., W.A.K. and C.K.; writing—original draft, W.A.K. and C.K.; writing—review and editing, H.G., W.A.K. and C.K. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Koshy, T. Fibonacci and Lucas Numbers with Applications; Wiley: New York, NY, USA, 2019. [Google Scholar]
  2. Nalli, A.; Haukkanen, P. On generalized Fibonacci and Lucas polynomials. Chaos Solitons Fractals 2009, 42, 3179–3186. [Google Scholar] [CrossRef]
  3. Lee, G.; Asci, M. Some properties of the (p,q)-Fibonacci and (p,q)-Lucas polynomials. J. Appl. Math. 2012, 2012, 18. [Google Scholar] [CrossRef]
  4. Kocer, E.G.; Tuglu, N.; Stakhov, A. On the m-extension of the Fibonacci and Lucas p-numbers. Chaos Solitons Fractals 2009, 40, 1890–1906. [Google Scholar] [CrossRef]
  5. Horzum, T.; Kocer, E.G. On some properties of Horadam polynomials. Int. Math. Forum. 2009, 25, 1243–1252. [Google Scholar]
  6. Horadam, A.F. Basic properties of a certain generalized sequence of numbers. Fibonacci Quart. 1965, 3, 161–176. [Google Scholar]
  7. Kızılateş, C. New families of Horadam numbers associated with finite operators and their applications. Math. Methods Appl. Sci. 2021, 44, 14371–14381. [Google Scholar] [CrossRef]
  8. Pathan, M.A.; Khan, W.A. On a class of generalized Humbert–Hermite polynomials via generalized Fibonacci polynomials. Turk. J. Math. 2022, 46, 929–945. [Google Scholar] [CrossRef]
  9. Pathan, M.A.; Khan, W.A. On h(x)-Fibonacci-Euler and h(x)-Lucas-Euler numbers and polynomials. Acta Univ. Apulensis Math. Inform. 2019, 58, 117–133. [Google Scholar] [CrossRef]
  10. Bala, A.; Verma, V. Some properties of bi-variate bi-periodic Lucas polynomials. Ann. Rom. Soc. Cell Biol. 2021, 25, 8778–8784. Available online: http://annalsofrscb.ro/index.php/journal/article/view/3598/2921 (accessed on 31 March 2023).
  11. Catalani, M. Generalized bivariate Fibonacci polynomials. arXiv 2004, arXiv:math/0211366v2. [Google Scholar]
  12. Panwar, Y.; Gupta, V.K.; Bhandari, J. Generalized Identities of Bivariate Fibonacci and Bivariate Lucas Polynomials. Jauist 2020, 1, 142–150. [Google Scholar]
  13. Altınkaya, Ş.; Yalçın, S.; Çakmak, S. A Subclass of Bi-Univalent Functions Based on the Faber Polynomial Expansions and the Fibonacci Numbers. Mathematics 2019, 7, 160. [Google Scholar] [CrossRef]
  14. Altınkaya, Ş.; Yalçın, S. On the (p,q)-Lucas polynomial coefficient bounds of the bi-univalent function class σ. Bol. Soc. Mat. Mex. 2019, 25, 567–575. [Google Scholar] [CrossRef]
  15. Murugusundaramoorthy, G.; Yalçın, S. On λ-Pseudo Bi-Starlike Functions related (p,q)-Lucas polynomial. Lib. Math. 2019, 39, 79–88. [Google Scholar]
  16. Srivastava, H.M.; Choi, J. Zeta and q-Zeta Functions and Associated Series and Integrals; Elsevier Science Publishers: Amsterdam, The Netherlands; London, UK; New York, NY, USA, 2012. [Google Scholar]
  17. Rahmani, M. On p-Bernoulli numbers and polynomials. J. Number Theory 2015, 157, 350–366. [Google Scholar] [CrossRef]
  18. Kargın, L.; Rahmani, M. A closed formula for the generating function of p-Bernoulli numbers. Quaest. Math. 2018, 41, 975–983. [Google Scholar] [CrossRef]
  19. Pathan, M.A. Unified (p,q)-Bernoulli-Hermite polynomials. Fasc. Math. 2018, 61, 125–141. [Google Scholar]
  20. Erkus, E.; Srivastava, H.M. A unified presentation of some families of multivariable polynomials. Integral Transform. Spec. Funct. 2006, 17, 267–273. [Google Scholar] [CrossRef]
  21. Srivastava, H.M.; Manocha, H.L. A Treatise on Generating Functions; Halsted Press (Ellis Horwood Limited, Chichester): Sydney, Australia; Wiley: New York, NY, USA, 1984. [Google Scholar]
  22. Srivastava, H.M.; Kızılateş, C. A parametric kind of the Fubini-type polynomials. Rev. R. Acad. Cienc. Exactas Fís. Nat. Ser. A Mat. RACSAM 2019, 113, 3253–3267. [Google Scholar] [CrossRef]
  23. Tuglu, N.; Erkus-Duman, E. Generating functions for the generalized bivariate Fibonacci and Lucas polynomials. J. Comput. Anal. Appl. 2015, 18, 815–821. [Google Scholar] [CrossRef]
  24. Kızılateş, C. Explicit, determinantal, recursive formulas, and generating functions of generalized Humbert-Hermite polynomials via generalized Fibonacci Polynomials. Math. Meth. Appl. Sci. 2023, 1–12. [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

Guan, H.; Khan, W.A.; Kızılateş, C. On Generalized Bivariate (p,q)-Bernoulli–Fibonacci Polynomials and Generalized Bivariate (p,q)-Bernoulli–Lucas Polynomials. Symmetry 2023, 15, 943. https://doi.org/10.3390/sym15040943

AMA Style

Guan H, Khan WA, Kızılateş C. On Generalized Bivariate (p,q)-Bernoulli–Fibonacci Polynomials and Generalized Bivariate (p,q)-Bernoulli–Lucas Polynomials. Symmetry. 2023; 15(4):943. https://doi.org/10.3390/sym15040943

Chicago/Turabian Style

Guan, Hao, Waseem Ahmad Khan, and Can Kızılateş. 2023. "On Generalized Bivariate (p,q)-Bernoulli–Fibonacci Polynomials and Generalized Bivariate (p,q)-Bernoulli–Lucas Polynomials" Symmetry 15, no. 4: 943. https://doi.org/10.3390/sym15040943

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