A strengthening of a theorem of Bourgain-Kontorovich-III

We investigate some Diophantine approximation constants related to the simultaneous approximation of $(\zeta,\zeta^{2},\ldots,\zeta^{k})$ for Liouville numbers $\zeta$. For a certain class of Liouville numbers including the famous representative $\sum_{n\geq 1} 10^{-n!}$ and numbers in the Cantor set, we explicitly determine all approximation constants simultaneously for all $k\geq 1$.

We establish new combinatorial transcendence criteria for continued fraction expansions. Let $\alpha = [0; a_1, a_2,...]$ be an algebraic number of degree at least three. One of our criteria implies that the sequence of partial quotients $(a_{\ell})_{\ell \ge 1}$ of $\alpha$ cannot be generated by a finite automaton, and that the complexity function of $(a_{\ell})_{\ell \ge 1}$ cannot increase too slowly.

For a given positive integer $m$, let $A=\set{0,1,...,m}$ and $q \in (m,m+1)$. A sequence $(c_i)=c_1c_2 ...$ consisting of elements in $A$ is called an expansion of $x$ if $\sum_{i=1}^{\infty} c_i q^{-i}=x$. It is known that almost every $x$ belonging to the interval $[0,m/(q-1)]$ has uncountably many expansions. In this paper we study the existence of expansions $(d_i)$ of $x$ satisfying the inequalities $\sum_{i=1}^n d_iq^{-i} \geq \sum_{i=1}^n c_i q^{-i}$, $n=1,2,...$ for ...

A continued fraction algorithm allows to represent numbers in a way that is particularly valuable if one wants to approximate irrational numbers by rationals. Some of these algorithms are simple in the sense that the possible representations can be characterized in an easy way. For instance, for the classical continued fraction algorithm each infinite string of positive integer digits (called partial quotients in this setting) can occur. For complex continued fraction algorit...

In this paper, we study distributional properties of the sequence of partial quotients in the continued fraction expansion of fractions $a/N$, where $N$ is fixed and $a$ runs through the set of mod $N$ residue classes which are coprime with $N$. Our methods cover statistics such as the sum of partial quotients, the maximal partial quotient, the empirical distribution of partial quotients, Dedekind sums, and much more. We prove a sharp concentration inequality for the sum of p...

By a classical result of Gauss and Kuzmin, the continued fraction expansion of a ``random'' real number contains each digit $a\in\mathbb{N}$ with asymptotic frequency $\log_2(1+1/(a(a+2)))$. We generalize this result in two directions: First, for certain sets $A\subset\mathbb{N}$, we establish simple explicit formulas for the frequency with which the continued fraction expansion of a random real number contains a digit from the set $A$. For example, we show that digits of t...

In this paper we give a detailed measure theoretical analysis of what we call sum-level sets for regular continued fraction expansions. The first main result is to settle a recent conjecture of Fiala and Kleban, which asserts that the Lebesgue measure of these level sets decays to zero, for the level tending to infinity. The second and third main result then give precise asymptotic estimates for this decay. The proofs of these results are based on recent progress in infinite ...

Let $K$ be a number field. We show that, up to allowing a finite set of denominators in the partial quotients, it is possible to define algorithms for $\mathfrak P$-adic continued fractions satisfying the finiteness property on $K$ for every prime ideal $\mathfrak P$ of sufficiently large norm. This provides, in particular, a new algorithmic approach to the construction of division chains in number fields.

The continued fraction expansion of an irrational number $\alpha$ is eventually periodic if and only if $\alpha$ is a quadratic irrationality. However, very little is known regarding the size of the partial quotients of algebraic real numbers of degree at least three. Because of some numerical evidence and a belief that these numbers behave like most numbers in this respect, it is often conjectured that their partial quotients form an unbounded sequence. More modestly, we may...

In the present article, modeling certain rational numbers, that are represented in terms of Cantor series, are described. The statements on relations between digits in the representations of rational numbers by Cantor series (for the case of an arbitrary sequence $(q_k)$) are proved.