Related papers: Tong's spectrum for Rosen continued fractions
The Rosen fractions form an infinite family which generalizes the nearest-integer continued fractions. In this paper we introduce a new class of continued fractions related to the Rosen fractions, the $\alpha$-Rosen fractions. The metrical…
We give the first transcendence results for the Rosen continued fractions. Introduced over half a century ago, these fractions expand real numbers in terms of certain algebraic numbers.
We compare two families of continued fractions algorithms, the symmetrized Rosen algorithm and the Veech algorithm. Each of these algorithms expands real numbers in terms of certain algebraic integers. We give explicit models of the natural…
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…
We prove a central limit theorem for Birkhoff sums of the Rosen continued fraction algorithm. A Lasota-Yorke bound is obtained for general one-dimensional continued fractions with the bounded variation space, which implies quasi-compactness…
In 2004, J.C. Tong found bounds for the approximation quality of a regular continued fraction convergent of a rational number, expressed in bounds for both the previous and next approximation. We sharpen his results with a geometric method…
In this article we generalize Borel's classical approximation results for the regular continued fraction expansion to the alpha-Rosen fraction expansion, using a geometric method. We give a Haas-Series-type result about all possible good…
Our goal is to finally settle the persistent problem in Diophantine Approximation of finding best linear approximates. Classical results from the theory of continued fractions provide the solution for the special homogeneous case in the…
Continued fractions are classical representations of complex objects (for example, real numbers) as sums and inverses of simpler objects (for example, integers). The analogy in linear circuit theory is a chain of series/parallel one-ports:…
We prove a quantitative distortion theorem for iterated function systems that generate sets of continued fractions. As a consequence, we obtain upper and lower bounds on the Hausdorff dimension of any set of real or complex continued…
We introduce here a general framework for studying continued fraction expansions for complex numbers and establish some results on the convergence of the corresponding sequence of convergents. For continued fraction expansions with partial…
In this paper, we introduce telescoping continued fractions to find lower bounds for the error term $r_n$ in Stirling's approximation $\displaystyle n! = \sqrt{2\pi}n^{n+1/2}e^{-n}e^{r_n}.$ This improves lower bounds given earlier by…
We describe various properties of continued fraction expansions of complex numbers in terms of Gaussian integers. Numerous distinct such expansions are possible for a complex number. They can be arrived at through various algorithms, as…
We establish arithmetical properties and provide essential bounds for bi-sequences of approximation coefficients associated with the natural extension of maps, leading to continued fraction-like expansions. These maps are realized as the…
We study the generalized continued fraction expansions of complex numbers in term of elements from Euclidean subrings, especially Gaussian or Eisenstein integers, in a general framework as pursued in [3] and [1]. We introduce a common…
We present several continued fraction algorithms, each of which gives an eventually periodic expansion for every quadratic element of ${\mathbb Q}_p$ over ${\mathbb Q}$ and gives a finite expansion for every rational number. We also give,…
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 study a natural extension to complex numbers of the standard continued fractions. The basic algorithm is due to Lagrange and Gauss, though it seems to have gone mostly unnoticed as a way to create continued fractions. The new…
In this paper we recall some results and some criteria on the convergence of matrix continued fractions. The aim of this paper is to give some properties and results of continued fractions with matrix arguments. Then we give continued…
We first survey the current state of the art concerning the dynamical properties of multidimensional continued fraction algorithms defined dynamically as piecewise fractional maps and compare them with algorithms based on lattice reduction.…