Generating functions of binary products of \(k\)-Fibonacci and orthogonal polynomials (Q2317589): Difference between revisions

For any positive real number \(k\) and any nonnegative integer \(n\), the \(k\)-Fibonacci numbers \(F_{k,n}\) and the \(k\)-Pell numbers \(P_{k,n}\) are respectively defined by \[ \begin{cases} F_{k,0}=1,\quad F_{k,1}=k, \\F_{k,n+1}=kF_{k,n}+F_{k,n-1},\quad n\geq 1\end {cases} \] and \[ \begin{cases} P_{k,0}=1,\quad P_{k,1}=k,\\ P_{k,n+1}=2P_{k,n}+kP_{k,n-1},\quad n\geq 1.\end {cases} \] Let \(F_n(x)\) denote the \(n\)-th Fibonacci polynomial, let \(U_n(x)\) denote the \(n\)-th Chebyshev polynomials of the second kind, and let \(T_n(x)\) denote the \(n\)-th Chebyshev polynomials of the first kind. In the paper under review, the authors obtained explicit expressions of the following generating functions: \begin{align*} \sum_{n=0}^{\infty} F_{k,n+1}F_{k,n}z^n, \quad \sum_{n=0}^{\infty} P_{k,n+1}P_{k,n} z^n,\quad \sum_{n=0}^{\infty} F_{k,n+1}F_{n}(x)z^n,\\ \sum_{n=0}^{\infty} F_{k,n+1}U_{n}(x)z^n,\quad \sum_{n=0}^{\infty} F_{n+2}T_{n}(x)z^n,\quad\sum_{n=0}^{\infty} F_{n+1}T_{n}(x)z^n. \end{align*} The proofs are based on the generating function of \[ \sum_{n=0}^{\infty} S_{n+2}(A)S_{n}(E)z^n, \] where \(S_{n}\) denotes the \(n\)-th complete symmetric function, and each of \(A\) and \(E\) consists of two letters, which is obtained by applying some operator to one series in two different ways. The key idea of this approach is to identify \(F_{k,n}\), \(P_{k,n}\), \(F_{n}(x)\), \(T_{n}(x)\), \(U_n{x}\) as symmetric functions on certain alphabets with two letters.