COMPLEXITY OF THE FIBONACCI SNOWFLAKE-Reference-Cited by-同舟云学术

COMPLEXITY OF THE FIBONACCI SNOWFLAKE

Published:2012-09 Issue:03n04 Volume:20 Page:257-260
ISSN:0218-348X
Container-title:Fractals
language:en
Short-container-title:Fractals

Author:

MASSÉ ALEXANDRE BLONDIN¹,BRLEK SREČKO²,LABBÉ SÉBASTIEN²,FRANCE MICHEL MENDÈS³

Affiliation:

1. Laboratoire d'informatique Formelle, Université du Québec à Chicoutimi, 555, boul. de l'Université, Chicoutimi, (QC) Canada G7H 2B1, Canada

2. Laboratorie de Combinatoire et d'informatique Mathématique (LaCIM), Université du Québec à Montréal, C. P. 8888, Succ. Centre-ville, Montréal (QC) Canada H3C 3P8, Canada

3. Département de Mathématiques, UMR 5251, Université Bordeaux 1, 351 Cours de la Libération, F-33405 Talence Cedex, France

Abstract

The object under study is a particular closed and simple curve on the square lattice ℤ2 related with the Fibonacci sequence Fn. It belongs to a class of curves whose length is 4F3n+1, and whose interiors tile the plane by translation. The limit object, when conveniently normalized, is a fractal line for which we compute first the fractal dimension, and then give a complexity measure.

Publisher

World Scientific Pub Co Pte Lt

Subject

Applied Mathematics,Geometry and Topology,Modeling and Simulation

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218348X12500235

Reference5 articles.

1. VII. On the theory of local probability, applied to straight lines drawn at random in a plane; the methods used being also extended to the proof of certain new theorems in the integral calculus

2. Length, shape and area

3. The Planck constant of a curve

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mathematical specification of hitomezashi designs;Journal of Mathematics and the Arts;2023-04-03

2. An example of PET. Computation of the Hausdorff dimension of the aperiodic set;Transactions of the American Mathematical Society;2017-09-08

3. Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability;Theoretical Computer Science;2017-01

4. Reconstructing Words from a σ-palindromic Language;Fundamenta Informaticae;2014

5. On the k-Fibonacci words;Acta Universitatis Sapientiae, Informatica;2013-12-01