Related papers: Continued fractions for a class of triangle groups
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…
Most well-known multidimensional continued fractions, including the M\"{o}nkemeyer map and the triangle map, are generated by repeatedly subdividing triangles. This paper constructs a family of multidimensional continued fractions by…
We introduce a random dynamical system related to continued fraction expansions. It uses random combination of the Gauss map and the R\'enyi (or backwards) continued fraction map. We explore the continued fraction expansions that this…
The metrical theory of the product of consecutive partial quotients is associated with the uniform Diophantine approximation, specifically to the improvements to Dirichlet's theorem. Achieving some variant forms of metrical theory in…
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…
Continued fractions have a long history in number theory, especially in the area of Diophantine approximation. The aim of this expository paper is to survey the main results on the theory of $p$--adic continued fractions, i.e. continued…
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,…
The Rosen fractions are an infinite set of continued fraction algorithms, each giving expansions of real numbers in terms of certain algebraic integers. For each, we give a best possible upper bound for the minimum in appropriate…
We give a new proof of Moeckel's result that for any finite index subgroup of the modular group, almost every real number has its regular continued fraction approximants equidistributed into the cusps of the subgroup according to the…
In this work, we study a continued fractions theory for the topological completion of the field of Puiseux series. As usual, we prove that any element in the completion can be developed as a unique continued fractions, whose coefficients…
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…
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…
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.…
For the each of the five Euclidean rings of complex quadratic integers, we consider a complex continued fraction algorithm with digits in the ring. We show for each algorithm that the maximal digit obeys a Fr\'echet distribution. We use…
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…
In this work, we deal with extreme value theory in the context of continued fractions using techniques from probability theory, ergodic theory and real analysis. We give an upper bound for the rate of convergence in the Doeblin-Iosifescu…
In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplication and modular division. The presented algorithms are…
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…
In this paper we provide a rigorous mathematical foundation for continuous approximations of a class of systems with piece-wise continuous functions. By using techniques from the theory of differential inclusions, the underlying piece-wise…
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…