On some symmetric multidimensional continued fraction algorithms
From MaRDI portal
Publication:3176213
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3737757 (Why is no real title available?)
- scientific article; zbMATH DE number 1503600 (Why is no real title available?)
- Continued fractions and the \(d\)-dimensional Gauss transformation
- 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)
- Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
- Gauss measures for transformations on the space of interval exchange maps
- Mesures de Gauss pour des algorithmes de fractions continues multidimensionnelles
- Natural extensions and entropy of \(\alpha \)-continued fractions
- The Rauzy gasket
Cited in
(34)- Analysis of performance of symmetric second-order line search algorithms through continued fractions
- Periodic karyon expansions of algebraic units in multidimensional continued fractions
- Almost everywhere balanced sequences of complexity \(2n + 1\)
- A multidimensional continued fraction and some of its statistical properties
- \(S\)-adic sequences: a bridge between dynamics, arithmetic, and geometry
- Simplex-karyon algorithm of multidimensional continued fraction expansion
- Brun meets Selmer
- Rational approximations, multidimensional continued fractions, and lattice reduction
- Multidimensional continued fractions and symbolic codings of toral translations
- Simplicity of spectra for certain multidimensional continued fraction algorithms
- scientific article; zbMATH DE number 6158060 (Why is no real title available?)
- Linear-fractional invariance of the simplex-module algorithm for expanding algebraic numbers in multidimensional continued fractions
- Generalizations of Sturmian sequences associated with \(\boldsymbol{N}\)-continued fraction algorithms
- scientific article; zbMATH DE number 3933172 (Why is no real title available?)
- The best approximation of algebraic numbers by multidimensional continued fractions
- Linear-fractional invariance of multidimensional continued fractions
- scientific article; zbMATH DE number 2020763 (Why is no real title available?)
- On the second Lyapunov exponent of some multidimensional continued fraction algorithms
- Localized Pisot matrices and joint approximations of algebraic numbers
- Calculations of the invariant measure for Hurwitz continued fractions
- Convergence and factor complexity for the Arnoux-Rauzy-Poincaré algorithm
- Some ergodic properties of the negative slope algorithm
- A local algorithm for constructing derived tilings of the two-dimensional torus
- The karyon algorithm for expansion in multidimensional continued fractions
- Invariant measures for continued fraction algorithms with finitely many digits
- On the dimension group of unimodular \(\mathcal{S}\)-adic subshifts
- \(S\)-expansions in dimension two
- Symbolic coding of linear complexity for generic translations on the torus, using continued fractions
- Multidimensional Euclidean algorithms, numeration and substitutions
- An algorithm for constructing multidimensional continued fractions and linear dependence of numbers
- Multi-Continued Fraction Algorithms and Their Applications to Sequences
- Commensurable continued fractions
- Some dynamic properties of the modified negative slope algorithm
- The Slow Continued Fraction Algorithm Via 2 × 2 Integer Matrices
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)
