ﻻ يوجد ملخص باللغة العربية
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 consecutive blocks of approximation coefficients (in the sense of Diophantine approximation by continued fraction convergents). We also obtain metrical results for large blocks of ``bad approximations.
We exhibit a method to use continued fractions in function fields to find new families of hyperelliptic curves over the rationals with given torsion order in their Jacobians. To show the utility of the method, we exhibit a new infinite family of curv
In this article we generalize Borels 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 approximation
We give natural extensions for the alpha-Rosen continued fractions of Dajani et al. for a set of small alpha values by appropriately adding and deleting rectangles from the region of the natural extension for the standard Rosen fractions. It follows that the underlying maps have equal entropy.
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 arbitrarily la
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 extension