Continued fractions over non-Euclidean imaginary quadratic rings (Q2109423)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Continued fractions over non-Euclidean imaginary quadratic rings
scientific article

    Statements

    Continued fractions over non-Euclidean imaginary quadratic rings (English)
    0 references
    0 references
    21 December 2022
    0 references
    Let \(\mathbb{Z}[i]\) be a Gaussian ring. Hurwitz proposed an approximation algorithm for any complex number by a complex continued fraction where coefficients \(a_n, b_n \in\mathbb{Z}[i]\). Many properties possessed by this algorithm over \(\mathbb{Z}\) still hold over \(\mathbb{Z}[i]\). But the application of continued fractions over imaginary quadratic fields is restricted when discriminant \(\Delta=-3, -7,-8, -11\). An algorithm with a similar structure to that of Hurwitz is investigated in the paper for the arbitrary imaginary quadratic field. The novelty of the algorithm is that there is no restriction to the five Euclidean cases. Many characteristic properties of classical continued fractions are preserved. Continued fractions are exponential convergent and had placed the quality of the best-second approximation (up to a constant). The quadratic irrational expansions are periodic.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    continued fractions
    0 references
    Euclidean
    0 references
    Diophantine approximation
    0 references
    imaginary quadratic
    0 references
    nearest integer algorithm
    0 references
    0 references
    0 references