Related papers: Continued fractions in 2-stage euclidean quadratic…
Computation of the extended gcd of two quadratic integers. The ring of integers considered is principal but could be euclidean or not euclidean ring. This method rely on principal ideal ring and reduction of binary quadratic forms.
We investigate the number of steps taken by three variants of the Euclidean algorithm on average over Farey fractions. We show asymptotic formulae for these averages restricted to the interval $(0,1/2)$, establishing that they behave…
The goal is to obtain an asymptotic formula for the number of quadratic extensions with bounded discriminant of a some quadratic number field with odd class number. This extends an already known result for Q.
We introduced a new continued fraction expansions in our previous paper. For these expansions, we show formulae of probability about incomplete quotients. Furthermore, we prove the existence of invariant measures with respect to the…
We study a new connection between multidimensional continued fractions, such as Jacobi--Perron algorithm, and additively indecomposable integers in totally real cubic number fields. First, we find the indecomposables of all signatures in…
The continue fractions of quadratic surds are periodic, according to a theorem by Lagrange. Their periods may have differing types of symmetries. This work relates these types of symmetries to the symmetries of the classes of the…
Continued fractions have been introduced in the field of $p$--adic numbers $\mathbb{Q}_p$ by several authors. However, a standard definition is still missing since all the proposed algorithms are not able to replicate all the properties of…
Adolf Hurwitz proposed in 1887 a continued fraction algorithm for complex numbers: Hurwitz continued fractions (HCF). Among other similarities between HCF and regular continued fractions, quadratic irrational numbers over $\mathbb{Q}(i)$…
Jordan Normal Forms serve as excellent representatives of conjugacy classes of matrices over closed fields. Once we knows normal forms, we can compute functions of matrices, their main invariant, etc. The situation is much more complicated…
We classify all quadratic imaginary number fields that have a Euclidean ideal class. There are seven of them, they are of class number at most two, and in each case the unique class that generates the class-group is moreover norm-Euclidean.
We study arithmetic progressions of squares over quadratic extensions of number fields. Using a method inspired by an approach of Mordell, we characterize such progressions as quadratic points on a genus $5$ curve. Specifically, we…
We investigate the efficiency of several types of continued fraction expansions of a number in the unit interval using a generalization of Lochs theorem from 1964. Thus, we aimed to compare the efficiency by describing the rate at which the…
Quadratic irrationals posses a periodic continued fraction expansion. Much less is known about cubic irrationals. We do not even know if the partial quotients are bounded, even though extensive computations suggest they might follow…
The classical continued fraction is generalized for studying the rational approximation problem on multi-formal Laurent series in this paper, the construction is called m-continued fraction. It is proved that the approximants of an…
We consider a special class of periodic continued fractions (called alpha-fractions) and discuss the related algebraic and geometric problems. A classical description of the Jacobi variety of a hyperelliptic curve due to Jacobi naturally…
Gosper developed an algorithm for performing arithmetic on continued fractions (CFs), and introduced continued logarithms (CLs) as a variant of continued fractions better suited to representing extremely large (or small) numbers. CLs are…
In this paper we study a continuity of the "values" of modular functions at the real quadratic numbers which are defined in terms of their cycle integrals along the associated closed geodesics. Our main theorem reveals a more finer…
In this article we give, for the fist time the solution of the general difference equation of 2-degree. We also give as application the expansion of a continued fraction into series, which was first proved, found in the past by the author.
For uniformly chosen random $\alpha \in [0,1]$, it is known the probability the $n^{\rm th}$ digit of the continued-fraction expansion, $[\alpha]_n$ converges to the Gauss-Kuzmin distribution $\mathbb{P}([\alpha]_n = k) \approx \log_2 (1 +…
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…