2000 character limit reached
A Generalization of the Fibonacci Word Fractal and the Fibonacci Snowflake
Published 6 Dec 2012 in cs.DM and math.CO | (1212.1368v3)
Abstract: In this paper we introduce a family of infinite words that generalize the Fibonacci word and we study their combinatorial properties. Moreover, we associate to this family of words a family of curves, which have fractal properties, in particular these curves have as attractor the Fibonacci word fractal. Finally, we describe an infinite family of polyominoes (double squares) from the generalized Fibonacci words and we study some of their geometric properties. These last polyominoes generalize the Fibonacci snowflake.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.