当前位置:
X-MOL 学术
›
Indag. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Ergodicity for p-adic continued fraction algorithms
Indagationes Mathematicae ( IF 0.5 ) Pub Date : 2021-04-15 , DOI: 10.1016/j.indag.2021.04.001 Hui Rao , Shin-ichi Yasutomi
中文翻译:
遍历为 -adic 连分数算法
更新日期:2021-04-15
Indagationes Mathematicae ( IF 0.5 ) Pub Date : 2021-04-15 , DOI: 10.1016/j.indag.2021.04.001 Hui Rao , Shin-ichi Yasutomi
Following Schweiger’s generalization of multidimensional continued fraction algorithms, we consider a very large family of -adic multidimensional continued fraction algorithms, which include Schneider’s algorithm, Ruban’s algorithms, and the -adic Jacobi–Perron algorithm as special cases. The main result is to show that all the transformations in the family are ergodic with respect to the Haar measure.
中文翻译:
遍历为 -adic 连分数算法
遵循 Schweiger 对多维连分数算法的推广,我们考虑了一个非常大的家族 -adic 多维连分数算法,包括 Schneider 算法、Ruban 算法和 -adic Jacobi-Perron 算法作为特例。主要结果是表明,关于 Haar 测度,族中的所有变换都是遍历的。