A Generalization of Fibonacci Trees

  • Renato M. Capocelli
Chapter

Abstract

In this paper we introduce Fibonacci binary trees of degree r, in the sequel called R-nacci trees, and extend to them some results on Fibonacci binary trees [2], [8], [9]. We also study some properties of related tree codes.

Keywords

Binary Tree Internal Node Terminal Node Left Branch Fibonacci Number 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Adelson-Velskii, G. M. and Landis, E. M. “An Algorithm for Organization of Information.” Soviet Mathematics Doklady 3, No. 5 (1962): pp. 1259–1263.Google Scholar
  2. [2]
    Capocelli, R. M. “A Note on Fibonacci Trees and the Zeckendorf’s Representation of Integers.” The Fibonacci Quarterly 26, No. 4 (1988): pp. 318–324.MathSciNetMATHGoogle Scholar
  3. [3]
    Capocelli, R. M. and Cull, P. “Generalized Fibonacci Numbers are Rounded Powers.” (To appear in this Proceedings.)Google Scholar
  4. [4]
    Chang, D. K. “On Fibonacci Binary Sequences.” The Fibonacci Quarterly 24, No. 2 (1986): pp. 178–179.MathSciNetMATHGoogle Scholar
  5. [5]
    Feinberg, M. “Fibonacci-Tribonacci.” The Fibonacci Quarterly 1, No. 3 (1963): pp. 71–74.Google Scholar
  6. [6]
    Hoggatt, V. E. Jr. and Bicknell, M. “Generalized Fibonacci Polynomials and Zeckendorfs Representations.” The Fibonacci Quarterly 11, No. 4 (1973): pp. 399–419.MathSciNetMATHGoogle Scholar
  7. [7]
    Hoggatt, V. E. Jr. and Bicknell-Johnson, M. “Lexicographic Ordering and Fibonacci Representations.” The Fibonacci Quarterly 20, No. 3 (1982): pp. 193–218.MathSciNetMATHGoogle Scholar
  8. [8]
    Horibe, Y. “An Entropy View of Fibonacci Trees.” The Fibonacci Quarterly 20, No. 2 (1982): pp. 168–178.MATHGoogle Scholar
  9. [9]
    Horibe, Y. “Notes on Fibonacci Trees and Their Optimality.” The Fibonacci Quarterly 21, No. 2 (1983): pp. 118–128.MathSciNetMATHGoogle Scholar
  10. [10]
    Kraft, L. G. “A Device for Quantizing Grouping and Coding Amplitude Modulated Pulses.” M. S. Thesis. Dept. Electrical Engineering, M.I.T., Cambridge, Massachusetts; 1949.Google Scholar
  11. [11]
    Miles, E. P. “Generalized Fibonacci Numbers and Associated Matrices.” American Mathematical Monthly 67, No. 10 (1960): pp. 745–757.MathSciNetMATHCrossRefGoogle Scholar
  12. [12]
    Miller, M. D. “On Generalized Fibonacci Numbers.” American Mathematical Monthly 78, No. 10 (1971): pp. 1108–1109.MathSciNetMATHCrossRefGoogle Scholar
  13. [13]
    Philippou, A. N. “A Note on the Fibonacci Sequence of Order K and the Multinomial Coefficients.” The Fibonacci Quarterly 21, No. 2 (1983): pp. 82–86.MathSciNetMATHGoogle Scholar
  14. [14]
    Stout, Q. F. “Searching and Encoding for Infinite Ordered Sets.” Int. J. of Comp. and Inform. Sciences 11, No. 1 (1982): pp. 55–72.MathSciNetMATHCrossRefGoogle Scholar
  15. [15]
    Vara, B. “Optimal Variable Length Codes (Arbitrary Symbol Cost and Equal Codeword Probability).” Information and Control 19 (1971): pp. 289–301.MathSciNetCrossRefGoogle Scholar
  16. [16]
    Zeckendorf, E. “Representations des Nombres Naturels par une Somme de Nombres de Fibonacci ou de Nombres de Lucas.” Bulletin de la Societé Roy ale des Sciences de Liege; No. 3–4 (1972): pp. 179–182. This Zeckendorf’s late paper contains the original proof dated 1939.Google Scholar

Copyright information

© Kluwer Academic Publishers 1990

Authors and Affiliations

  • Renato M. Capocelli

There are no affiliations available

Personalised recommendations