Substitutions in Dynamics, Arithmetics and Combinatorics

A certain category of infinite strings of letters on a finite alphabet is presented here, chosen among the 'simplest' possible one may build, both because they are very deterministic and because they are built by simple rules (a letter is replaced by a word, a sequence is produced by itera...

Full description

Main Author: Pytheas Fogg, N.
Corporate Author: SpringerLink (Online service)
Other Authors: Berthé, Valerie (Editor), Ferenczi, Sebastien (Editor), Mauduit, Christian (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2002, 2002
Edition:1st ed. 2002
Series:Lecture Notes in Mathematics
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Summary:A certain category of infinite strings of letters on a finite alphabet is presented here, chosen among the 'simplest' possible one may build, both because they are very deterministic and because they are built by simple rules (a letter is replaced by a word, a sequence is produced by iteration). These substitutive sequences have a surprisingly rich structure. The authors describe the concepts of quantity of natural interactions, with combinatorics on words, ergodic theory, linear algebra, spectral theory, geometry of tilings, theoretical computer science, diophantine approximation, trancendence, graph theory. This volume fulfils the need for a reference on the basic definitions and theorems, as well as for a state-of-the-art survey of the more difficult and unsolved problems
Physical Description:XX, 404 p online resource
ISBN:9783540457145