This article is available for purchase or by subscription. See below.
Abstract
|
We generate Fibonacci-type recursive polynomials through continued fractions. These
polynomials generalize the well-known Fibonacci and Lucas polynomials. We present
several results such as generating functions, finite sum representations and identities
satisfied by these polynomials. Analytic results about the zeros of these polynomials
are also presented.
|
PDF Access Denied
We have not been able to recognize your IP address
35.173.48.18
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 30.00:
Keywords
generalized Fibonacci polynomials, matrix identities,
generating functions
|
Mathematical Subject Classification 2010
Primary: 11B39
|
Milestones
Received: 8 May 2019
Revised: 10 June 2020
Accepted: 5 December 2020
Published: 6 April 2021
Communicated by Kenneth S. Berenhaut
|
|