Do you want to publish a course? Click here

Cross sections for geodesic flows and alpha-continued fractions

151   0   0.0 ( 0 )
 Added by Thomas Schmidt
 Publication date 2012
  fields
and research's language is English




Ask ChatGPT about the research

We adjust Arnouxs coding, in terms of regular continued fractions, of the geodesic flow on the modular surface to give a cross section on which the return map is a double cover of the natural extension for the alpha-continued fractions, for each $alpha$ in (0,1]. The argument is sufficiently robust to apply to the Rosen continued fractions and their recently introduced alpha-variants.



rate research

Read More

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 of the maps associated with these algorithms; prove that these natural extensions are in fact conjugate to the first return map of the geodesic flow on a related surface; and, deduce that, up to a conjugacy, almost every real number has an infinite number of common approximants for both algorithms.
232 - Leonhard Euler 2018
This is a translation of Eulers Latin paper De fractionibus continuis observationes into English. In this paper Euler describes his theory of continued fractions. He teaches, how to transform series into continued fractions, solves the Riccati-Differential equation by means of continued fractions and finds many other interesting formulas and results (e.g, the continued fraction for the quotient of two hypergeometric series usually attributed to Gau{ss})
134 - Lulu Fang , Lei Shang 2016
Large and moderate deviation principles are proved for Engel continued fractions, a new type of continued fraction expansion with non-decreasing partial quotients in number theory.
We introduce a notion of $q$-deformed rational numbers and $q$-deformed continued fractions. A $q$-deformed rational is encoded by a triangulation of a polygon and can be computed recursively. The recursive formula is analogous to the $q$-deformed Pascal identitiy for the Gaussian binomial coefficients, but the Pascal triangle is replaced by the Farey graph. The coefficients of the polynomials defining the $q$-rational count quiver subrepresentations of the maximal indecomposable representation of the graph dual to the triangulation. Several other properties, such as total positivity properties, $q$-deformation of the Farey graph, matrix presentations and $q$-continuants are given, as well as a relation to the Jones polynomial of rational knots.
91 - Hiroki Takahasi 2019
We give an exponential upper bound on the probabilitywith which the denominator of the $n$th convergent in the regular continued fraction expansion stays away from the mean $frac{npi^2}{12log2}$. The exponential rate is best possible, given by an analytic function related to the dimension spectrum of Lyapunov exponents for the Gauss transformation.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا