Gauss lattices and complex continued fractions (Q2071463)

In this paper, the author is introducing a complex continued fraction algorithm and discussing questions of best Diophantine approximations in these settings. In particular the author propose the approximation algorithm defined on a submanifold of the space of unimodular two-dimensional Gauss lattices. The correspondence between the minimal vectors used in the construction of the algorithm on the one hand and the best Diophantine approximations on the other hand legitimate the algorithm. Another outpit of the algorithm is the best constant for the complex version of Dirichlet's theorem on complex number approximation as quotients of two Gaussian integers.