Downloads & Free Reading Options - Results

Deviation of ergodic sums is studied for substitution dynamical systems with a matrix that admits eigenvalues of modulus 1. We consider the corresponding eigenfunctions, and in Theorem 1.1 we prove that the limit inferior of the ergodic sums is bounded for every point in the phase space. In Theorem 1.2, we prove existence of limit distributions along certain exponential subsequences of times for substitutions of constant length. Under additional assumptions, we prove that ergodic integrals satisfy the Central Limit Theorem (Theorem 1.3, Theorem 1.9).

We consider the deviation of Birkhoff sums along fixed orbits of substitution dynamical systems. We show distributional convergence for the Birkhoff sums of eigenfunctions of the substitution matrix. For noncoboundary eigenfunctions with eigenvalue of modulus 1, we obtain a central limit theorem. For other eigenfunctions, we show convergence to distributions supported on Cantor sets. We also give a new criterion for such an eigenfunction to be a coboundary, as well as a new characterization of substitution dynamical systems with bounded discrepancy

For any primitive proper substitution \sigma, we give explicit constructions of countably many pairwise non-isomorphic substitution dynamical systems {(X_{\zeta_n}, T_{\zeta_n})}_{n=1}^{\infty} such that they all are (strong) orbit equivalent to (X_{\sigma}, T_{\sigma}). We show that the complexity of the substitution dynamical systems {(X_{\zeta_n}, T_{\zeta_n})} is essentially different that prevents them from being isomorphic. Given a primitive (not necessarily proper) substitution \tau, we find a stationary simple properly ordered Bratteli diagram with the least possible number of vertices such that the corresponding Bratteli-Vershik system is orbit equivalent to (X_{\tau}, T_{\tau}).

We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive substitutions to minimal substitutions. This includes applications to random Schr\"odinger operators and to number theory.

We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive substitutions to minimal substitutions. This includes applications to random Schr\"odinger operators and to number theory.