Bias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums

DOI10.1007/s00208-022-02452-2arXiv2206.03214WikidataQ114231103 ScholiaQ114231103MaRDI QIDQ6093611

Paolo Minelli, Marc Technau, Athanasios Sourmelidis

Publication date: 7 September 2023

Published in: Mathematische Annalen (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Continued fractions (11A55) Dedekind eta function, Dedekind sums (11F20) Diophantine inequalities (11J25) Metric theory of continued fractions (11K50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the statistical properties of finite continued fractions
• Mean value of sums of partial quotients of continued fractions
• Statistik der Teilnenner der zu den echten Brüchen gehörigen regelmäßigen Kettenbrüche
• On semi-regular finite continued fractions
• Dynamical analysis of a class of Euclidean algorithms.
• Distribution of lattice points visible from the origin
• Euclidean algorithms are Gaussian
• Modular hyperbolas
• Asymptotic behaviour of the first moment of the number of steps in the by-excess and by-deficiency Euclidean algorithms
• Calculation of the variance in a problem in the theory of continued fractions
• The average length of reduced regular continued fractions
• On a theorem of Heilbronn
• Continued fractions and density results for Dedekind sums.
• On the distribution of Dedekind sums
• A density result for elliptic Dedekind sums
• The average length of finite continued fractions with fixed denominator
• Products of matrices and and the distribution of reduced quadratic irrationals
• Asymptotic behaviour of the first and second moments for the number of steps in the Euclidean algorithm
• A Simple Estimate for the Number of Steps in the Euclidean Algorithm
• The number of steps in the Euclidean algorithm
• The number of steps in the Euclidean algorithm