Multidimensional continued fractions and a Minkowski function (Q938319)

Let \[ F(x) = \begin{cases} \frac{x}{1-x} & \text{if } 0 \leq x < \frac{1}{2} \\ \frac{1-x}{x} & \text{if } \frac{1}{2} \leq x \leq 1 \end{cases} \] be the Farey map and let \[ T(x) = \begin{cases} 2 x & \text{if } 0 \leq x < \frac{1}{2} \\ 2 - 2 x & \text{if } \frac{1}{2} \leq x \leq 1 \end{cases} \] be the tent map. The Minkowski question mark function is the unique homeomorphism of \([0, 1]\) that conjugates the Farey map with the tent map, i.e. if \(\Phi\) is the Minkowski question mark function, then \(T \circ \Phi = \Phi \circ F\). The function \(\Phi\) has the following properties {\parindent=6mm \begin{itemize}\item[1)] It is order preserving; \item[2)] It is a bijection between the rational numbers and the dyadic rationals, and it is a bijection between the real algebraic numbers of degree not larger than two and the rationals; \item[3)] It is singular with respect to Lebesgue measure; \item[4)] The graph of \(\Phi\) has some fractal structure. \end{itemize}} The author constructs an \(n\)-dimensional generalization of \(\Phi\), in the sense that he constructs the unique homeomorphism of an \(n\)-simplex that conjugates the Mönkemayer map with a tent map. The Mönkemayer map is the map associated with the Mönkemeyer algorithm of multidimensional continued fraction, also called the Selmer algorithm or the generalized mediant algorithm. The author proves that the properties analog of the properties 1)--2) are still valid, except for the case 2), where only partial results are obtained.