Une application des nombres de Pisot à l'algorithme de Jacobi-Perron

SinceO. Perron introduced in 1907 Jacobi-Perron algorithm, which is the simplest generalization of continued fractions to finite sets of real numbers, the main question of characterising the periodicity is still open. The usual conjecture is that the development of any basis of a real number field by this algorithm is periodic. But we only know some infinite families for which this is true. In this paper we prove that for any real number field there exists a basis for which we have periodicity.