Related papers: Continued fractions in 2-stage euclidean quadratic…
We study quadratic approximations for two families of hyperquadratic continued fractions in the field of Laurent series over a finite field. As the first application, we give the answer to a question of the second author concerning…
A Lagrange Theorem in dimension 2 is proved, for a particular two-dimensional algorithm, with a very natural geometrical definition. Dirichlet-type properties for the convergence of the algorithm are also proved. These properties procced…
In this note, we describe a family of particular algebraic, and nonquadratic, power series over an arbitrary finite field of characteristic 2, having a continued fraction expansion with all partial quotients of degree one. The main purpose…
We give a new algorithm of slow continued fraction expansion related to any real cubic number field as a 2-dimensional version of the Farey map. Using our algorithm, we can find the generators of dual substitutions (so-called tiling…
We give a Euclidean division algorithm for the real quadratic fields $\mathbb{Q}(\sqrt{m})$ for $m \in \{2, 3, 6, 7, 11, 19\}$, with the property that the norm of the remainder depends on the first Euclidean minimum of the field. In each…
In this paper we are interested in the class numbers of a family of real quadratic fields for which the square roots of the discriminants have a known expansion in continued fraction. In particular we prove that $h(D)>1$, with possibly a…
It is known that the continued fraction expansion of a real number is periodic if and only if the number is a quadratic irrational. In an attempt to generalize this phenomenon to other settings, Jun-Ichi Tamura and Shin-Ichi Yasutomi have…
We introduce the notion of matrices graph, defining continued fraction algorithms where the past and the future are almost independent. We provide an algorithm to convert more general algorithms into matrices graphs. We present an algorithm…
This paper continues the author's previous studies on continued fractions and Heron's algorithm, as from his former JMM2017 presentation (see \cite{CF.HA}).\par\medskip Extending the notion of continued fraction to the $p$-adic fields, one…
$p$-adic continued fractions, as an extension of the classical concept of classical continued fractions to the realm of $p$-adic numbers, offering a novel perspective on number representation and approximation. While numerous $p$-adic…
Homogeneous continued fraction algorithms are multidimensional generalizations of the classical Euclidean algorithm, the dissipative map $$ (x_1,x_2) \in \mathbb{R}_+^2 \longmapsto \left\{\begin{array}{ll} (x_1 - x_2, x_2), & \mbox{if $x_1…
When the Euclidean algorithm produces a symmetric sequence of quotients, we give explicit formulas for the remainders that allow the analysis of two families of quadratic forms in the remainders.
The first part of this note is a short introduction on continued fraction expansions for certain algebraic power series. In the last part, as an illustration, we present a family of algebraic continued fractions of degree 4, including a toy…
For any integer $k\ge 1$, we show that there are infinitely many complex quadratic fields whose 2-class groups are cyclic of order $2^k$. The proof combines the circle method with an algebraic criterion for a complex quadratic ideal class…
Let $f(x)$ be a square free quartic polynomial defined over a quadratic field $K$ such that its leading coefficient is a square. If the continued fraction expansion of $\displaystyle \sqrt{f(x)}$ is periodic, then its period $n$ lies in the…
We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…
Multidimensional continued fractions (MCFs) were introduced by Jacobi and Perron in order to generalize the classical continued fractions. In this paper, we propose an introductive fundamental study about MCFs in the field of the $p$--adic…
The list of norm-Euclidean imaginary quadratic fields is known and finite. For each known case, we give a division algorithm that finds a remainder at distance less than the Euclidean minimum of the field.
We give a new class of multidimensional $p$-adic continued fraction algorithms. We propose an algorithm in the class for which we can expect that multidimensional $p$-adic version of Lagrange's Theorem holds.
Given a number field, it is an important question in algorithmic number theory to determine all its subfields. If the search is restricted to abelian subfields, one can try to determine them by using class field theory. For this, it is…