Ergodicity for \(p\)-adic continued fraction algorithms (Q2040144)

Let \(p\) be a prime number and \(\mathbb{Z}_p\) be the closure of \(\mathbb{Z} \) with respect to the \(p\)-adic topology. A 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 are considered in this paper. The main result of the paper is a result showing that all the transformations in the family are ergodic with respect to the Haar measure. It is proven that those transformations are mixing. The \(m\)-dimensional \(p\)-adic linear fractional transformations are introduced and their basic properties are discussed. \(m\)-dimensional \(p\)-adic continued fractional systems are introduced too. A transformation \(T\) is associated with each system. Several families of examples are given. The ergodicity of transformation \(T\) is proved.