Skip to main content

Part of the book series: Nonlinear Phenomena and Complex Systems ((NOPH,volume 2))

  • 145 Accesses

Abstract

We give in the following a definition of the complexity function of an infinite sequence on a finite alphabet. This function measures in some sense the predictability of the sequence. It is defined as the counting function of blocks of length n occurring in the given sequence. These blocks can be arranged in graphs and we study in a peculiar case (sturmian sequences) the evolution of these graphs. It turns out that low complexity implies strong geometrical properties of the sequence viewed as the itinerary of a point in some dynamical system. This field of research is rich of yet unsolved problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allouche, J.-P., Sur la Complexité des Suites Infinies, Bull. Belg. Math. Soc. 1 (1994).

    Google Scholar 

  2. Arnoux, P., G. Rauzy, Representation Geometrique des Suites de Complexité 2n + 1, Bull. Soc. Math. France 119 (1991).

    Google Scholar 

  3. Coven, E., G. Hedlund, Sequences with Minimal Blocks Growth, Math. Systems Theory 7 (1973).

    Google Scholar 

  4. Hedlund, G., Sturmian Minimal Sets, Amer. J. Math. 66 (1944).

    Google Scholar 

  5. Hedlund, G., M. Morse, Symbolic Dynamics II. Sturmian Trajectories, Amer. J. Math. 62 (1940).

    Google Scholar 

  6. Hubert, P., Complexité des Suites Definies par des Trajectoires de Billard dans un Polygone Rationnel, Bull. Soc. Math. France (1993).

    Google Scholar 

  7. Queffelec, M., Substitution Dynamical Systems - Spectral Analysis, Lecture Notes in Mathematics 1294, Springer, Berlin, (1987).

    Google Scholar 

  8. Rauzy, G., Suites a Termes dans un Alphabet Fini, Seminaire de Theorie des Nombres de Bordeaux (1982–1983).

    Google Scholar 

  9. Zorich, A., Deviation for the Interval Exchange Transformations, Preprint Max-Planck Institue für Mathematik Bonn.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Rauzy, G. (1996). Low Complexity and Geometry. In: Goles, E., Martínez, S. (eds) Dynamics of Complex Interacting Systems. Nonlinear Phenomena and Complex Systems, vol 2. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1323-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-1323-8_4

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4734-2

  • Online ISBN: 978-94-017-1323-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics