Estimate of the period length of a generalized continued fraction expansion

From MaRDI portal





The author has found a periodic algorithm which corresponds for quadratic (resp. cubic) fields to the continued fraction (resp. Voronoi) algorithm. In the paper under review, he gives an upper bound for the length of the period of his algorithm in the case of a number field of degree \(n\) over \(\mathbb{Q}\) whose unit rank is one: the length is \(O(\sqrt{D} \log^{n-1} D)\), where \(D\) is the absolute value of the discriminant of \(K\), and the \(O\)-constant is explicitly given.











This page was built for publication: Estimate of the period length of a generalized continued fraction expansion

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