Dynamical analysis of α-Euclidean algorithms
From MaRDI portal
The authors are interested in the complexity of Euclidean division algorithms, where the ratio of the remainder by the divisor must belong to \([\alpha-1,\alpha)\) for some \(\alpha\in [0,1]\). For arbitrary \(\alpha\)'s the dynamical analysis is complicated: the involved dynamical systems are not necessarily Markovian. The tools are Dirichlet series, (Ruelle) transfer operators and Tauberian theorems. Note that reference [24][\textit{B. Vallée}, Theor. Comput. Sci. 297, 447-486 (2003; Zbl 1044.68164)] has now appeared.
Recommendations
Cited in
(15)- Dynamics of the binary Euclidean algorithm: Functional analysis and operators
- Dynamical analysis of a class of Euclidean algorithms.
- Euclidean algorithms are Gaussian
- Euclidean dynamics
- Generalized Brjuno functions associated to \(\alpha \)-continued fractions
- Hausdorff dimensions of perturbations of a conformal iterated function system via thermodynamic formalism
- Recurrence function on Sturmian words: a probabilistic study
- A canonical thickening of Q and the entropy of -continued fraction transformations
- EXPONENTIAL INEQUALITIES AND FUNCTIONAL ESTIMATIONS FOR WEAK DEPENDENT DATA: APPLICATIONS TO DYNAMICAL SYSTEMS
- Un théorème de la limite locale pour des algorithmes Euclidiens
- Tanaka-Ito \(\alpha\)-continued fractions and matching
- Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems
- Rational approximations, multidimensional continued fractions, and lattice reduction
- Inducing contractions of the mother of all continued fractions
- Existence of a limiting distribution for the binary GCD algorithm
This page was built for publication: Dynamical analysis of α-Euclidean algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4799529)