menu
{ "item_title" : "Substitutions in Dynamics, Arithmetics and Combinatorics", "item_author" : [" N. Pytheas Fogg", "Valerie Berthé", "Sebastien Ferenczi "], "item_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.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.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/3/54/044/141/3540441417_b.jpg", "price_data" : { "retail_price" : "84.99", "online_price" : "84.99", "our_price" : "84.99", "club_price" : "84.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Substitutions in Dynamics, Arithmetics and Combinatorics|N. Pytheas Fogg

Substitutions in Dynamics, Arithmetics and Combinatorics

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9783540441410
  • ISBN-10: 3540441417
  • Publisher: Springer
  • Publish Date: September 2002
  • Dimensions: 9.3 x 6.18 x 0.93 inches
  • Shipping Weight: 1.36 pounds
  • Page Count: 404

Related Categories

You May Also Like...

    1

BAM Customer Reviews