Soit $\beta$ un nombre de Pisot ; nous montrons que pour tout entier $n$ assez grand il existe une matrice carrée à coefficients positifs ou nuls dont l’ordre est égal au degré de $\beta$ et dont ${\beta }^n$ est valeur propre.Soit $\beta =a_1/\beta +a_2/{\beta }^2+\cdots +a_n/{\beta }^n+\cdots$ le $\beta$-développement de $\beta$ ; si $\beta$ est un nombre de Pisot, alors la suite ${\left(a_n\right)}_{n\ge 1}$ est périodique après un certain rang $n_0$ (pour $n\ge n_0$, $a_{n+k}=a_n$) et le polynôme$$X^{n_0+k}-(a_1{X}^{n_0+k-1}+\cdots +a_{n_0+k})-(X^{n_0}-(a_1{X}^{n_0}+\cdots +a_{n_0}))$$est appelé polynôme de Parry. Nous montrons qu’il existe un ensemble relativement dense d’entiers $n$ tels que le polynôme minimal de ${\beta }^n$ est égal à son polynôme...

We establish that for a fairly general class of topologically transitive dynamical systems, the set of non-transitive points is very small when the rate of transitivity is very high. The notion of smallness that we consider here is that of σ-porosity, and in particular we show that the set of non-transitive points is σ-porous for any subshift that is a factor of a transitive subshift of finite type, and for the tent map of [0,1]. The result extends to some finite-to-one factor systems. We also show...

Although Sarnak's conjecture holds for compact group rotations (irrational rotations, odometers), it is not even known whether it holds for all Jewett-Krieger models of such rotations. In this paper we show that it does, as long as the model is at the same a topological extension, via the same map that establishes the isomorphism, of an equicontinuous model. In particular, we recover (after [AKL]) that regular Toeplitz systems satisfy Sarnak's conjecture, and, as another consequence, so do...

The joint spectral radius of a finite set of real $d\times d$ matrices is defined to be the maximum possible exponential rate of growth of products of matrices drawn from that set. In previous work with K. G. Hare and J. Theys we showed that for a certain one-parameter family of pairs of matrices, this maximum possible rate of growth is attained along Sturmian sequences with a certain characteristic ratio which depends continuously upon the parameter. In this note we answer some open questions from that paper...

Let $\beta \>1$ be an algebraic number. We study the strings of zeros (“gaps”) in the Rényi $\beta$-expansion  $d_{\beta }\left(1\right)$ of unity which controls the set ${\mathbb{Z}}_{\beta }$ of $\beta$-integers. Using a version of Liouville’s inequality which extends Mahler’s and Güting’s approximation theorems, the strings of zeros in $d_{\beta }\left(1\right)$ are shown to exhibit a “gappiness” asymptotically bounded above by  $log\left(\mathrm{M}\right(\beta \left)\right)/log\left(\beta \right)$, where  $\mathrm{M}\left(\beta \right)$  is the Mahler measure of  $\beta$. The proof of this result provides in a natural way a new classification of algebraic numbers $\>1$ with classes called Q...

Two linear numeration systems, with characteristic polynomial equal to the minimal polynomial of two Pisot numbers $\beta$ and $\gamma$ respectively, such that $\beta$ and $\gamma$ are multiplicatively dependent, are considered. It is shown that the conversion between one system and the other one is computable by a finite automaton. We also define a sequence of integers which is equal to the number of periodic points of a sofic dynamical system associated with some Parry number.

Two linear numeration systems, with characteristic polynomial equal to the minimal polynomial of two Pisot numbers β and γ respectively, such that β and γ are multiplicatively dependent, are considered. It is shown that the conversion between one system and the other one is computable by a finite automaton. We also define a sequence of integers which is equal to the number of periodic points of a sofic dynamical system associated with some Parry number.

We compare four different notions of chaos in zero-dimensional systems (subshifts). We provide examples showing that in that case positive topological entropy does not imply strong chaos, strong chaos does not imply complicated dynamics at all, and ω-chaos does not imply Li-Yorke chaos.

Sturmian words are infinite words that have exactly n+1 factors of length n for every positive integer n. A Sturmian word sα,p is also defined as a coding over a two-letter alphabet of the orbit of point ρ under the action of the irrational rotation Rα : x → x + α (mod 1). A substitution fixes a Sturmian word if and only if it is invertible. The main object of the present paper is to investigate Rauzy fractals associated with two-letter invertible substitutions. As an application, we give...

We trace the beginning of symbolic dynamics-the study of the shift dynamical system-as it arose from the use of coding to study recurrence and transitivity of geodesics. It is our assertion that neither Hadamard's 1898 paper, nor the Morse-Hedlund papers of 1938 and 1940, which are normally cited as the first instances of symbolic dynamics, truly present the abstract point of view associated with the subject today. Based in part on the evidence of a 1941 letter from Hedlund to Morse, we place the...

For each $m\ge 2,$ we consider the $m$-bonacci numbers defined by $F_k=2^k$ for $0\le k\le m-1$ and $F_k=F_{k-1}+F_{k-2}+\cdots +F_{k-m}$ for $k\ge m.$ When $m=2,$ these are the usual Fibonacci numbers. Every positive integer $n$ may be expressed as a sum of distinct $m$-bonacci numbers in one or more different ways. Let $R_m\left(n\right)$ be the number of partitions of $n$ as a sum of distinct $m$-bonacci numbers. Using a theorem of Fine and Wilf, we obtain a formula for $R_m\left(n\right)$ involving sums of binomial coefficients modulo $2.$ In addition we show that this formula may be used to determine the number of partitions...