ℚ-bonacci words and numbers

2022/01/03 by Kirgizov, Sergey · 1 citation
#05A05 #11B39 #68R15 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics

paper · doi:10.48550/arxiv.2201.00782

Abstract

We present a quite curious generalization of multi-step Fibonacci numbers. For any positive rational q, we enumerate binary words of length n whose maximal factors of the form 0^a1^b satisfy a = 0 or aq > b. When q is an integer we rediscover classical multi-step Fibonacci numbers: Fibonacci, Tribonacci, Tetranacci, etc. When q is not an integer, obtained recurrence relations are connected to certain restricted integer compositions. We also discuss Gray codes for these words, and a possibly novel generalization of the golden ratio.

Cited by

• Enumeration in the lattice of q-decreasing words

Related

• Structure and growth of ℝ-bonacci words
• Gray codes for Fibonacci q-decreasing words
• Prefixes of the Fibonacci word
• Generalized Natural Density \DF(\mathfrakF_n) of Fibonacci Word
• Meta-Fibonacci Sequences, Binary Trees, and Extremal Compact Codes