• Images
• Videos
• Documents
• Books
• Articles

Definition

This curve is built iteratively by applying the Odd–Even Drawing rule to the Fibonacci word 0100101001001...:

For each digit at position k:

1. If the digit is 0:
   • Draw a line segment then turn 90° to the left if k is even
   • Draw a line segment then Turn 90° to the right if k is odd
2. If the digit is 1:
   • Draw a line segment and stay straight

To a Fibonacci word of length F n {\displaystyle F_{n}} (the nth Fibonacci number) is associated a curve F n {\displaystyle {\mathcal {F}}_{n}} made of F n {\displaystyle F_{n}} segments. The curve displays three different aspects whether n is in the form 3k, 3k + 1, or 3k + 2.

Properties

Some of the Fibonacci word fractal's properties include:¹²

• The curve F n {\displaystyle {\mathcal {F_{n}}}} contains F n {\displaystyle F_{n}} segments, F n − 1 {\displaystyle F_{n-1}} right angles and F n − 2 {\displaystyle F_{n-2}} flat angles.
• The curve never self-intersects and does not contain double points. At the limit, it contains an infinity of points asymptotically close.
• The curve presents self-similarities at all scales. The reduction ratio is 1 + 2 {\displaystyle 1+{\sqrt {2}}} . This number, also called the silver ratio, is present in a great number of properties listed below.
• The number of self-similarities at level n is a Fibonacci number \ −1. (more precisely: F 3 n + 3 − 1 {\displaystyle F_{3n+3}-1} ).
• The curve encloses an infinity of square structures of decreasing sizes in a ratio 1 + 2 {\displaystyle 1+{\sqrt {2}}} (see figure). The number of those square structures is a Fibonacci number.
• The curve F n {\displaystyle {\mathcal {F}}_{n}} can also be constructed in different ways (see gallery below):
  • Iterated function system of 4 and 1 homothety of ratio 1 / ( 1 + 2 ) {\displaystyle 1/(1+{\sqrt {2}})} and 1 / ( 1 + 2 ) 2 {\displaystyle 1/(1+{\sqrt {2}})^{2}}
  • By joining together the curves F n − 1 {\displaystyle {\mathcal {F}}_{n-1}} and F n − 2 {\displaystyle {\mathcal {F}}_{n-2}}
  • Lindenmayer system
  • By an iterated construction of 8 square patterns around each square pattern.
  • By an iterated construction of octagons
• The Hausdorff dimension of the Fibonacci word fractal is 3 log ⁡ φ log ⁡ ( 1 + 2 ) ≈ 1.6379 {\displaystyle 3\,{\frac {\log \varphi }{\log(1+{\sqrt {2}})}}\approx 1.6379} , with φ = 1 + 5 2 {\displaystyle \varphi ={\frac {1+{\sqrt {5}}}{2}}} the golden ratio.
• Generalizing to an angle α {\displaystyle \alpha } between 0 and π / 2 {\displaystyle \pi /2} , its Hausdorff dimension is 3 log ⁡ φ log ⁡ ( 1 + a + ( 1 + a ) 2 + 1 ) {\displaystyle 3\,{\frac {\log \varphi }{\log(1+a+{\sqrt {(1+a)^{2}+1}})}}} , with a = cos ⁡ α {\displaystyle a=\cos \alpha } .
• The Hausdorff dimension of its frontier is log ⁡ 3 log ⁡ ( 1 + 2 ) ≈ 1.2465 {\displaystyle {\frac {\log 3}{{\log(1+{\sqrt {2}}})}}\approx 1.2465} .
• Exchanging the roles of "0" and "1" in the Fibonacci word, or in the drawing rule yields a similar curve, but oriented 45°.
• From the Fibonacci word, one can define the «dense Fibonacci word», on an alphabet of 3 letters: 102210221102110211022102211021102110221022102211021... (sequence A143667 in the OEIS). The usage, on this word, of a more simple drawing rule, defines an infinite set of variants of the curve, among which:
  • a "diagonal variant"
  • a "svastika variant"
  • a "compact variant"
• It is conjectured that the Fibonacci word fractal appears for every sturmian word for which the slope, written in continued fraction expansion, ends with an infinite sequence of "1"s.

Gallery

The Fibonacci tile

The juxtaposition of four F 3 k {\displaystyle F_{3k}} curves allows the construction of a closed curve enclosing a surface whose area is not null. This curve is called a "Fibonacci tile".

• The Fibonacci tile almost tiles the plane. The juxtaposition of 4 tiles (see illustration) leaves at the center a free square whose area tends to zero as k tends to infinity. At the limit, the infinite Fibonacci tile tiles the plane.
• If the tile is enclosed in a square of side 1, then its area tends to 2 − 2 = 0.5857 {\displaystyle 2-{\sqrt {2}}=0.5857} .

Fibonacci snowflake

The Fibonacci snowflake is a Fibonacci tile defined by:³

• q n = q n − 1 q n − 2 {\displaystyle q_{n}=q_{n-1}q_{n-2}} if n ≡ 2 ( mod 3 ) {\displaystyle n\equiv 2{\pmod {3}}}
• q n = q n − 1 q ¯ n − 2 {\displaystyle q_{n}=q_{n-1}{\overline {q}}_{n-2}} otherwise.

with q 0 = ϵ {\displaystyle q_{0}=\epsilon } and q 1 = R {\displaystyle q_{1}=R} , L = {\displaystyle L=} "turn left" and R = {\displaystyle R=} "turn right", and R ¯ = L {\displaystyle {\overline {R}}=L} .

Several remarkable properties:⁴⁵

• It is the Fibonacci tile associated to the "diagonal variant" previously defined.
• It tiles the plane at any order.
• It tiles the plane by translation in two different ways.
• its perimeter at order n equals 4 F ( 3 n + 1 ) {\displaystyle 4F(3n+1)} , where F ( n ) {\displaystyle F(n)} is the nth Fibonacci number.
• its area at order n follows the successive indexes of odd row of the Pell sequence (defined by P ( n ) = 2 P ( n − 1 ) + P ( n − 2 ) {\displaystyle P(n)=2P(n-1)+P(n-2)} ).

See also

• Golden ratio
• Fibonacci number
• Fibonacci word
• List of fractals by Hausdorff dimension

External links

• "Generate a Fibonacci word fractal", OnlineMathTools.com.

References

1. Monnerot-Dumaine, Alexis (February 2009). "The Fibonacci word fractal", independent (hal.archives-ouvertes.fr). http://hal.archives-ouvertes.fr/hal-00367972/fr/ ↩

2. Hoffman, Tyler; Steinhurst, Benjamin (2016). "Hausdorff Dimension of Generalized Fibonacci Word Fractals". arXiv:1601.04786 [math.MG]. /wiki/ArXiv_(identifier) ↩

3. Blondin-Massé, Alexandre; Brlek, Srečko; Garon, Ariane; and Labbé, Sébastien (2009). "Christoffel and Fibonacci tiles", Lecture Notes in Computer Science: Discrete Geometry for Computer Imagery, p.67-8. Springer. ISBN 9783642043963. https://doi.org/10.1007%2F978-3-642-04397-0_7 ↩

4. Blondin-Massé, Alexandre; Brlek, Srečko; Garon, Ariane; and Labbé, Sébastien (2009). "Christoffel and Fibonacci tiles", Lecture Notes in Computer Science: Discrete Geometry for Computer Imagery, p.67-8. Springer. ISBN 9783642043963. https://doi.org/10.1007%2F978-3-642-04397-0_7 ↩

5. A. Blondin-Massé, S. Labbé, S. Brlek, M. Mendès-France (2011). "Fibonacci snowflakes". http://www.slabbe.org/Publications/2011-fibo-snowflakes.pdf ↩