Simplicity of spectra for certain multidimensional continued fraction algorithms (Q2659853)

The authors consider multidimensional continued fraction algorithms that approximate a vector in \(\mathbb{R}^n\) with a vector of rational numbers, whose denominators are uniformly bounded. Especially the triangle sequence and Selmer algorithm are addressed. They prove the simplicity of the Lyapunov spectrum of these algorithms, which implies that the algorithms cannot be optimal. Simplicity means that the Lyapunov exponents (with respect to the absolutely continuous ergodic measure of the algorithms) have multiplicity one. Moreover they conjecture that the same is true for any given linear simplex-splitting multidimensional continued fraction algorithm.