Word of low complexity without uniform frequencies - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2022

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.

Dates and versions

hal-03866716 , version 1 (22-11-2022)

Identifiers

Cite

Julien Cassaigne, Idrissa Kaboré. Word of low complexity without uniform frequencies. 2022. ⟨hal-03866716⟩
36 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More