arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2206.03214math.NT
收藏

欧几里得算法的步数偏差与伊藤关于戴德金和的一个猜想

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

Paolo Minelli, Athanasios Sourmelidis, Marc Technau

AI总结:

该研究分析三种欧几里得算法变体在半区间Farey分数上的平均步数偏差,结合连分数与丢番图不等式计数方法,证明了伊藤关于戴德金和值分布的猜想。

摘要:

我们研究了三种欧几里得算法变体在Farey分数(法里分数)上的平均步数。我们推导了这些平均值限制在区间$(0,1/2)$内的渐近公式,证实它们在$(0,1/2)$上的表现与在$(1/2,1)$上不同。这些结果与某些连分数展开的长度分布以及涉及的部分商分布紧密相关。作为应用,我们证明了Ito(伊藤)关于Dedekind sums(戴德金和)值分布的一个猜想。主要论证基于Zhabitskaya、Ustinov、Bykovskiĭ等人的早期工作,最终可追溯到Heilbronn(海尔布隆),该工作将所研究的量与某类丢番图不等式组的解的计数联系起来。上述仅限制于一半Farey分数的条件带来了额外的复杂性。

英文摘要:

We investigate the number of steps taken by three variants of the Euclidean algorithm on average over Farey fractions. We show asymptotic formulae for these averages restricted to the interval $(0,1/2)$, establishing that they behave differently on $(0,1/2)$ than they do on $(1/2,1)$. These results are tightly linked with the distribution of lengths of certain continued fraction expansions as well as the distribution of the involved partial quotients. As an application, we prove a conjecture of Ito on the distribution of values of Dedekind sums. The main argument is based on earlier work of Zhabitskaya, Ustinov, Bykovskiĭ and others, ultimately dating back to Heilbronn, relating the quantities in question to counting solutions to a certain system of Diophantine inequalities. The above restriction to only half of the Farey fractions introduces additional complications.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑