On the second Lyapunov exponent of some multidimensional continued fraction algorithms
From MaRDI portal
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.
Recommendations
- Strong convergence of additive Multidimensional Continued Fraction algorithms
- EXPONENTIALLY STRONG CONVERGENCE OF NON-CLASSICAL MULTIDIMENSIONAL CONTINUED FRACTION ALGORITHMS
- Lyapunov exponents for non-classical multidimensional continued fraction algorithms
- On almost everywhere strong convergence of multi-dimensional continued fraction algorithms
- scientific article; zbMATH DE number 2063929
Cites work
- A convergence exponent for multidimensional continued-fraction algorithms
- A multidimensional continued fraction and some of its statistical properties
- A set of sequences of complexity \(2n+1\)
- A simple proof of the exponential convergence of the modified Jacobi–Perron algorithm
- Almost everywhere exponential convergence of the modified Jacobi—Perron algorithm
- Ergodic and Diophantine properties of algorithms of Selmer type
- Ergodic Properties of Linear Dynamical Systems
- Ergodic properties of triangle partitions
- Erratum to: ``The convergence of the generalised Selmer algorithm
- EXPONENTIALLY STRONG CONVERGENCE OF NON-CLASSICAL MULTIDIMENSIONAL CONTINUED FRACTION ALGORITHMS
- 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)
- scientific article; zbMATH DE number 3140585 (Why is no real title available?)
- scientific article; zbMATH DE number 3166320 (Why is no real title available?)
- scientific article; zbMATH DE number 3556191 (Why is no real title available?)
- scientific article; zbMATH DE number 2020763 (Why is no real title available?)
- scientific article; zbMATH DE number 1503600 (Why is no real title available?)
- Lyapunov exponents for non-classical multidimensional continued fraction algorithms
- On almost everywhere exponential convergence of the modified Jacobi-Perron algorithm: a corrected proof
- On almost everywhere strong convergence of multi-dimensional continued fraction algorithms
- On periodic sequences for algebraic numbers
- On some symmetric multidimensional continued fraction algorithms
- On the Hausdorff dimension of the Rauzy gasket
- Selmer's multiplicative algorithm
- Some monoids of Pisot matrices
- Strong convergence of additive Multidimensional Continued Fraction algorithms
- Substitutions in dynamics, arithmetics and combinatorics
- The Brun gcd algorithm in high dimensions is almost always subtractive
- The convergence of the generalised Selmer algorithm
- The Jacobi-Perron algorithm its theory and application
- The metrical theory of Jacobi-Perron algorithm
- The quality of approximation of Brun's algorithm in three dimensions
- The quality of the diophantine approximations found by the Jacobi--Perron algorithm and related algorithms
- The Rauzy gasket
- The Three-Dimensional Gauss Algorithm Is Strongly Convergent Almost Everywhere
- Thed-Dimensional Gauss Transformation: Strong Convergence and Lyapunov Exponents
Cited in
(21)- A convergence exponent for multidimensional continued-fraction algorithms
- Zero measure spectrum for multi-frequency Schrödinger operators
- Almost everywhere balanced sequences of complexity \(2n + 1\)
- Simplicity of spectra for certain multidimensional continued fraction algorithms
- Invariant measures in non-conformal fibered systems with singularities
- Analysis of performance of symmetric second-order line search algorithms through continued fractions
- scientific article; zbMATH DE number 5723823 (Why is no real title available?)
- Lyapunov exponents for non-classical multidimensional continued fraction algorithms
- scientific article; zbMATH DE number 1943139 (Why is no real title available?)
- scientific article; zbMATH DE number 2063929 (Why is no real title available?)
- EXPONENTIALLY STRONG CONVERGENCE OF NON-CLASSICAL MULTIDIMENSIONAL CONTINUED FRACTION ALGORITHMS
- Strong convergence of additive Multidimensional Continued Fraction algorithms
- Multidimensional continued fractions and symbolic codings of toral translations
- Generating new partition identities via a generalized continued fraction algorithm
- On integer partitions and continued fraction type algorithms
- Rational approximations, multidimensional continued fractions, and lattice reduction
- Symbolic coding of linear complexity for generic translations on the torus, using continued fractions
- Exact dimensional measures in deterministic and random systems
- Ergodicity and algebraicity of the fast and slow triangle maps
- Title not available (Why is no real title available?)
- The convergence of the generalised Selmer algorithm
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)
