On the ( p , q ) – Chebyshev Polynomials and Related Polynomials

In this paper, we introduce (p, q)–Chebyshev polynomials of the first and second kind that reduces the (p, q)–Fibonacci and the (p, q)–Lucas polynomials. These polynomials have explicit forms and generating functions are given. Then, derivative properties between these first and second kind polynomials, determinant representations, multilateral and multilinear generating functions are derived.


Introduction
For any integer n ≥ 0, the Chebyshev polynomials of the first and second kind T n (x) and U n (x) are respectively defined as follows: with the initial values T 0 (x) = 1 and T 1 (x) = x, and with the initial values U 0 (x) = 1 and U 1 (x) = 2x.For more information, please see the papers [1][2][3] and closely related references therein.
These polynomials play a very important role in the study of the theory and applications of mathematics and they are closely related to Fibonacci numbers {F n } and Lucas numbers {L n } , which are defined by the second order linear recurrence sequences, for any integer n ≥ 0, where F 0 = 0, F 1 = 1, L 0 = 2 and L 1 = 1, respectively.Many authors have investigated these polynomials and their generalizations [4][5][6][7][8][9][10][11][12].In [8], Kim et al. consider sums of finite products of Chebyshev polynomials of the second kind and of Fibonacci polynomials and derive Fourier series expansions of functions associated with them.In [9], Kim et al. studied the convolved Fibonacci numbers by using the generating functions of them and gave some new identities for the convolved Fibonacci numbers.In [5], Cigler define q-analogues of Chebyshev polynomials and derive some properties of these polynomials.The q-Chebyshev polynomials of the first kind and second kind are defined by the following recurrences relations, respectively, for any integer n ≥ 2, T n (x, s, q) = (1 + q n )xT n−1 (x, s, q) + q n−1 sT n−2 (x, s, q), with the initial values T 0 (x, s, q) = 1, T 1 (x, s, q) = x and with the initial values U 0 (x, s, q) = 1, U 1 (x, s, q) = (1 + q)x and x, s are real variables in [5].
. Moreover, in [5], Cigler point out that the q-Chebyshev polynomials of the first kind are determined as the combinatorial sum and the q-Chebyshev polynomials of the second kind is determined as where (x, q) n is the q-shifted factorial, that is, (x, q) 0 = 1, and for integer k, q-binomial coefficient is as follows: Now, we give some definitions related to (p, q)-integers, for any fixed real number 0 < q < p ≤ 1 and each non-negative integer n. (p, q)-integers are denoted as [n] p,q , where [n] p,q = p n − q n p − q .
With the help of these generalizations, we will introduce (p, q)-Chebyshev polynomials of the first and second kind.

(p, q)-Chebyshev Polynomials
In this section, we will define (p, q)-Chebyshev polynomials of the first and second kind.Then, we will derive explicit formulas, generating functions and some interesting properties of these polynomials.Definition 1.For any integer n ≥ 2 and 0 < q < p ≤ 1, the (p, q)-Chebyshev polynomials of the first kind are defined by the following recurrence relation: with the initial values T 0 (x, s, p, q) = 1 and T 1 (x, s, p, q) = x and x, s are real variables.
In the light of this recurrence relation, we will give Table 1: Table 1.Some special cases of the (p, q)-Chebyshev polynomials of the first kind.
x s p q T n (x, s, p, q) (p, q)-Chebyshev Polynomials of First Kind Lemma 1.The (p, q)-binomial coefficients satisfy the following identities: Proof.Using these equations, ( in [5] and writing q → q p and [ , we derive Equations ( 3) and ( 4) as (p, q) analogue of the above equations.
If n is even, the proof can be obtained similarly.
The Fibonacci operator η q was introduced by Andrews in [3], by η q f (x) = f (qx).Similarly, we define another operator η p,q f (x) = f (pqx).Now, we will give the generating function of the (p, q)-Chebyshev polynomials of the first kind.
Theorem 2. The generating function of the (p, q)-Chebyshev polynomials of the first kind is as follows: Proof.Let us consider the following equation For the proof of Theorem 2, we need to check the following equivalent relation: Thus, we write S p,q (z) − xzη p S p,q (z) − xzη q S p,q (z) − spqz 2 η p,q S p,q (z) From (2), we have Finally, we obtain the desired relation Definition 2. For any integer n ≥ 2 and 0 < q < p ≤ 1, the (p, q)-Chebyshev polynomials of the second kind is defined by the following recurrence relations: U n (x, s, p, q) = (p n + q n )xU n−1 (x, s, p, q) + (pq) n−1 sU n−2 (x, s, p, q) with the initial values U 0 (x, s, p, q) = 1 and U 1 (x, s, p, q) = (p + q)x and s is a varible.
In the light of this recurrence relation, we will give the other following interesting table : Table 2. Some special cases of the (p, q)-Chebyshev polynomials of the second kind.
x s p q U n (x, s, p, q) (p, q)-Chebyshev Polynomials of Second Kind Theorem 3. The explicit formula of (p, q)-Chebyshev polynomials of the second kind is as follows: ((p, −q); (p, q)) n−j ((p, −q); (p, q)) j s j x n−2j .
If n is even, the proof can be obtained similarly.
Theorem 4. The generating function of the (p, q)-Chebyshev polynomials of the second kind is as follows: Proof.Let us consider the following equations: Similarly, for the proof of Theorem 4, we need to check the following equivalent relation: Thus, we write From (7), we obtain Finally, we have The recurrence relations (p, q)-Chebyshev polynomials of the first and second kind can be expressed by the following determinant, respectively: Theorem 5.For these polynomials, we have an interesting relation where D (p,q) denoted by (p, q)-Jackson's derivative given by in [14].
Proof.By using the ( 5) and ( 8), we have Thus, the proof is completed.

Multilinear and Multilateral Generating Functions
In this section, we derive some multilinear and multilateral generating functions for (p, q)-Chebyshev polynomials of the first and the second kind which are generated by ( 6) and ( 9), and given explicitly by ( 5) and ( 8), respectively, with the help of similar methods in [22][23][24][25].The presented results and their potential impacts seem to be relevant for a wider audience in the areas of mathematics including orthogonal polynomials, harmonic analysis and classical analysis [26].Theorem 6. Corresponding to an identically non-vanishing function Λ µ (t) of m complex variables t 1 , ..., t m (m ∈ N) and of complex order µ, let where (a k = 0 , µ, ν ∈ C) ; t = (t 1 , ..., t m ) and where n, r ∈ N.Then, we have Proof.We symbolize the left-hand side of the equality (12) of Theorem 6 as Q.Then, we can write instead of Ψ n,r,µ,ν x; t; v r from the definition (11) into the left-hand side of (12), we have Writing n by n + rk, we can obtain Now, we can similarly derive the next result.

Some Examples for Generating Functions
Before obtaining new generating functions, we will recall (p, q)-Fibonacci and (p, q)-Lucas polynomials.In Ref. [27], for 0 < q < p ≤ 1 and x, s are real variables, the authors define (p, q)-Fibonacci and (p, q)-Lucas polynomials as and obtain a generating function as where ((p, q); (p, q)) n x n , respectively.Now, we can give some examples for generating functions.For 0 < q < p ≤ 1 and x, s are real variables, setting m = 1 and Λ µ+νk (z ) = F µ+νk ( z, sp −k p, q) in Theorem 6, where the (p, q)-Fibonacci polynomials F n ( z, sp −k p, q) are generated by (20), and then we will derive the result, which provides bilateral generating functions for (p, q)-Fibonacci polynomials and (p, q)-Chebyshev polynomials of the first kind given by (5).