IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-94-009-1910-5_15.html

Mosaic Numbers of Fibonacci Trees

In: Applications of Fibonacci Numbers

Author

Listed:
  • Heiko Harborth
  • Sabine Lohmann

Abstract

Different meanings of Fibonacci trees are used in the mathematical literature. Here we will consider those drawings of trees which represent the old rabbit story as in V. E. Hoggatt’s book [3], p. 2. These Fibonacci trees T n will be realized as polyominoes in the square grid such that vertices correspond to unit squares and edges to certain strings of edge-to-edge unit squares. Because of their patterns we will call these realizations mosaics of T n . Subsequently we define the mosaic number M( n ) of T n to be the smallest number of unit squares which are necessary for realizations of T n . It is the purpose of this note to determine general bounds of M(n) and exact values for small n.

Suggested Citation

  • Heiko Harborth & Sabine Lohmann, 1990. "Mosaic Numbers of Fibonacci Trees," Springer Books, in: G. E. Bergum & A. N. Philippou & A. F. Horadam (ed.), Applications of Fibonacci Numbers, pages 133-138, Springer.
  • Handle: RePEc:spr:sprchp:978-94-009-1910-5_15
    DOI: 10.1007/978-94-009-1910-5_15
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:sprchp:978-94-009-1910-5_15. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.