Ergodicity for $p$-adic continued fraction algorithms
Dynamical Systems
2021-06-09 v2
Abstract
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.
Cite
@article{arxiv.2009.11041,
title = {Ergodicity for $p$-adic continued fraction algorithms},
author = {Hui Rao and Shin-ichi Yasutomi},
journal= {arXiv preprint arXiv:2009.11041},
year = {2021}
}
Comments
24 pages