A word of low complexity without uniform frequencies

In this paper, we construct a uniformly 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.

Saved in:
Bibliographic Details
Published in:Ergodic theory and dynamical systems 2024-04, Vol.44 (4), p.1013-1025
Main Authors: CASSAIGNE, JULIEN, KABORÉ, IDRISSA
Format: Article
Language:English
Subjects:
Codes
Complexity
Mathematics
Original Article
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we construct a uniformly 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.
ISSN:0143-3857
1469-4417
DOI:10.1017/etds.2023.37