On some symmetric multidimensional continued fraction algorithms
From MaRDI portal
Publication:3176213
DOI10.1017/ETDS.2016.112zbMATH Open1403.37089arXiv1508.07814OpenAlexW2262768638MaRDI QIDQ3176213FDOQ3176213
Authors:
Publication date: 19 July 2018
Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)
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 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 that it is of positive measure.
Full work available at URL: https://arxiv.org/abs/1508.07814
Recommendations
Cites Work
- Gauss measures for transformations on the space of interval exchange maps
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exposants caractéristiques de l'algorithme de Jacobi-Perron et de la transformation associée. (Characteristic exponents of the Jacobi-Perron algorithm and of the associated map)
- Natural extensions and entropy of \(\alpha \)-continued fractions
- Mesures de Gauss pour des algorithmes de fractions continues multidimensionnelles
- Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
- The Rauzy gasket
- Continued fractions and the \(d\)-dimensional Gauss transformation
Cited In (34)
- \(S\)-adic sequences: a bridge between dynamics, arithmetic, and geometry
- Brun meets Selmer
- Linear-fractional invariance of the simplex-module algorithm for expanding algebraic numbers in multidimensional continued fractions
- Analysis of performance of symmetric second-order line search algorithms through continued fractions
- The Slow Continued Fraction Algorithm Via 2 × 2 Integer Matrices
- Some dynamic properties of the modified negative slope algorithm
- A multidimensional continued fraction and some of its statistical properties
- Title not available (Why is that?)
- Calculations of the invariant measure for Hurwitz continued fractions
- Title not available (Why is that?)
- A local algorithm for constructing derived tilings of the two-dimensional torus
- Periodic karyon expansions of algebraic units in multidimensional continued fractions
- Title not available (Why is that?)
- An algorithm for constructing multidimensional continued fractions and linear dependence of numbers
- Localized Pisot matrices and joint approximations of algebraic numbers
- Multi-Continued Fraction Algorithms and Their Applications to Sequences
- Rational approximations, multidimensional continued fractions, and lattice reduction
- On the second Lyapunov exponent of some multidimensional continued fraction algorithms
- Multidimensional continued fractions and symbolic codings of toral translations
- Generalizations of Sturmian sequences associated with \(\boldsymbol{N}\)-continued fraction algorithms
- Some ergodic properties of the negative slope algorithm
- Simplex-karyon algorithm of multidimensional continued fraction expansion
- Simplicity of spectra for certain multidimensional continued fraction algorithms
- Symbolic coding of linear complexity for generic translations on the torus, using continued fractions
- The karyon algorithm for expansion in multidimensional continued fractions
- Multidimensional Euclidean algorithms, numeration and substitutions
- Commensurable continued fractions
- Almost everywhere balanced sequences of complexity \(2n + 1\)
- Linear-fractional invariance of multidimensional continued fractions
- On the dimension group of unimodular \(\mathcal{S}\)-adic subshifts
- Invariant measures for continued fraction algorithms with finitely many digits
- Convergence and factor complexity for the Arnoux-Rauzy-Poincaré algorithm
- The best approximation of algebraic numbers by multidimensional continued fractions
- \(S\)-expansions in dimension two
This page was built for publication: On some symmetric multidimensional continued fraction algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176213)