Complexity of the Fibonacci snowflake

DOI10.1142/S0218348X12500235MaRDI QIDQ2836505zbMATH OpenFDO

Authors Alexandre Blondin Massé, Srečko Brlek, Sébastien Labbé, Michel Mendès France

Publication date 3 July 2013

Published in Fractals (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1103.6171

zbMATH Keywords

entropycomplexityfractal dimensiontilingFibonacci snowflake

Mathematics Subject Classification ID

Fractals (28A80)

Abstract: The object under study is a particular closed curve on the square lattice $$ related with the Fibonacci sequence $F_n$. It belongs to a class of curves whose length is $4F_{3n+1}$, and whose interiors by translation tile the plane. The limit object, when conveniently normalized, is a fractal line for which we compute first the fractal dimension, and then give a complexity measure.

Recommendations

• Fibonacci snowflakes
• Generating fractal curves from homomorphisms between languages [with Mathematica\(^\circledR\)]
• A generalization of the Fibonacci word fractal and the Fibonacci snowflake
• Hausdorff dimension of generalized Fibonacci word fractals
• scientific article; zbMATH DE number 2145129

Cited in

(9)

• Hausdorff dimension of generalized Fibonacci word fractals
• Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
• The complexity of Fibonacci-like kneading sequences
• Fibonacci snowflakes
• Fibonacci numbers and self-dual lattice structures for plane branches
• Mathematical specification of hitomezashi designs
• A generalization of the Fibonacci word fractal and the Fibonacci snowflake
• The Fibonacci fractal is a new fractal type
• An example of PET. Computation of the Hausdorff dimension of the aperiodic set

This page was built for publication: Complexity of the Fibonacci snowflake

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836505)