Substitutions in Dynamics, Arithmetics, and Combinatorics
by Pierre Arnoux, et al.
Publisher: Springer 2002
ISBN/ASIN: 3540441417
ISBN-13: 9783540441410
Number of pages: 419
Description:
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.
Download or read it online for free here:
Download link
(multiple PS files)
Similar books
Local Theory of Holomorphic Foliations and Vector Fieldsby Julio C. Rebelo, Helena Reis - arXiv
Informal lecture notes intended for graduate students about the standard local theory of holomorphic foliations and vector fields. Though the material presented here is well-known some of the proofs differ slightly from the classical arguments.
(11692 views)
Data Assimilation: A Mathematical Introductionby K.J.H. Law, A.M. Stuart, K.C. Zygalakis - arXiv.org
This book provides a systematic treatment of the mathematical underpinnings of work in data assimilation. Authors develop a framework in which a Bayesian formulation of the problem provides the bedrock for the derivation and analysis of algorithms.
(8520 views)
Geometrical Theory of Dynamical Systemsby Nils Berglund - arXiv
This text is a slightly edited version of lecture notes for a course to undergraduate Mathematics and Physics students. Contents: Examples of Dynamical Systems; Stationary and Periodic Solutions; Local Bifurcations; Introduction to Chaotic Dynamics.
(12555 views)
Random Differential Equations in Scientific Computingby Tobias Neckel, Florian Rupp - De Gruyter Open
This book is a self-contained treatment of the analysis and numerics of random differential equations from a problem-centred point of view. An interdisciplinary approach is applied by considering both dynamical systems and scientific computing.
(6232 views)