ℚ-bonacci words and numbers

01/03/2022
by   Sergey Kirgizov, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/05/2018

Integer and Mixed Integer Tverberg Numbers

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

A new indexed approach to render the attractors of Kleinian groups

One widespread procedure to render the attractor of Kleinian groups, pub...
05/23/2011

A Tool for Integer Homology Computation: Lambda-At Model

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

Gray codes for Fibonacci q-decreasing words

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

Balancedness and coboundaries in symbolic systems

This paper studies balancedness for infinite words and subshifts, both f...
06/25/2021

Asymptotic bit frequency in Fibonacci words

It is known that binary words containing no k consecutive 1s are enumera...
12/28/2018

Characterizing Watermark Numbers encoded as Reducible Permutation Graphs against Malicious Attacks

In the domain of software watermarking, we have proposed several graph t...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.