Asymptotic bit frequency in Fibonacci words
Combinatorics
2022-05-09 v2 Discrete Mathematics
Abstract
It is known that binary words containing no consecutive 1s are enumerated by -step Fibonacci numbers. In this note we discuss the expected value of a random bit in a random word of length having this property.
Cite
@article{arxiv.2106.13550,
title = {Asymptotic bit frequency in Fibonacci words},
author = {Jean-Luc Baril and Sergey Kirgizov and Vincent Vajnovszki},
journal= {arXiv preprint arXiv:2106.13550},
year = {2022}
}
Comments
8 pages, 3 figures