相关论文: Diophantine approximation by negative continued fr…

Let Q be an infinite set of positive integers. Denote by W_{\tau, n}(Q) (resp. W_{\tau, n}) the set of points in dimension n simultaneously \tau--approximable by infinitely many rationals with denominators in Q (resp. in N*). A non--trivial…

We establish sharp bounds for the Hausdorff dimension of sets of irrational numbers in $(0,1)$ whose digits in the $N$-expansion are either uniformly bounded or tend to infinity. For sets with digits bounded by an integer $M \ge N$, we…

In the paper we provide measure estimates for the set of numbers whose sequence of products of continued fraction partial quotients $M_n = a_1 \ldots a_n$ has exponential growth with rate close to the one predicted by Khintchine's theorem,…

For an invariant probability measure for the Gauss map, almost all numbers are Diophantine if the log of the partial quotient function is integrable. We show that with respect to a ``continued fraction mixing'' measure for the Gauss map…

Let $[a_1(x),a_2(x), a_3(x),\cdots]$ denote the continued fraction expansion of a real number $x \in [0,1)$. This paper is concerned with certain exceptional sets of the Borel-Bernstein Theorem on the growth rate of $\{a_n(x)\}_{n\geq1}$.…

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:…

We prove a quantitative distortion theorem for iterated function systems that generate sets of continued fractions. As a consequence, we obtain upper and lower bounds on the Hausdorff dimension of any set of real or complex continued…

For an infinite iterated function system $\mathbf{f}$ on $[0,1]$ with an attractor $\Lambda(\mathbf{f})$ and for an infinite subset $D\subseteq \mathbb{N}$, consider the set \[ \mathbb E(\mathbf{f},D)= \{ x \in \Lambda(\mathbf{f}):…

This paper is concerned with the study of diagonal Diophantine inequalities of fractional degree $ \theta ,$ where $ \theta >2$ is real and non-integral. For fixed non-zero real numbers $ \lambda_i $ not all of the same sign we write…

The continuous version of a fundamental result of Khinchin says that a half-infinite torus line in the unit square $[0,1]^2$ exhibits superdensity, which is a best form of time-quantitative density, if and only if the slope of the geodesic…

We prove new quantitative Schmidt-type theorem for Diophantine approximations with restraint denominators on fractals (more precisely, on $M_0$-sets). Our theorems introduce a sharp balance condition between the growth rate of the sequence…

Let $F_{n}$ be the $n$-th Fibonacci number. Put $\varphi=\frac{1+\sqrt5}{2}$. We prove that the following inequalities hold for any real $\alpha$: 1) $\inf_{n \in \mathbb N} ||F_n\alpha||\le\frac{\varphi-1}{\varphi+2}$, 2) $\liminf_{n\to…

Given $n\in N$ and $x,\gamma\in R$, let \begin{equation*} ||\gamma-nx||^\prime=\min\{|\gamma-nx+m|:m\in Z, \gcd (n,m)=1\}, \end{equation*} %where $(n,m)$ is the largest common divisor of $n$ and $m$. Two conjectures in the coprime…

Inspired by a problem proposed by Mahler, we will address the following related question, 'How well can irrationals in a missing digit set be approximated by rationals with polynomial denominators?' and prove some related results. To…

Zaremba's conjecture concerns a formation of continued fraction expansions for rational numbers with partial quotient bounded by an absolute constant. We present asymptotic estimates for the size of $\epsilon$-thickening of certain fractal…

This paper concerns extension of the classical Lagrange theorem, on the eventual periodicity of continued fraction expansions of quadratic surds, and the versions of it found in the literature in the case of complex numbers. In this…

For uniformly chosen random $\alpha \in [0,1]$, it is known the probability the $n^{\rm th}$ digit of the continued-fraction expansion, $[\alpha]_n$ converges to the Gauss-Kuzmin distribution $\mathbb{P}([\alpha]_n = k) \approx \log_2 (1 +…

For large $N$, we consider the ordinary continued fraction of $x=p/q$ with $1\le p\le q\le N$, or, equivalently, Euclid's gcd algorithm for two integers $1\le p\le q\le N$, putting the uniform distribution on the set of $p$ and $q$s. We…

We establish a central limit theorem for counting large continued fraction digits $(a_n)$, i.e. we count occurrences $\{a_n>b_n\}$, where $(b_n)$ is a sequence of positive integers. Our result improves a similar result by Philipp which…

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…