The Complete Analysis of the Binary Euclidean Algorithm

We provide here a complete average-case analysis of the binary continued fraction representation of a random rational whose numerator and denominator are odd and less than N. We analyse the three main parameters of the binary continued fraction expansion, namely the height, the number of steps of the binary Euclidean algorithm, and finally the sum of the exponents of powers of 2 contained in the numerators of the binary continued fraction. The average values of these parameters are shown to be asymptotic to A i log N, and the three constants A i are related to the invariant measure of the Perron-Frobenius operator linked to this dynamical system. The binary Euclidean algorithm has been previously studied in 1976 by Brent who provided a partial analysis of the number of steps, based on a heuristic model and some unproven conjecture. Our methods are quite different, not relying on heuristic hypothesis or conjecture, and more general, since they allow us to study all the parameters of the binary continued fraction expansion.

[1]  Philippe Flajolet,et al.  Continued Fraction Algorithms, Functional Operators, and Structure Constants , 1998, Theor. Comput. Sci..

[2]  H. Heilbronn.  On the Average Length of a Class of Finite Continued Fractions , 1969 .

[3]  Philippe Flajolet,et al.  An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction , 1997, Combinatorics, Probability and Computing.

[4]  Doug Hensley,et al.  The distribution of badly approximable rationals and continuants with bounded digits, II , 1990 .

[5]  Philippe Flajolet,et al.  Analytic Analysis of Algorithms , 1992, ICALP.

[6]  A. Grothendieck,et al.  Produits Tensoriels Topologiques Et Espaces Nucleaires , 1966 .

[7]  Hubert Delange,et al.  Généralisation du théorème de Ikehara , 1954 .

[8]  Leo F. Boron,et al.  Positive solutions of operator equations , 1964 .

[9]  B. Vallée.  Opérateurs de Ruelle-Mayer généralisés et analyse en moyenne des algorithmes d'Euclide et de Gauss , 1997 .

[10]  D. Mayer.  Spectral properties of certain composition operators arising in statistical mechanics , 1979 .

[11]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[12]  Doug Hensley,et al.  The Hausdorff dimensions of some continued fraction cantor sets , 1989 .

[13]  Joel H. Shapiro,et al.  Compact, Nuclear, and Hilbert-Schmidt Composition Operators on H^2 , 1973 .

[14]  Mark Pollicott,et al.  A complex Ruelle-Perron-Frobenius theorem and two counterexamples , 1984, Ergodic Theory and Dynamical Systems.

[15]  Doug Hensley,et al.  Continued fraction Cantor sets, Hausdorff dimension, and functional analysis , 1992 .

[16]  J. H. Shapiro.  Compact composition operators on spaces of boundary-regular holomorphic functions , 1987 .

[17]  A. Grothendieck.  La théorie de Fredholm , 1956 .

[18]  Christian Faivre.  Distribution of Lévy constants for quadratic numbers , 1992 .

[19]  Brigitte Vallée,et al.  Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators , 1998, Algorithmica.

[20]  Philippe Flajolet,et al.  An analysis of the Gaussian algorithm for lattice reduction , 1994, ANTS.

[21]  D. Hensley.  A Polynomial Time Algorithm for the Hausdorff Dimension of Continued Fraction Cantor Sets , 1996 .

[22]  J. Shapiro.  Composition Operators: And Classical Function Theory , 1993 .

[23]  David M. Boyd.  Composition operators on $H^{p}(A)$. , 1976 .

[24]  J. Dixon.  The number of steps in the Euclidean algorithm , 1970 .

[25]  Brigitte Vallée,et al.  Algorithms for Computing Signs of 2×2 Determinants: Dynamics and Average-Case Analysis , 1997, ESA.

[26]  Richard P. Brent.  Analysis of the binary Euclidean algorithm , 1976, SIGS.