\mathbb{Q}-bonacci words and numbers

MaRDI QIDQ6387403arXivFDO

Authors Sergey Kirgizov

Publication date 3 January 2022

Published in arXiv

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Combinatorics on words (68R15)

arXiv classification

cs.DMmath.CO

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^a{1}^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.

This page was built for publication: $\mathbb{Q}$-bonacci words and numbers

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