2000 character limit reached
Fibonacci words in hyperbolic Pascal triangles
Published 5 Mar 2017 in math.CO, cs.DM, and cs.FL | (1703.01588v1)
Abstract: The hyperbolic Pascal triangle ${\cal HPT}{4,q}$ $(q\ge5)$ is a new mathematical construction, which is a geometrical generalization of Pascal's arithmetical triangle. In the present study we show that a natural pattern of rows of ${\cal HPT}{4,5}$ is almost the same as the sequence consisting of every second term of the well-known Fibonacci words. Further, we give a generalization of the Fibonacci words using the hyperbolic Pascal triangles. The geometrical properties of a ${\cal HPT}_{4,q}$ imply a graph structure between the finite Fibonacci words.
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.