Classical homogeneous multidimensional continued fraction algorithms are ergodic

arXiv1302.5008MaRDI QIDQ6239780FDOQ6239780

Jon Chaika, Arnaldo Nogueira

Publication date: 20 February 2013

Abstract: Homogeneous continued fraction algorithms are multidimensional generalizations of the classical Euclidean algorithm, the dissipative map ${\displaystyle }$ (x_1,x_2) in mathbb{R}_+^2 longmapsto left{�egin{array}{ll} (x_1 - x_2, x_2), & mbox{if $x_{1}geq{x}_2$} (x_1, x_2 - x_1), & mbox{otherwise.} end{array} ight. ${\displaystyle }$ We focus on those which act piecewise linearly on finitely many copies of positive cones which we call Rauzy induction type algorithms. In particular, a variation Selmer algorithm belongs to this class. We prove that Rauzy induction type algorithms, as well as Selmer algorithms, are ergodic with respect to Lebesgue measure.

Mathematics Subject Classification ID

Metric theory of other algorithms and expansions; measure and Hausdorff dimension (11K55) Measure-theoretic ergodic theory (28D99)

This page was built for publication: Classical homogeneous multidimensional continued fraction algorithms are ergodic

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