can be applied to a wide class of Markovian multidimensional continued fraction algorithms. As an application we use it for Selmer algorithm in dimension 2 and for the Triangle sequence algorithm and show that these algorithms are not optimal.
Abstract
We introduce a new strategy to prove simplicity of the spectrum of Lyapunov exponents that can be applied to a wide class of Markovian multidimensional continued fraction algorithms. As an application we use it for Selmer algorithm in dimension 2 and for the Triangle sequence algorithm and show that these algorithms are not optimal.