Moments for generalized Farey-Brocot partitions (Q1032755)

This work touches multidimensional versions of the algorithm that generate the Brocot sequence. These algorithms are algorithmic generalizations of ordinary continued fractions. In general there are many different ways to define such algorithms. The authors choose two of them in the two-dimensional case to make the analysis of their weak convergence and prove new asymptotic formulas for them.