Substitutions in Dynamics, Arithmetics and Combinatorics [electronic resource] /

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.

Bibliographic Details

Main Authors:	Fogg, N. Pytheas. editor., Berthé, Valéré. editor., Ferenczi, Sébastien. editor., Mauduit, Christian. editor., Siegel, Anne. editor., SpringerLink (Online service)
Format:	Texto biblioteca
Language:	eng
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg, 2002
Subjects:	Mathematics., Computers., Mathematical logic., Dynamics., Ergodic theory., Functions of real variables., Sequences (Mathematics)., Number theory., Number Theory., Real Functions., Dynamical Systems and Ergodic Theory., Sequences, Series, Summability., Computation by Abstract Devices., Mathematical Logic and Formal Languages.,
Online Access:	http://dx.doi.org/10.1007/b13861
Tags:	Add Tag No Tags, Be the first to tag this record!