arXiv Analytics

Sign in

arXiv:math/0302231 [math.DS]AbstractReferencesReviewsResources

Substitution Dynamical Systems: Characterization of Linear Repetitivity and Applications

D. Damanik, D. Lenz

Published 2003-02-19, updated 2003-10-10Version 2

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.

Comments: 14 pages, assumption (4) included
Categories: math.DS, math-ph, math.MP
Subjects: 37B10, 68R15
Related articles: Most relevant | Search more
arXiv:math/0005062 [math.DS] (Published 2000-05-06)
Linear repetitivity, I. Uniform subadditive ergodic theorems and applications
arXiv:1610.04267 [math.DS] (Published 2016-10-13)
On Word Equations Originated from Discrete Dynamical Systems Related to Antisymmetric Cubic Maps With Some Applications
arXiv:math/0308158 [math.DS] (Published 2003-08-18)
Cohomology of property T groupoids and applications

Links

Toolbox