Morphic words and equidistributed sequences

exists and is unique for every word with well-defined positive uniform frequencies of every factor, or, in dynamical terms, for every element of a uniquely ergodic subshift. In this paper we describe the construction of

u_{w}

for the case when the subshift of

w

is generated by a morphism of a special kind; then we overcome some technical difficulties to extend the result to all binary morphisms. The sequence

u_{w}

in this case is also constructed with a morphism. At last, we introduce a software tool which, given a binary morphism

v a r p h i

, computes the morphism on extended intervals and first elements of the equidistributed sequences associated with fixed points of

v a r p h i

.

Review text

For an aperiodic (uniquely ergodic) one-sided shift \((X,\sigma)\) defined by a primitive substitution (or morphism) \(\varphi\) on an ordered alphabet \(A\), the authors consider the map \(\nu\) assigning to each \(w \in X\) the measure of all lexicographically smaller words. The sequence \(N(w) = (\nu(\sigma^n w))_{n\in\mathbb{N}}\) is then uniformly distributed on \([0,1]\) for all \(w \in X\). When \(\varphi\) is order-preserving and \(\{\sigma^n \varphi([a]): a\in A,0\le n|\varphi(a)|\}\) forms a partition of \(X\) into intervals, the authors give a morphism \(f\) on an extension of \([0,1]\) such that \(f \circ N = N \circ \varphi\). Then, for the fixed point \(w\) of \(\varphi\) starting with the smallest letter in \(A\), the sequence \(N(w)\) is the fixed point of \(f\) starting with \(0\). A construction for arbitrary binary substitutions is also given, together with a computer program.

Recommendations

Cites work

Cited in

(13)

This page was built for publication: Morphic words and equidistributed sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2283040)