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.[-]

Let $s(m)$ denote the number of distinct powers of 2 in the binary representation of $m$. Thus the Thue-Morse sequence is $(-1)^{s(m)}$ and
$T_n(x)=\sum_{0\leq m< 2^n}(-1)^{s(m)}e(mx)=\prod_{0\leq r< n}(1-e(2^rx))$
is a trigonometric generating generating function of the sequence. The work of Mauduit and Rivat on $(-1)^{s(p)}$ depends on nontrivial bounds for $\left \| T_n \right \|_1$ and for $\left \| T_n \right \|_\infty $. We consider other norms of the $T_n$. For positive integers $k$ let
$M_k(n)=\int_{0}^{1}\left | T_n(x) \right |^{2k}dx$
We show that the sequence $M_k(n)$ satisfies a linear recurrence of order $k$. Moreover, we determine a $k\times k$ matrix whose characteristic polynomial determines this linear recurrence.
This is joint work with Mauduit and Rivat.[-]

Given a subset A of an additive group, how small can the sumset $A+A = \lbrace a+a' : a, a' \epsilon$ $A \rbrace$ be ? And what can be said about the structure of $A$ when $A + A$ is very close to the smallest possible size ? The aim of this talk is to partially answer these two questions when A is either a subset of $\mathbb{Z}$, $\mathbb{Z}/n\mathbb{Z}$, $\mathbb{R}$ or $\mathbb{T}$ and to explain how in this problem discrete and continuous setting are linked. This should also illustrate two important principles in additive combinatorics : reduction and rectification.
This talk is partially based on some joint work with Pablo Candela and some other work with Paul Péringuey.[-]

T.C. Brown and A.R. Freedman proved that the set $\mathcal{P}_{2}$ of products of two primes contains no dense cluster; technically, $\mathcal{P}_{2}$ has a zero upper Banach density, defined as $\delta^{*}(\mathcal{P}_{2}) =\lim_{H\mapsto \infty} \limsup_{x\mapsto \infty} \frac{1}{H} Card \{n\in \mathcal{P}_{2}:x< n\leq x+H\}$.
Pramod Eyyunni, Sanoli Gun and I jointly studied the local behaviour of the product of two shifted primes $\mathcal{Q}_{2}=\{(q-1)(r-1):q,r \, primes\}$. Assuming a classical conjecture of Dickson, we proved that $\delta^{*}(\mathcal{Q}_{2}) = 1/6$. Notice that we know no un-conditional proof that $\delta^{*}(\mathcal{Q}_{2})$ is positive. The application, which was indeed our motivation, concerns the study of the local behaviour of the set $\mathcal{V}$ of values of Euler's totient function. Assuming Dickson's conjecture, we prove that $\delta^{*}(\mathcal{V})\geq 1/4$. The converse inequality $\delta^{*}(\mathcal{V})\leq 1/4$ had been proved in the previous millenium by K. Ford, S. Konyagin and C. Pomerance.[-]