Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-24T03:53:55.099Z Has data issue: false hasContentIssue false

On some symmetric multidimensional continued fraction algorithms

Published online by Cambridge University Press:  24 January 2017

PIERRE ARNOUX
Affiliation:
Equipe Groupes, Dynamique, Arithmétique et Combinatoire, Institut de Mathématique de Marseille, CNRS UMR 7373, Campus de Luminy, Avenue de Luminy, Case 907, 13288 Marseille Cedex 09, France email [email protected]
SÉBASTIEN LABBÉ
Affiliation:
Bât. B37 Institut de Mathématiques, Grande Traverse 12, 4000 Liège, Belgium email [email protected]

Abstract

We compute explicitly the density of the invariant measure for the reverse algorithm which is absolutely continuous with respect to Lebesgue measure, using a method proposed by Arnoux and Nogueira. We also apply the same method on the unsorted version of the Brun algorithm and Cassaigne algorithm. We illustrate some experimentations on the domain of the natural extension of those algorithms. For some other algorithms, which are known to have a unique invariant measure absolutely continuous with respect to Lebesgue measure, the invariant domain found by this method seems to have a fractal boundary, and it is unclear whether it is of positive measure.

Type
Original Article
Copyright
© Cambridge University Press, 2017 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Arnoux, P. and Nogueira, A.. Mesures de Gauss pour des algorithmes de fractions continues multidimensionnelles. Ann. Sci. Éc. Norm. Supér. (4) 26(6) (1993), 645664.CrossRefGoogle Scholar
Arnoux, P. and Starosta, S.. The Rauzy gasket. Further Developments in Fractals and Related Fields (Trends in Mathematics) . Eds. Barral, J. and Seuret, S.. Birkhäuser, Boston, MA, 2013, pp. 123.Google Scholar
Arnoux, P. and Schmidt, T. A.. Natural extensions and Gauss measures for piecewise homographic continued fractions. Preprint, 2016.Google Scholar
Broise-Alamichel, A. and Guivarc’h, Y.. Exposants caractéristiques de l’algorithme de Jacobi–Perron et de la transformation associée. Ann. Inst. Fourier (Grenoble) 51(3) (2001), 565686.Google Scholar
Berthé, V. and Labbé, S.. Factor complexity of S-adic words generated by the Arnoux–Rauzy–Poincaré algorithm. Adv. Appl. Math. 63 (2015), 90130.Google Scholar
Brentjes, A. J.. Multidimensional Continued Fraction Algorithms. Mathematisch Centrum, Amsterdam, 1981.Google Scholar
Hardcastle, D. M. and Khanin, K.. Continued fractions and the d-dimensional Gauss transformation. Comm. Math. Phys. 215(3) (2001), 487515.Google Scholar
Kraaikamp, Cor, Schmidt, T. A. and Steiner, W.. Natural extensions and entropy of 𝛼–continued fractions. Ann. Sci. Éc. Norm. Supér. (4) 25(8) (2012), 22072243.Google Scholar
Schweiger, F.. Multidimensional Continued Fraction. Oxford University Press, New York, 2000.Google Scholar
Veech, W. A.. Gauss measures for transformations on the space of interval exchange maps. Ann. of Math. (2) 115(1) (1982), 201242.Google Scholar