Fibonacci word fractal

From testwiki
Revision as of 16:37, 30 November 2024 by 190.102.16.9 (talk) (Clarified the drawing rule as it created some confusion due to the drawing part being between two evaluations of the same digit (e.g it's not the digit at the starting point and the digit at the ending point))
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

The Fibonacci word fractal is a fractal curve defined on the plane from the Fibonacci word.

Definition

The first iterations
L-system representation[1]

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 Fn (the nth Fibonacci number) is associated a curve n made of Fn segments. The curve displays three different aspects whether n is in the form 3k, 3k + 1, or 3k + 2.

Properties

The Fibonacci numbers in the Fibonacci word fractal.

Some of the Fibonacci word fractal's properties include:[2][3]

  • The curve 𝓃 contains Fn segments, Fn1 right angles and Fn2 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. 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: F3n+31).
  • The curve encloses an infinity of square structures of decreasing sizes in a ratio 1+2 (see figure). The number of those square structures is a Fibonacci number.
  • The curve ncan also be constructed in different ways (see gallery below):
    • Iterated function system of 4 and 1 homothety of ratio 1/(1+2) and 1/(1+2)2
    • By joining together the curves n1 and n2
    • 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 3logφlog(1+2)1.6379, with φ=1+52 the golden ratio.
  • Generalizing to an angle α between 0 and π/2, its Hausdorff dimension is 3logφlog(1+a+(1+a)2+1), with a=cosα.
  • The Hausdorff dimension of its frontier is log3log(1+2)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... Template: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.

The Fibonacci tile

Imperfect tiling by the Fibonacci tile. The area of the central square tends to infinity.

The juxtaposition of four F3k 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 22=0.5857.
Perfect tiling by the Fibonacci snowflake

Fibonacci snowflake

Fibonacci snowflakes for i = 2 for n = 1 through 4: 1[2], 2[2], 3[2], 4[2][4]

The Fibonacci snowflake is a Fibonacci tile defined by:[5]

  • qn=qn1qn2 if n2(mod3)
  • qn=qn1qn2 otherwise.

with q0=ϵ and q1=R, L= "turn left" and R= "turn right", and R=L.

Several remarkable properties:[5][6]

  • 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 4F(3n+1), where 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)=2P(n1)+P(n2)).

See also

References

  1. Ramírez, José L.; Rubiano, Gustavo N. (2014). "Properties and Generalizations of the Fibonacci Word Fractal", The Mathematical Journal, Vol. 16.
  2. Monnerot-Dumaine, Alexis (February 2009). "The Fibonacci word fractal", independent (hal.archives-ouvertes.fr).
  3. Template:Cite arXiv
  4. Ramírez, Rubiano, and De Castro (2014). "A generalization of the Fibonacci word fractal and the Fibonacci snowflake", Theoretical Computer Science, Vol. 528, p.40-56. [1]
  5. 5.0 5.1 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. Template:ISBN.
  6. A. Blondin-Massé, S. Labbé, S. Brlek, M. Mendès-France (2011). "Fibonacci snowflakes".

Template:Fractals