The three-dimensional Poincaré continued fraction algorithm
From MaRDI portal
The author proves that for Lebesgue-almost every line in the three-dimensional Euclidean space, the Poincaré continued fraction algorithm determines a unique vertex. Furthermore, the algorithm is nonergodic, although the Gauss map, defined by the algorithm, has an attractor and is ergodic. Finally, it is shown that the Euclidean algorithm and the horocycle flow are orbit equivalent.
Recommendations
- The Three-Dimensional Gauss Algorithm Is Strongly Convergent Almost Everywhere
- Convergence of continued fraction type algorithms and generators
- A generalization of the Gauss map and some classical theorems on continued fractions
- Structure of three interval exchange transformations. I: An arithmetic study
- Ergodicity for \(p\)-adic continued fraction algorithms
Cites work
- A Metrically Transitive Group Defined by the Modular Groups
- Ergodic properties of some permutation processes
- scientific article; zbMATH DE number 3818044 (Why is no real title available?)
- scientific article; zbMATH DE number 3737757 (Why is no real title available?)
- scientific article; zbMATH DE number 3405257 (Why is no real title available?)
- scientific article; zbMATH DE number 3092634 (Why is no real title available?)
- Interval exchange transformations
- Lectures on number theory. Ed. by Nikolaos Kritikos. Transl. from the German, with some additional material, by William C. Schulz
- Mesures de Gauss pour des algorithmes de fractions continues multidimensionnelles
- On the Parry-Daniels Transformation
- Processes generating permutation expansions
- Ranks and measures
Cited in
(25)- Continued fractions on the Veech surfaces
- The Borel-Bernstein theorem for multidimensional continued fractions
- Simplex-karyon algorithm of multidimensional continued fraction expansion
- Periodic karyon expansions of algebraic units in multidimensional continued fractions
- Orbit distribution on \(\mathbb R^2\) under the natural action of \(\mathrm{SL}(2,\mathbb Z)\)
- Linear-fractional invariance of multidimensional continued fractions
- Linear-fractional invariance of the simplex-module algorithm for expanding algebraic numbers in multidimensional continued fractions
- Localized Pisot matrices and joint approximations of algebraic numbers
- The karyon algorithm for expansion in multidimensional continued fractions
- Analysis of generalized continued fraction algorithms over polynomials
- Almost everywhere balanced sequences of complexity \(2n + 1\)
- The best approximation of algebraic numbers by multidimensional continued fractions
- A local algorithm for constructing derived tilings of the two-dimensional torus
- Ergodic properties of triangle partitions
- A 2-dimensional algorithm related to the Farey-Brocot sequence
- Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
- Exactness of the Euclidean algorithm and of the Rauzy induction on the space of interval exchange transformations
- Lebesgue ergodicity of a dissipative subtractive algorithm
- The mathematical research of William Parry FRS
- 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)
- Absorbing sets of homogeneous subtractive algorithms
- Self-duality of multidimensional continued fractions
- Multidimensional Farey partitions
- The convergence of the generalised Selmer algorithm
- Asymptotics for two-dimensional Farey-Brocot nets
This page was built for publication: The three-dimensional Poincaré continued fraction algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1895086)
