Related papers: Odd-odd continued fraction algorithm

Given a positive rational number $n/d$ with $d$ odd, its odd greedy expansion starts with the largest odd denominator unit fraction at most $n/d$, adds the largest odd denominator unit fraction so the sum is at most $n/d$, and continues as…

We give continued fraction algorithms for a particular class of Fuchsian triangle groups. In particular, we give an explicit form of each such group that is a subgroup of the Hilbert modular group of its trace field and provide an interval…

In this paper, we improve some transcendence results for $p$--adic continued fractions. In particular, we prove that palindromic and quasi--periodic $p$--adic continued fractions converge either to transcendental numbers or quadratic…

We give an elementary geometric proof using Ford circles that the convergents of the continued fraction expansion of a real number $\alpha$ coincide with the rationals that are best approximations of the second kind of $\alpha$.

Rational approximations to a square root $\sqrt{k}$ can be produced by iterating the transformation $f(x) = (dx+k)/(x+d)$ starting from $\infty$ for any positive integer $d$. We show that these approximations coincide infinitely often with…

The inspiral of two compact objects in gravitational wave astronomy is described by a post-Newtonian expansion in powers of $(v/c)$. In most cases, it is believed that the post-Newtonian expansion is asymptotically divergent. A standard…

Continued fractions have been generalized over the field of $p$-adic numbers, where it is still not known an analogue of the famous Lagrange's Theorem. In general, the periodicity of $p$-adic continued fractions is well studied and…

We describe Gauss-type maps as geometric realizations of certain codes in the monoid of nonnegative matrices in the extended modular group. Each such code, together with an appropriate choice of unimodular intervals in P^1R, determines a…

It is widely believed that the continued fraction expansion of every irrational algebraic number $\alpha$ either is eventually periodic (and we know that this is the case if and only if $\alpha$ is a quadratic irrational), or it contains…

We investigate a collection of orthonormal functions that encodes information about the continued fraction expansion of real numbers. When suitably ordered these functions form a complete system of martingale differences and are a special…

This paper is a sequel to our previous work in which we found a combinatorial realization of continued fractions as quotients of the number of perfect matchings of snake graphs. We show how this realization reflects the convergents of the…

Multidimensional Continued Fraction Algorithms are generalizations of the Euclid algorithm and find iteratively the gcd of two or more numbers. They are defined as linear applications on some subcone of $\mathbb{R}^d$. We consider…

Hurwitz (1887) defined a continued fraction algorithm for complex numbers which is better behaved in many respects than a more "natural" extension of the classical continued fraction algorithm to the complex plane would be. Although 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…

This paper concerns extension of the classical Lagrange theorem, on the eventual periodicity of continued fraction expansions of quadratic surds, and the versions of it found in the literature in the case of complex numbers. In this…

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.

In this paper we propose two proximal gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either…

The problem of developing an arithmetic for continued fractions (in order to perform, e.g., sums and products) does not have a straightforward solution and has been addressed by several authors. In 1972, Gosper provided an algorithm to…

We study perturbations of random dynamical systems whose associated transfer operators admit a uniform spectral gap. We provide a $k^{\text{th}}$-order approximation for the invariant density of the associated random dynamical system. We…

The direct calculation of the Generalized operator entropy proves difficult by the appearance of rational exponents of matrices. The main motivation of this work is to overcome these difficulties and to present a practical and efficient…