contact ::
thèmes de recherche ::
papiers ::
thèse ::
séminaires (photos) ::
m2 ::
admin ::
blog ::
liens ::
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
.
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.
Hence looking for unique ergodicity is not just a trick and there is no loss to look for it.
Page web propulsée par nilcms. Pour une validation stricte, débrouillez-vous.
[ Wiki ::
WildSurfaces -
BwataBaire -
Substitutions -
CellularAutomata -
LMA -
Ecool
]