arXiv · 2210.02371
Word of low complexity without uniform frequencies
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.
Explore related subjects
Keep this discovery
Julien Cassaigne, Idrissa Kaboré. 2022-10-05. Word of low complexity without uniform frequencies. https://arxiv.org/abs/2210.02371
Cite the original work for its findings. Save a collection to share your selection of sources.