DeepAI AI Chat
Log In Sign Up

ℚ-bonacci words and numbers

by   Sergey Kirgizov, et al.

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.


page 1

page 2

page 3

page 4


Integer and Mixed Integer Tverberg Numbers

We show that the Tverberg number of Z^2 is 4m-3. We also improve the upp...

A new indexed approach to render the attractors of Kleinian groups

One widespread procedure to render the attractor of Kleinian groups, pub...

A Tool for Integer Homology Computation: Lambda-At Model

In this paper, we formalize the notion of lambda-AT-model (where λ is a ...

Gray codes for Fibonacci q-decreasing words

An n-length binary word is q-decreasing, q≥ 1, if every of its length ma...

Balancedness and coboundaries in symbolic systems

This paper studies balancedness for infinite words and subshifts, both f...

Asymptotic bit frequency in Fibonacci words

It is known that binary words containing no k consecutive 1s are enumera...

Uniform random generations and rejection method(I) with binomial majorant

We present three simple algorithms to uniformly generate `Fibonacci word...