arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2301.00441math.NT
收藏

关于Dedekind和的受限平均

On restricted averages of Dedekind sums

Paolo Minelli, Athanasios Sourmelidis, Marc Technau

AI总结:

本文研究固定$α\leq 1/2$时特定有理数集合上Dedekind和的平均值,将先前$α=1/2$的渐近结果扩展至所有固定有理数及几乎所有无理数$α$,并量化了by-excess Euclidean算法运行时间渐近式第二项的偏差。

摘要:

我们研究固定$α\leq 1/2$时,有理数集合$$\mathscr{F}_α(Q):=\{\\, {v}/{w}\in \mathbb{Q}: 0<w\leq Q\\,\}\cap [0, α)$$上Dedekind和的平均值。在先前工作中,我们获得了$α=1/2$时的渐近式,以定量形式证实了Ito的猜想。本文将先前结果扩展,首先至所有固定有理数$α$,然后至几乎所有无理数$α$。作为中间步骤,我们得到了一个结果,量化了by-excess Euclidean算法平均运行时间渐近式第二项中出现的偏差,这具有独立意义。

英文摘要:

We investigate the averages of Dedekind sums over rational numbers in the set $$\mathscr{F}_α(Q):=\{\, {v}/{w}\in \mathbb{Q}: 0<w\leq Q\,\}\cap [0, α)$$ for fixed $α\leq 1/2$. In previous work, we obtained asymptotics for $α=1/2$, confirming a conjecture of Ito in a quantitative form. In the present article we extend our former results, first to all fixed rational $α$ and then to almost all irrational $α$. As an intermediate step we obtain a result quantifying the bias occurring in the second term of the asymptotic for the average running time of the \textit{by-excess} Euclidean algorithm, which is of independent interest.

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

↑