contact ::
thèmes de recherche ::
papiers ::
thèse ::
séminaires (photos) ::
m2 ::
admin ::
blog ::
english
The first motivating question was the following : we are looking for a condition on the complexity of an infinite word that ensures that it has frequencies. We are mostly interested with uniformly recurrent words.
Michael Boshernitzan proved that if a uniformly recurrent word satisfies or then its associated subshift is uniquely ergodic, hence has frequencies [1]. Julien Cassaigne and Idrissa Kaboré constructed a word without frequencies such that
More generally, suppose we are looking for sufficient conditions on the language of an uniformly recurrent word to have frequencies.
Looking for the unique ergodicity of the associated subshift is a possible strategy (see Background - Symbolic dynamics), but we may miss something (it is a sufficient condition). In fact, unique ergodicity is necessary to ensure that all words sharing a uniformly recurrent language have frequencies.
The proof comes from an old paper of Oxtoby [2] : Suppose that there exists a minimal non-uniquely ergodic subshift such that any word in has frequencies. Any word in has frequencies so the functions
Hence looking for unique ergodicity is not just a trick and there is no loss to look for it.
Historique de cette page -
Page d'accueil -
Changements récents -
RSS
Page web propulsée par nilcms, ChuWiki et mimeTeX. Pour une validation stricte, débrouillez-vous
[ Wiki ::
WildSurfaces -
BwataBaire -
Substitutions -
CellularAutomata -
LMA -
Ecool
]