Related papers: Best Simultaneous Diophantine Approximations under…

We prove sharp estimates in a shrinking target problem for the action of an arbitrary subgroup $\Gamma$ of $SL_2(\mathbb{Z})$ on the 2-torus. This can also be viewed as a non-commutative Diophantine approximation problem. The methods…

In this paper we develop a general theory of metric Diophantine approximation for systems of linear forms. A new notion of `weak non-planarity' of manifolds and more generally measures on the space of $m\times n$ matrices over $\Bbb R$ is…

We discuss the notion of optimal polynomial approximants in multivariable reproducing kernel Hilbert spaces. In particular, we analyze difficulties that arise in the multivariable case which are not present in one variable, for example, a…

The computational complexity of reasoning within the Dempster-Shafer theory of evidence is one of the main points of criticism this formalism has to face. To overcome this difficulty various approximation algorithms have been suggested that…

We use the theory of arithmetic quotients of the Bruhat-Tits tree developed by Serre and others to obtain Dirichlet-style theorems for Diophantine approximation on global function fields. This approach allows us to find sharp values for the…

We give some comments on W.M. Schmidt's theorem on Diophantine approximations with positive integers and our recent results on the topic.

We show the existence of ``good'' approximations to a real number $\gamma$ using rationals with denominators formed by digits $0$ and $1$ in base $b$. We derive an elementary estimate and enhance this result by managing exponential sums.

We give sufficient conditions for two Cantor sets of the line to be nested for a positive set of translation parameters. This problem occurs in diophantine approximations. It also occurs as a toy model of the parameter selection for…

There are abundant results on Diophantine approximation over fields of positive characteristic (see the survey papers [13, 25]), but there is very little information about simultaneous approximation. In this paper, we develop a technique of…

For any $\alpha\in(0,d)$, we construct Cantor sets in $\mathbb{R}^d$ of Hausdorff dimension $\alpha$ such that the associated natural measure $\mu$ obeys the restriction estimate $\| \widehat{f d\mu} \|_{p} \leq C_p \| f \|_{L^2(\mu)}$ for…

In this paper, we prove some new thickness theorems with partial derivatives. We give some applications. First, we give a simple criterion that can judge whether two scaled Cantor sets have non-empty intersection. Second, we prove under…

We study the general problem of extremality for metric Diophantine approximation on submanifolds of matrices. We formulate a criterion for extremality in terms of a certain family of algebraic obstructions and show that it is sharp. In…

This paper initiates a novel research direction in the theory of Diophantine equations: define an appropriate version of the equation's size, order all polynomial Diophantine equations starting from the smallest ones, and then solve the…

We study the problem of Diophantine approximation on lines in $\mathbb{C}^2$ with numerators and denominators restricted to Gaussian primes.

We consider the problem of approaching real numbers with rational numbers with prime denominator and with a single numerator allowed for each denominator. We then present a simple application, related to possible correlations between trace…

We compute the sequence of best Diophantine approximations for some pairs of cubic Pisot numbers which do not satisfy the Property (F).

We give an elementary proof of a recent metrical Diophantine result by D. Kleinbock related to badly approximable vectors in affine subspaces.

In this paper, we revisit the old problem of compact finite difference approximations of the homogeneous Dirichlet problem in dimension 1. We design a large and natural set of schemes of arbitrary high order, and we equip this set with an…

We prove a Khintchine result for convergence of a multiplicative Diophantine set with restricted denominators on an arbitrary non-degenerate line. Specifically, given sequences of real numbers $\{a_n\}_{n\in\mathbb{N}},\,…

We consider the hardness of approximation of optimization problems from the point of view of definability. For many NP-hard optimization problems it is known that, unless P = NP, no polynomial-time algorithm can give an approximate solution…