Finding Fibonacci in a Fractal

Nathan C. Blecke, Kirsten Fleming and George William Grossman

A chapter in Applications of Fibonacci Numbers, 2004, pp 43-62 from Springer

Abstract: Abstract The focus of this paper is to further investigate properties of a two-dimensional fractal that involves counting and Fibonacci numbers. We determine the fractal dimension using the Box Counting Theorem and also the concept of similitude. We find affine transformations that generate some of the set of points that are in the fractal, which have the form Ax + b for a pair of two matrices A 1 and A 2 and some vectors x, b 1 and b 2. We denote these transformations S 1 and S 2. We find examples of the limit points generated, by taking repeated applications of the operators on some starting points (which are vertices of triangles) in some prescribed order. The fractal, denoted G, is the countable intersection of the countable union of a set of triangles. The fractal is shown to be a totally disconnected set.

Keywords: 11B39; 29A80 (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-306-48517-6_7

Ordering information: This item can be ordered from
http://www.springer.com/9780306485176

DOI: 10.1007/978-0-306-48517-6_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().