Amazon cover image
Image from Amazon.com
Image from Google Jackets

Substitutions in Dynamics, Arithmetics and Combinatorics [electronic resource] / edited by N. Pytheas Fogg, Valéré Berthé, Sébastien Ferenczi, Christian Mauduit, Anne Siegel.

Contributor(s): Material type: TextTextSeries: Lecture Notes in Mathematics ; 1794Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2002Description: XX, 404 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540457145
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 512.7 23
LOC classification:
  • QA241-247.5
Online resources:
Contents:
Basic notions on substitutions -- Basic notions on substitutions -- Arithmetics and combinatorics of substitutions -- Substitutions, arithmetic and finite automata: an introduction -- Automatic sequences and transcendence -- Substitutions and partitions of the set of positive integers -- Dynamics of substitutions -- Substitutions and symbolic dynamical systems -- Sturmian Sequences -- Spectral theory and geometric representation of substitutions -- Diophantine approximations, substitutions, and fractals -- Extensions to free groups and interval transformations -- Infinite words generated by invertible substitutions -- Polynomial dynamical systems associated with substitutions -- Piecewise linear transformations of the unit interval and Cantor sets -- Some open problems -- A. Undecomposable matrices in dimension 3 (by J. Rivat).
In: Springer eBooksSummary: 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.
List(s) this item appears in: MTH Majors
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Basic notions on substitutions -- Basic notions on substitutions -- Arithmetics and combinatorics of substitutions -- Substitutions, arithmetic and finite automata: an introduction -- Automatic sequences and transcendence -- Substitutions and partitions of the set of positive integers -- Dynamics of substitutions -- Substitutions and symbolic dynamical systems -- Sturmian Sequences -- Spectral theory and geometric representation of substitutions -- Diophantine approximations, substitutions, and fractals -- Extensions to free groups and interval transformations -- Infinite words generated by invertible substitutions -- Polynomial dynamical systems associated with substitutions -- Piecewise linear transformations of the unit interval and Cantor sets -- Some open problems -- A. Undecomposable matrices in dimension 3 (by J. Rivat).

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.

There are no comments on this title.

to post a comment.
(C) Powered by Koha

Powered by Koha