On the second Lyapunov exponent of some multidimensional continued fraction algorithms

From MaRDI portal
Publication:5145102

DOI10.1090/MCOM/3592zbMATH Open1473.11012arXiv1910.09386OpenAlexW3084118191MaRDI QIDQ5145102FDOQ5145102

Wolfgang Steiner, Valérie Berthé, Jörg M. Thuswaldner

Publication date: 20 January 2021

Published in: Mathematics of Computation (Search for Journal in Brave)

Abstract: We study the strong convergence of certain multidimensional continued fraction algorithms. In particular, in the two-dimensional case, we prove that the second Lyapunov exponent of Selmer's algorithm is negative and bound it away from zero. Moreover, we give heuristic results on several other continued fraction algorithms. Our results indicate that all classical multidimensional continued fraction algorithms cease to be strongly convergent for high dimensions. The only exception seems to be the Arnoux-Rauzy algorithm which, however, is defined only on a set of measure zero.


Full work available at URL: https://arxiv.org/abs/1910.09386





Cites Work


Cited In (15)






This page was built for publication: On the second Lyapunov exponent of some multidimensional continued fraction algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145102)