Related papers: Some explicit badly approximable pairs

This paper deals with two main topics related to Diophantine approximation. Firstly, we show that if a point on an algebraic variety is approximable by rational vectors to a sufficiently large degree, the approximating vectors must lie in…

Let $\al$ be an irrational and $\varphi: \N \rightarrow \R^+$ be a function decreasing to zero. For any $\al$ with a given Diophantine type, we show some sharp estimations for the Hausdorff dimension of the set [E_{\varphi}(\al):={y\in \R:…

In this paper, we establish hybrid results on Diophantine approximation with primes from short intervals. In particular, we prove the following result in a slightly modified form: If $\alpha$ is an irrational number having a continued…

In this paper we prove an inequality for individual and uniform Diophantine exponents in the case of simultaneous approximation. This inequality is better than Jarnik's for small values of the uniform exponent.

This paper introduces some methods to determine the simultaneous approximation constants of a class of well approximable numbers $\zeta_{1},\zeta_{2},...,\zeta_{k}$. The approach relies on results on the connection between the set of all…

We prove a strong simultaneous Diophantine approximation theorem for values of additive and multiplicative functions provided that the functions have certain regularity on the primes.

Let (X,d) be a metric space and (\Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of \Omega. Loosely speaking, these consist of points in \Omega…

We study properties of Diophantine exponents of lattices and so-called related "weak" uniform approximations introduced in recent papers by Oleg German, in the simplest two-dimensional case. In contrast to the multidimensional case, in the…

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…

We first propose two conjectural estimates on Diophantine approximation of logarithms of algebraic numbers. Next we discuss the state of the art and we give further partial results on this topic.

This paper collects polynomial Diophantine equations that are simple to state but apparently difficult to solve.

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…

In 1974, M. B. Nathanson proved that every irrational number $\alpha$ represented by a simple continued fraction with infinitely many elements greater than or equal to $k$ is approximable by an infinite number of rational numbers $p/q$…

Fundamental questions in Diophantine approximation are related to the Hausdorff dimension of sets of the form $\{x\in \mathbb{R}: \delta_x = \delta\}$, where $\delta \geq 1$ and $\delta_x$ is the Diophantine approximation rate of an…

We give new examples of pairs composed of a real and a $p$-adic numbers that satisfy a conjecture on simultaneous multiplicative approximation by rational numbers formulated by Einsiedler and Kleinbock in 2007.

A method is suggested for treating the well-known deficiency in the use of Pade approximants that are well suited for approximating rational functions, but confront problems in approximating irrational functions. We develop the approach of…

We obtain some new inequalities between the ordinary and the uniform Diophantine exponents for simultaneous Diophantine approximation to four real numbers.

This paper explores multiple closely related themes: bounding the complexity of Diophantine equations over the integers and developing mathematical proofs in parallel with formal theorem provers. Hilbert's Tenth Problem (H10) asks about the…

We study a combinatorial problem called Minimum Maximal Matching, where we are asked to find in a general graph the smallest that can not be extended. We show that this problem is hard to approximate with a constant smaller than 2, assuming…

Fix an irrational number $\theta$. For a real number $\tau >0$, consider the numbers $y$ satisfying that for all large number $Q$, there exists an integer $1\leq n\leq Q$, such that $\|n\theta-y\|<Q^{-\tau}$, where $\|\cdot\|$ is the…