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

奇-奇连分数算法

Odd-odd continued fraction algorithm

Dong Han Kim, Seul Bee Lee, Lingmin Liao

AI总结:

本文提出奇-奇连分数算法,其主收敛子为奇分母奇分子有理数,并证明其与最佳逼近有理数等价。

摘要:

通过使用与Romik映射相关的跳跃变换,我们定义了一种新的连分数算法,称为奇-奇连分数,其主收敛子是具有奇数分母和奇数分子的有理数。此外,证明了无理数的所有最佳逼近有理数(具有奇数分母和奇数分子)均由奇-奇连分数算法的主收敛子给出,反之亦然。

英文摘要:

By using a jump transformation associated to the Romik map, we define a new continued fraction algorithm called odd-odd continued fraction, whose principal convergents are rational numbers of odd denominators and odd numerators. Among others, it is proved that all the best approximating rationals of odd denominators and odd numerators of an irrational number are given by the principal convergents of the odd-odd continued fraction algorithm and vice versa.

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

↑