IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v42y2009i1p435-440.html
   My bibliography  Save this article

The Golden mean, Fibonacci matrices and partial weakly super-increasing sources

Author

Listed:
  • Esmaeili, M.
  • Gulliver, T.A.
  • Kakhbod, A.

Abstract

A source S={s1,s2,…}, with at least i+1 source symbols, having a binary Huffman code with codeword lengths satisfying l1=1,l2=2,…,li=i, is called an i-level partial weakly super-increasing (PWSI) source. Connections between these sources, Fibonacci matrices and the Golden mean are studied. It is shown that the Euclidean projection of the distributions associated with these sources is given by Fibonacci–Hessenberg matrices. While there is no upper bound on the expected codeword length of Huffman codes representing PWSI sources (and hence no upper bound on their entropy), the Fibonacci sequence and the Golden mean 1+52 provide a lower bound on the maximum expected codeword length of these codes.

Suggested Citation

  • Esmaeili, M. & Gulliver, T.A. & Kakhbod, A., 2009. "The Golden mean, Fibonacci matrices and partial weakly super-increasing sources," Chaos, Solitons & Fractals, Elsevier, vol. 42(1), pages 435-440.
    • Handle: RePEc:eee:chsofr:v:42:y:2009:i:1:p:435-440
    DOI: 10.1016/j.chaos.2009.01.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077909000071
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2009.01.007?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kocer, E. Gokcen & Tuglu, Naim & Stakhov, Alexey, 2009. "On the m-extension of the Fibonacci and Lucas p-numbers," Chaos, Solitons & Fractals, Elsevier, vol. 40(4), pages 1890-1906.
    2. Falcón, Sergio & Plaza, Ángel, 2009. "On k-Fibonacci sequences and polynomials and their derivatives," Chaos, Solitons & Fractals, Elsevier, vol. 39(3), pages 1005-1019.
    3. Falcón, Sergio & Plaza, Ángel, 2007. "The k-Fibonacci sequence and the Pascal 2-triangle," Chaos, Solitons & Fractals, Elsevier, vol. 33(1), pages 38-49.
    4. El Naschie, M.S., 2009. "The theory of Cantorian spacetime and high energy particle physics (an informal review)," Chaos, Solitons & Fractals, Elsevier, vol. 41(5), pages 2635-2646.
    5. Esmaeili, Morteza & Esmaeili, Mostafa, 2009. "Polynomial Fibonacci–Hessenberg matrices," Chaos, Solitons & Fractals, Elsevier, vol. 41(5), pages 2820-2827.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Esmaeili, Morteza & Esmaeili, Mostafa, 2009. "Polynomial Fibonacci–Hessenberg matrices," Chaos, Solitons & Fractals, Elsevier, vol. 41(5), pages 2820-2827.
    2. Fiorenza, Alberto & Vincenzi, Giovanni, 2011. "Limit of ratio of consecutive terms for general order-k linear homogeneous recurrences with constant coefficients," Chaos, Solitons & Fractals, Elsevier, vol. 44(1), pages 145-152.
    3. Flavio Pressacco & Giacomo Plazzotta & Laura Ziani, 2014. "K-Fibonacci sequences and minimal winning quota in Parsimonious game," Working Papers hal-00950090, HAL.
    4. Nalli, Ayse & Haukkanen, Pentti, 2009. "On generalized Fibonacci and Lucas polynomials," Chaos, Solitons & Fractals, Elsevier, vol. 42(5), pages 3179-3186.
    5. Flaut, Cristina & Shpakivskyi, Vitalii & Vlad, Elena, 2017. "Some remarks regarding h(x) – Fibonacci polynomials in an arbitrary algebra," Chaos, Solitons & Fractals, Elsevier, vol. 99(C), pages 32-35.
    6. Ilija Tanackov & Ivan Pavkov & Željko Stević, 2020. "The New New-Nacci Method for Calculating the Roots of a Univariate Polynomial and Solution of Quintic Equation in Radicals," Mathematics, MDPI, vol. 8(5), pages 1-18, May.
    7. Chung-Chuan Chen & Lin-Ling Huang, 2021. "Some New Identities for the Generalized Fibonacci Polynomials by the Q(x) Matrix," Journal of Mathematics Research, Canadian Center of Science and Education, vol. 13(2), pages 1-21, April.
    8. Flaut, Cristina & Savin, Diana, 2019. "Some remarks regarding l-elements defined in algebras obtained by the Cayley–Dickson process," Chaos, Solitons & Fractals, Elsevier, vol. 118(C), pages 112-116.
    9. Marek-Crnjac, L., 2009. "Partially ordered sets, transfinite topology and the dimension of Cantorian-fractal spacetime," Chaos, Solitons & Fractals, Elsevier, vol. 42(3), pages 1796-1799.
    10. Hatir, E. & Noiri, T., 2009. "On δ–β-continuous functions," Chaos, Solitons & Fractals, Elsevier, vol. 42(1), pages 205-211.
    11. Natalia Bednarz, 2021. "On ( k , p )-Fibonacci Numbers," Mathematics, MDPI, vol. 9(7), pages 1-13, March.
    12. Iovane, G., 2009. "From Menger–Urysohn to Hausdorff dimensions in high energy physics," Chaos, Solitons & Fractals, Elsevier, vol. 42(4), pages 2338-2341.
    13. Florek, Wojciech, 2018. "A class of generalized Tribonacci sequences applied to counting problems," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 809-821.
    14. Falcón, Sergio & Plaza, Ángel, 2009. "The metallic ratios as limits of complex valued transformations," Chaos, Solitons & Fractals, Elsevier, vol. 41(1), pages 1-13.
    15. Falcon, Sergio, 2016. "The k–Fibonacci difference sequences," Chaos, Solitons & Fractals, Elsevier, vol. 87(C), pages 153-157.
    16. Falcón, Sergio & Plaza, Ángel, 2009. "On k-Fibonacci sequences and polynomials and their derivatives," Chaos, Solitons & Fractals, Elsevier, vol. 39(3), pages 1005-1019.
    17. E. Gokcen Kocer & Huriye Alsan, 2022. "Generalized Hybrid Fibonacci and Lucas p-numbers," Indian Journal of Pure and Applied Mathematics, Springer, vol. 53(4), pages 948-955, December.
    18. Postavaru, Octavian, 2023. "An efficient numerical method based on Fibonacci polynomials to solve fractional differential equations," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 212(C), pages 406-422.
    19. Ivana Matoušová & Pavel Trojovský, 2020. "On Coding by (2, q )-Distance Fibonacci Numbers," Mathematics, MDPI, vol. 8(11), pages 1-24, November.
    20. Nada, S.I., 2009. "Density manifolds, geometric measures and high-energy physics in transfinite dimensions," Chaos, Solitons & Fractals, Elsevier, vol. 42(3), pages 1539-1541.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:42:y:2009:i:1:p:435-440. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.