Ergodic and Diophantine properties of algorithms of Selmer type
Let be a real number and let be a positive integer. We define four exponents of Diophantine approximation, which complement the exponents and defined by Mahler and Koksma. We calculate their six values when and is a real number whose continued fraction expansion coincides with some Sturmian sequence of positive integers, up to the initial terms. In particular, we obtain the exact exponent of approximation to such a continued fraction by quadratic surds.
On montre que les exposants de Lyapunov de l’algorithme de Jacobi-Perron, en dimension quelconque, sont tous différents et que la somme des exposants extrêmes est strictement positive. En particulier, si , le deuxième exposant est strictement négatif.