scientific article; zbMATH DE number 1062561

From MaRDI portal
Publication:4355047





Two recent papers [\textit{R. André-Jeannin}, ibid. 32, 228-231 (1994; Zbl 0814.11012) and \textit{A. F. Horadam}, ibid. 34, 342-348 (1996; Zbl 0868.11007)], detailed properties of (i) a generalization \(\{P_n^{(r)}(x)\}\) of the familiar Morgan-Voyce polynomials \(B_n(x)\) and \(b_n(x)\), and (ii) an associated set \(\{Q^r_n(x)\}\) of generalized polynomials. In this paper the author amalgamates these two sets of polynomials into a more general class of polynomials \(\{R_n^{(r,u)}(x)\}\) where \(R_n^{(r,1)}(x)=P_n^{(r)}(x)\), \(R_n^{(r,2)}(x)=Q_n^{(r)}(x)\). Note that \(p_n^{(0)}(x)-b_{n+1}(x)\), \(P_n^{(1)}(x)=B_{n+1}(x)\), \(P_n{(2)}(x)=c_{n+1}(x)\), \(Q_n^{(0)}(x)=C_n(x)\), where \(C_n(x)\) and \(c_{n+1}(x)\) are polynomials related to the Morgan-Voyce polynomials. The polynomial \(C_n(x)\) has already been defined by Swamy in [\textit{M. N. S. Swamy} and \textit{B. B. Bhattacharyya}, IEEE Trans. Circuit Theory CT-14, 260-264 (1967)], where it has been used in the analysis of ladder networks. The author obtains recurrence formulas for the coefficients \(c_{n,k}^{(r,u)}\) of the generating function, connections with Fibonacci and Lucas numbers, Chebyshev polynomial and further properties of \(R_n^{(r,u)}(x)\) like Binet form, Simson formula, generating function, and finally rising diagonal functions.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355047)