Gauss lattices and complex continued fractions

From MaRDI portal
Publication:2071463



Abstract: Our aim is to find a complex continued fraction algorithm finding all the best Diophantine approximations to a complex number. Using the sequence of minimal vectors in a two dimensional lattice over Gaussian integers, we obtain an algorithm defined on a submanifold of the space of unimodular two dimensional Gauss lattices. This submanifold is transverse to the diagonal flow. Thanks to the correspondence between minimal vectors and best Diophantine approximations, the algorithm finds all the best approximations to a complex number. A byproduct of the algorithm is the best constant for the complex version of Dirichlet Theorem about approximations of complex numbers by quotients of Gaussian integers.


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.











This page was built for publication: Gauss lattices and complex continued fractions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2071463)