Related papers: Bad approximability, bounded ratios and Diophantin…

A classical result of Kaufman states that, for each $\tau>1,$ the set of well approximable numbers \[ E(\tau)=\{x\in\mathbb{R}: \|qx\| < |q|^{-\tau} \text{ for infinitely many integers q}\} \] is a Salem set with Hausdorff dimension…

We consider products of a i.i.d. sequence in a set $\{f_1,\ldots,f_m\}$ of preserving orientation diffeomorphisms of the circle. we can naturally associate a Lyapunov exponent $\lambda$. Under few assumptions, it is known that $\lambda\leq…

Considering simultaneous approximation to three numbers, we study the geometry of the sequence of best approximations. We provide a sharper lower bound for the ratio between ordinary and uniform exponent of Diophantine approximation,…

Recently Koivusalo, Levesley, Ward and Zhang introduced the set of simultaneously $\Phi$-badly approximable real vectors of $\mathbb{R}^m$ with respect to an approximation function $\Phi$, and determined its Hausdorff dimension for the…

We study the approximability of Max Ones when the number of variable occurrences is bounded by a constant. For conservative constraint languages (i.e., when the unary relations are included) we give a complete classification when the number…

An NP-hard combinatorial optimization problem $\Pi$ is said to have an {\em approximation threshold} if there is some $t$ such that the optimal value of $\Pi$ can be approximated in polynomial time within a ratio of $t$, and it is NP-hard…

We present some new and explicit error bounds for the approximation of distributions. The approximation error is quantified by the maximal density ratio of the distribution $Q$ to be approximated and its proxy $P$. This non-symmetric…

In 1958, Sz\"{u}sz proved an inhomogeneous version of Khintchine's theorem on Diophantine approximation. Sz\"{u}sz's theorem states that for any non-increasing approximation function $\psi:\mathbb{N}\to (0,1/2)$ with $\sum_q \psi(q)=\infty$…

Building on work of Davenport and Schmidt, we mainly prove two results. The first one is a version of Gel'fond's transcendence criterion which provides a sufficient condition for a complex or $p$-adic number $\xi$ to be algebraic in terms…

A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…

We consider the continued fraction expansion of real numbers under the action of a non-uniform lattice in PSL(2,R) and prove metric relations between the convergents and a natural geometric notion of good approximations.

We establish a new connection between metric Diophantine approximation and the parametric geometry of numbers by proving a variational principle facilitating the computation of the Hausdorff and packing dimensions of many sets of interest…

Let $F \subseteq [0,1]$ be a set that supports a probability measure $\mu$ with the property that $ |\widehat{\mu}(t)| \ll (\log |t|)^{-A}$ for some constant $ A > 0 $. Let $\mathcal{A}= (q_n)_{n\in \mathbb{N}} $ be a sequence of natural…

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…

We aim to fill a gap in the proof of an inequality relating two exponents of uniform Diophantine approximation stated in a paper by Bugeaud. We succeed to verify the inequality in several instances, in particular for small dimension.…

Consider the classical problem of rational simultaneous approximation to a point in $\mathbb{R}^{n}$. The optimal lower bound on the gap between the induced ordinary and uniform approximation exponents has been established by Marnat and…

We generalize the construction of Roy's Fibonacci type numbers to the case of a Sturmian recurrence and we determine the classical exponents of approximation $\omega_2(\xi)$, $\widehat{\omega}_2(\xi)$, $\lambda_2(\xi)$,…

The use of Hausdorff measures and dimension in the theory of Diophantine approximation dates back to the 1920s with the theorems of Jarnik and Besicovitch regarding well-approximable and badly-approximable points. In this paper we consider…

We present and study approximate notions of dimensional and margin complexity, which correspond to the minimal dimension or norm of an embedding required to approximate, rather then exactly represent, a given hypothesis class. We show that…

We solve the problem of giving sharp asymptotic bounds on the Hausdorff dimensions of certain sets of badly approximable matrices, thus improving results of Broderick and Kleinbock (preprint 2013) as well as Weil (preprint 2013), and…