Fibonacci-Type Polynomials as a Trajectory of a Discrete Dynamical System

    Research output: Contribution to journalArticlepeer-review

    Abstract

    Families of polynomials which obey the Fibonacci recursion relation can be generated by repeated iterations of a 2×2 matrix,Q 2, acting on an initial value matrix, R 2. One matrix fixes the recursion relation, while the other one distinguishes between the different polynomial families. Each family of polynomials can be considered as a single trajectory of a discrete dynamical system whose dynamics are determined by Q 2. The starting point for each trajectory is fixed by R 2(x). The forms of these matrices are studied, and some consequences for the properties of the corresponding polynomials are obtained. The main results generalize to the so-called r-Bonacci polynomials. © 2002 Springer.
    Original languageAmerican English
    Pages (from-to)367-374
    Number of pages8
    JournalRendiconti Del Circolo Matematico Di Palermo
    Volume51
    Issue number2
    StatePublished - Jun 1 2002

    Funding

    This research has been partially supported by K. C. Wong Education Foundation, Hong Kong, while the first author was visiting the Institute of Computational Mathematics and Scientific/Engineering Computing (ICMSEC) of Chinese Academy of Sciences (CAS) in Beijing. The author is grateful to Professor Ya-xiang Yuan and Dr. Yu-hong Dai of ICMSEC for making such a visit possible.

    Funders
    Chinese Academy of Sciences
    K. C. Wong Education Foundation

      ASJC Scopus Subject Areas

      • General Mathematics

      Disciplines

      • Mathematics

      Fingerprint

      Dive into the research topics of 'Fibonacci-Type Polynomials as a Trajectory of a Discrete Dynamical System'. Together they form a unique fingerprint.

      Cite this