Book contents
- Frontmatter
- Contents
- List of contributors
- Preface
- Acknowledgements
- 1 Preliminaries
- 2 Number representation and finite automata
- 3 Abstract numeration systems
- 4 Factor complexity
- 5 Substitutions, Rauzy fractals and tilings
- 6 Combinatorics on Bratteli diagrams and dynamical systems
- 7 Infinite words with uniform frequencies, and invariant measures
- 8 Transcendence and Diophantine approximation
- 9 Analysis of digital functions and applications
- 10 The equality problem for purely substitutive words
- 11 Long products of matrices
- References
- Notation index
- General index
5 - Substitutions, Rauzy fractals and tilings
Published online by Cambridge University Press: 05 March 2013
- Frontmatter
- Contents
- List of contributors
- Preface
- Acknowledgements
- 1 Preliminaries
- 2 Number representation and finite automata
- 3 Abstract numeration systems
- 4 Factor complexity
- 5 Substitutions, Rauzy fractals and tilings
- 6 Combinatorics on Bratteli diagrams and dynamical systems
- 7 Infinite words with uniform frequencies, and invariant measures
- 8 Transcendence and Diophantine approximation
- 9 Analysis of digital functions and applications
- 10 The equality problem for purely substitutive words
- 11 Long products of matrices
- References
- Notation index
- General index
Summary
Introduction
This chapter focuses on multiple tilings associated with substitutive dynamical systems. We recall that a substitutive dynamical system (Xσ, S) is a symbolic dynamical system where the shift S acts on the set Xσ of infinite words having the same language as a given infinite word which is generated by powers of a primitive substitution σ. We restrict to the case where the inflation factor of the substitution σ is a unit Pisot number. With such a substitution σ, we associate a multiple tiling composed of tiles which are given by the unique solution of a set equation expressed in terms of a graph associated with the substitution σ: these tiles are attractors of a graph-directed iterated function system (GIFS). They live in ℝn–1, where n stands for the cardinality of the alphabet of the substitution. Each of these tiles is compact, it is the closure of its interior, it has non-zero measure and it has a fractal boundary that is also an attractor of a GIFS. These tiles are called central tiles or Rauzy fractals, according to G. Rauzy who introduced them in (Rauzy 1982).
Central tiles were first introduced in (Rauzy 1982) for the case of the Tribonacci substitution (1 ↦ 12, 2 ↦ 13, 3 ↦ 1), and then in (Thurston 1989) for the case of the beta-numeration associated with the Tribonacci number (which is the positive root of X3 – X2 – X – 1).
- Type
- Chapter
- Information
- Combinatorics, Automata and Number Theory , pp. 248 - 323Publisher: Cambridge University PressPrint publication year: 2010
- 12
- Cited by