arXiv · 2009.11041
Ergodicity for $p$-adic continued fraction algorithms
Abstract
Following Schweiger's generalization of multidimensional continued fraction algorithms, we consider a very large family of $p$-adic multidimensional continued fraction algorithms, which include Schneider's algorithm, Ruban's algorithms, and the $p$-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.
Explore related subjects
Keep this discovery
Hui Rao, Shin-ichi Yasutomi. 2020-09-23. Ergodicity for $p$-adic continued fraction algorithms. https://arxiv.org/abs/2009.11041
Cite the original work for its findings. Save a collection to share your selection of sources.