These lectures introduce the dynamical systems approach to tilings of Euclidean space, especially quasicrystalline tilings that have been constructed using a ‘supertile method'. Because tiling dynamics parallels one-dimensional symbolic dynamics, we discuss this case as well, highlighting the differences and similarities in the methods of study and the results that can be obtained.
In the first lecture we motivate the field with the discovery of quasicrystals, which led to D. Schectman's winning the 2011 Nobel Prize in Chemistry. Then we set up the basics of tiling dynamics, describing tiling spaces, a tiling metric, and the shift or translation actions. Shift-invariant and ergodic measures are discussed, along with fundamental topological and dynamical properties.
The second lecture brings in the supertile construction methods, including symbolic substitutions, self-similar tilings, $S$-adic systems, and fusion rules. Numerous examples are given, most of which are not the “standard” examples, and we identify many commonalities and differences between these interrelated methods of construction. Then we compare and contrast dynamical results for supertile systems, highlighting those key insights that can be adapted to all cases.
In the third lecture we investigate one of the many current tiling research areas: spectral theory. Schectman made his Nobel-prize-winning discovery using diffraction analysis, and studying the mathematical version has been quite fruitful. Spectral theory of tiling dynamical systems is also of broad interest. We describe how these types of spectral analysis are carried out, give examples, and discuss what is known and unknown about the relationship between dynamical and diffraction analysis. Special attention is paid to the “point spectrum”, which is related to eigenfunctions and also to the bright spots that appear on diffraction images.[-]

Based on work done by Morse and Hedlund (1940) it was observed by Arnoux and Rauzy (1991) that the classical continued fraction algorithm provides a surprising link between arithmetic and diophantine properties of an irrational number $\alpha$, the rotation by $\alpha$ on the torus $\mathbb{T} = \mathbb{R}/\mathbb{Z}$, and combinatorial properties of the well known Sturmian sequences, a class of sequences on two letters with low subword complexity.
It has been conjectured since the early 1990ies that this correspondence carries over to generalized continued fraction algorithms, rotations on higher dimensional tori, and so-called $S$-adic sequences generated by substitutions. The idea of working towards this generalization is known as Rauzy's program. Although, starting with Rauzy (1982) a number of examples for such a generalization was devised, Cassaigne, Ferenczi, and Zamboni (2000) came up with a counterexample that showed the limitations of such a generalization.
Nevertheless, recently Berthé, Steiner, and Thuswaldner (2016) made some further progress on Rauzy's program and were able to set up a generalization of the above correspondences. They proved that the above conjecture is true under certain natural conditions. A prominent role in this generalization is played by tilings induced by generalizations of the classical Rauzy fractal introduced by Rauzy (1982).
Another idea which is related to the above results goes back to Artin (1924), who observed that the classical continued fraction algorithm and its natural extension can be viewed as a Poincaré section of the geodesic flow on the space $SL_2(\mathbb{Z}) \ SL_2(\mathbb{R})$. Arnoux and Fisher (2001) revisited Artin's idea and showed that the above mentioned correspondence between continued fractions, rotations, and Sturmian sequences can be interpreted in a very nice way in terms of an extension of this geodesic flow which they called the scenery flow. Currently, Arnoux et al. are setting up elements of a generalization of this connection as well.
It is the aim of my series of lectures to review the above results.[-]

The general aim of these lectures is to present some interplay between combinatorial game theory (CGT) and combinatorics on (multidimensional) words.
In the first introductory lecture, we present some basic concepts from combinatorial game theory (positions of a game, Nim-sum, Sprague-Grundy function, Wythoff's game, ...). We also review some concepts from combinatorics on words. We thus introduce the well-known k-automatic sequences and review some of their characterizations (in terms of morphisms, finiteness of their k-kernel,...). These sequences take values in a finite set but the Sprague-Grundy function of a game, such as Nim of Wythoff, is usually unbounded. This provides a motivation to introduce k-regular sequences (in the sense of Allouche and Shallit) whose k-kernel is not finite, but finitely generated.
In the second lecture, games played on several piles of token naturally give rise to a multi-dimensional setting. Thus, we reconsider k-automatic and k-regular sequences in this extended framework. In particular, determining the structure of the bidimensional array encoding the (loosing) P-positions of the Wythoff's game is a long-standing and challenging problem in CGT. Wythoff's game is linked to non-standard numeration system: P-positions can be determined by writing those in the Fibonacci system. Next, we present the concept of shape-symmetric morphism: instead of iterating a morphism where images of letters are (hyper-)cubes of a fixed length k, one can generalize the procedure to images of various parallelepipedic shape. The shape-symmetry condition introduced twenty years ago by Maes permits to have well-defined fixed point.
In the last lecture, we move to generalized numeration systems: abstract numeration systems (built on a regular language) and link them to morphic (multidimensional) words. In particular, pictures obtained by shape-symmetric morphisms coincide with automatic sequences associated with an abstract numeration system. We conclude these lectures with some work in progress about games with a finite rule-set. This permits us to discuss a bit Presburger definable sets.[-]

One of the most fundamental problem in tiling theory is to decide, given a surface, a set of tiles and a tiling rule, whether there exist a way to tile the surface using the set of tiles and following the rules. As proven by Berger in the 60's, this problem is undecidable in general.
When formulated in terms of tilings of the discrete plane by unit tiles with colored constraints, this is called the Domino Problem and was introduced by Wang in an effort to solve satisfaction problems for ??? formulas by translating the problem into a geometric problem.
In this course, we will give a brief description of the problem and to the meaning of the word “undecidable”, and then give two different proofs of the result.[-]