A local limit theorem with speed of convergence for Euclidean algorithms and Diophantine costs

DOI10.1214/07-AIHP140zbMath1231.37015arXivmath/0604341OpenAlexW3101414622MaRDI QIDQ731697

Viviane Baladi, Aïcha Hachemi

Publication date: 8 October 2009

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0604341

zbMATH Keywords

continued fractionEuclidean algorithmslocal limit theoremtransfer operatorspeed of convergenceDiophantine condition

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Central limit and other weak theorems (60F05) Number-theoretic algorithms; complexity (11Y16) Functional analytic techniques in dynamical systems; zeta functions, (Ruelle-Frobenius) transfer operators, etc. (37C30)

Related Items (4)

A note on ``Euclidean algorithms are Gaussian by V. Baladi and B. Vallée ⋮ Superpolynomial and polynomial mixing for semiflows and flows ⋮ Limit laws for rational continued fractions and value distribution of quantum modular forms ⋮ Alternative proofs of linear response for piecewise expanding unimodal maps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the rate of mixing of Axiom A flows
• On decay of correlations in Anosov flows
• Euclidean algorithms are Gaussian
• Diophantine approximations and local limit theorem in \(\mathbb R^d\)
• Remainder term estimates of the renewal function
• Euclidean dynamics
• Berry--Esseen theorem and local limit theorem for non uniformly expanding maps
• Local limit theorems and equidistribution of random walks on the Heisenberg group
• Analytic continuation of a dynamical zeta function under a Diophantine condition
• Rapid decay of correlations for nonuniformly hyperbolic flows
• Prevalence of rapid mixing in hyperbolic flows
• Un théorème de la limite locale pour des algorithmes Euclidiens
• A local limit theorem for closed geodesics and homology
• Asymptotic winding of the geodesic flow on modular surfaces and continuous fractions
• The number of steps in the Euclidean algorithm
• Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems

This page was built for publication: A local limit theorem with speed of convergence for Euclidean algorithms and Diophantine costs