We record two remarks on the work of Baladi???Vall??e [J. Number Theory 110 (2005), 331???386]. They proved the asymptotic Gaussian distribution of the length of continued fractions as a random variable on the set of rational numbers whose denominators are less than or equal to a fixed positive integer with uniform probability. We give a direct proof of that result without the smoothing process by applying Perron???s formula with error terms, and further derive an equivalent result on a thinner probability space
Abstract. We obtain a Central Limit Theorem for a general class of addi-tive parameters (costs, obse...
AbstractBy using stochastic dependence with complete connections we obtain some asymptotic formulas ...
AbstractThis paper considers asymptotic expansions of certain expectations which appear in the theor...
AbstractThe paper “Euclidean algorithms are Gaussian” [V. Baladi, B. Vallée, Euclidean algorithm are...
It is conjectured that the length of continued fraction behaves asymptotically like a random variabl...
Two results about the Euclidean algorithm (EA) for Gaussian integers are proven in this paper: first...
International audienceNumbers whose continued fraction expansion contains only small digits have bee...
We provide here a complete average-case analysis of the binary continued fraction representation of ...
fourth revised version - 2 figures - the strict convexity condition used has been clarifiedThis stud...
32 pagesInternational audienceWe study the probabilistic behavior of the continued fraction expansio...
There have been quite a few generalizations of the usual continued fraction expansions over the last...
AbstractWe obtain a central limit theorem for a general class of additive parameters (costs, observa...
AbstractFor certain random variables X1,X2,… which can be expressed by means of the natural extensio...
AbstractThe continued fraction convergents to a random real number are shown to approximate that num...
Basic concepts of simple continued fractions are introduced and some important theorems explored. Th...
Abstract. We obtain a Central Limit Theorem for a general class of addi-tive parameters (costs, obse...
AbstractBy using stochastic dependence with complete connections we obtain some asymptotic formulas ...
AbstractThis paper considers asymptotic expansions of certain expectations which appear in the theor...
AbstractThe paper “Euclidean algorithms are Gaussian” [V. Baladi, B. Vallée, Euclidean algorithm are...
It is conjectured that the length of continued fraction behaves asymptotically like a random variabl...
Two results about the Euclidean algorithm (EA) for Gaussian integers are proven in this paper: first...
International audienceNumbers whose continued fraction expansion contains only small digits have bee...
We provide here a complete average-case analysis of the binary continued fraction representation of ...
fourth revised version - 2 figures - the strict convexity condition used has been clarifiedThis stud...
32 pagesInternational audienceWe study the probabilistic behavior of the continued fraction expansio...
There have been quite a few generalizations of the usual continued fraction expansions over the last...
AbstractWe obtain a central limit theorem for a general class of additive parameters (costs, observa...
AbstractFor certain random variables X1,X2,… which can be expressed by means of the natural extensio...
AbstractThe continued fraction convergents to a random real number are shown to approximate that num...
Basic concepts of simple continued fractions are introduced and some important theorems explored. Th...
Abstract. We obtain a Central Limit Theorem for a general class of addi-tive parameters (costs, obse...
AbstractBy using stochastic dependence with complete connections we obtain some asymptotic formulas ...
AbstractThis paper considers asymptotic expansions of certain expectations which appear in the theor...