Word of low complexity without uniform frequencies
Dynamical Systems
2022-10-06 v1
Abstract
In this paper, we construct a uniformely recurrent infinite word of low complexity without uniform frequencies of letters. This shows the optimality of a bound of Boshernitzan, which gives a sufficient condition for a uniformly recurrent infinite word to admit uniform frequencies.
Keywords
Cite
@article{arxiv.2210.02371,
title = {Word of low complexity without uniform frequencies},
author = {Julien Cassaigne and Idrissa Kaboré},
journal= {arXiv preprint arXiv:2210.02371},
year = {2022}
}
Comments
16 pages, English