Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems

DOI10.5802/jtnb.296zbMath0973.11079OpenAlexW2017360635MaRDI QIDQ5939726

Brigitte Vallée

Publication date: 30 July 2001

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=JTNB_2000__12_2_531_0

zbMATH Keywords

complexitydynamical systemsDirichlet seriesTauberian theoremstransfer operatorsergodic theorybinary algorithmbit-complexitycomplexity of continued fraction expansionsEuclidean algorithmsgcdJacobi symbolssubtractive algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Metric theory of other algorithms and expansions; measure and Hausdorff dimension (11K55) Continued fraction calculations (number-theoretic aspects) (11Y65) Metric theory of continued fractions (11K50) Zeta and (L)-functions: analytic theory (11M99) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99)

Related Items (11)

Rational complexity of binary sequences, F\(\mathbb{Q}\)SRs, and pseudo-ultrametric continued fractions in \(\mathbb{R}\) ⋮ Limit laws for rational continued fractions and value distribution of quantum modular forms ⋮ Small quotients in Euclidean algorithms ⋮ Fine costs for Euclid's algorithm on polynomials and Farey maps ⋮ Gaussian laws for the main parameters of the Euclid algorithms ⋮ Size and path length of Patricia tries: Dynamical sources context ⋮ Euclidean algorithms are Gaussian ⋮ A local limit theorem with speed of convergence for Euclidean algorithms and Diophantine costs ⋮ Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms ⋮ Gaussian behavior of quadratic irrationals ⋮ EXPONENTIAL INEQUALITIES AND FUNCTIONAL ESTIMATIONS FOR WEAK DEPENDENT DATA: APPLICATIONS TO DYNAMICAL SYSTEMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Continued fraction algorithms, functional operators, and structure constants
• Dynamics of continued fractions with periodic constraints
• Dynamics of the binary Euclidean algorithm: Functional analysis and operators
• Composition operators and classical function theory
• Dynamical analysis of a class of Euclidean algorithms.
• La théorie de Fredholm
• Distribution of Lévy constants for quadratic numbers
• Universal codeword sets and representations of the integers
• Analysis of the subtractive algorithm for greatest common divisors
• On a $\zeta$ function related to the continued fraction transformation
• Über die mittlere Schrittanzahl bei Divisionsalgorithmen
• Dynamical Zeta Functions for Piecewise Monotone Maps of the Interval
• An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction
• On the theorem of Gauss-Kusmin-Lévy and a Frobenius-type theorem for function spaces
• Analytic analysis of algorithms
• Généralisation du théorème de Ikehara
• Produits tensoriels topologiques et espaces nucléaires
• The number of steps in the Euclidean algorithm
• The number of steps in the Euclidean algorithm

This page was built for publication: Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems