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

多位数连分数算法的不变测度

Invariant measures for continued fraction algorithms with finitely many digits

Cor Kraaikamp, Niels Langeveld

摘要:

本文考虑了不同于$[0,1]$的区间上的连分数(CF)展开.对于每个$x$在这样的时间间隔,我们发现一个CF扩展与有限数量的可能的数字。利用自然扩张,在一些例子中得到了不变测度的密度。如果这种方法不起作用,则使用基于高斯-库兹涅茨-列维的近似方法。最后,研究了$N$ -展开的一个子类.特别地,针对$N=2$和$N=36$估计作为参数$α$的函数的熵。从数值结果中可以观察到有趣的行为。

英文摘要:

In this paper we consider continued fraction (CF) expansions on intervals different from $[0,1]$. For every $x$ in such interval we find a CF expansion with a finite number of possible digits. Using the natural extension, the density of the invariant measure is obtained in a number of examples. In case this method does not work, a Gauss-Kuzmin-Lévy based approximation method is used. Finally, a subfamily of the $N$-expansions is studied. In particular, the entropy as a function of a parameter $α$ is estimated for $N=2$ and $N=36$. Interesting behavior can be observed from numerical results.

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

↑