Skip to main content
    • Aa
    • Aa

Rank and symbolic complexity

  • Sébastien Ferenczi (a1)

We investigate the relation between the complexity function of a sequence, that is the number p(n) of its factors of length n, and the rank of the associated dynamical system, that is the number of Rokhlin towers required to approximate it. We prove that if the rank is one, then lim , but give examples with lim for any prescribed function G with G (n) = 0(an) for every a > 1. We give exact computations for examples of the ‘staircase’ type, which are strongly mixing systems with quadratic complexity. Conversely, for minimal sequences, if p(n) < an + b for some a ≥ 1, the rank is at most 2[a], with bounded strings of spacers, and the system is generated by a finite number of substitutions.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[Co] A. Cobham . Uniform tag sequences. Math. Systems Theory 6 (1972), 164192.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Ergodic Theory and Dynamical Systems
  • ISSN: 0143-3857
  • EISSN: 1469-4417
  • URL: /core/journals/ergodic-theory-and-dynamical-systems
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 7 *
Loading metrics...

Abstract views

Total abstract views: 46 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 27th May 2017. This data will be updated every 24 hours.