Substitution Dynamical Systems: Characterization of Linear Repetitivity and Applications
Damanik, D. ; Lenz, D.
arXiv, 0302231 / Harvested from arXiv
Text on arXiv
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.
Publié le : 2003-02-19
Classification:  Mathematics - Dynamical Systems,  Mathematical Physics,  37B10, 68R15 
@article{0302231,
     author = {Damanik, D. and Lenz, D.},
     title = {Substitution Dynamical Systems: Characterization of Linear Repetitivity
  and Applications},
     journal = {arXiv},
     volume = {2003},
     number = {0},
     year = {2003},
     language = {en},
     url = {http://dml.mathdoc.fr/item/0302231}
}

Damanik, D.; Lenz, D. Substitution Dynamical Systems: Characterization of Linear Repetitivity
  and Applications. arXiv, Tome 2003 (2003) no. 0, . http://gdmltest.u-ga.fr/item/0302231/