scientific article; zbMATH DE number 1059211
From MaRDI portal
Publication:4353524
The 2-dimensional Jacobi-Perron algorithm is generated by the map \[ T (x_1, x_2)= \left({x_2 \over x_1} -k_1, {1\over x_1} -k_2\right), \quad 0<x_1 \leq 1,\;0 \leq x_2 \leq 1,\;k_1= \left[{x_2 \over x_1} \right],\;k_2 =\left[ {1\over x_1} \right]. \] It is shown in this paper that the second Lyapunov exponent for this algorithm is negative. For the entire collection see [Zbl 0868.00042].
Recommendations
Cited in
(12)- Bounds for the traveling salesman paths of two-dimensional modular lattices
- What do continued fractions accomplish?
- \(S\)-expansions in dimension two
- scientific article; zbMATH DE number 12924 (Why is no real title available?)
- scientific article; zbMATH DE number 2063929 (Why is no real title available?)
- scientific article; zbMATH DE number 2065019 (Why is no real title available?)
- scientific article; zbMATH DE number 7049503 (Why is no real title available?)
- Thed-Dimensional Gauss Transformation: Strong Convergence and Lyapunov Exponents
- The Three-Dimensional Gauss Algorithm Is Strongly Convergent Almost Everywhere
- 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)
- The exponent of convergence for 2-dimensional Jacobi-Perron type algorithms
- Rational approximations, multidimensional continued fractions, and lattice reduction
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4353524)