Related papers: Badly approximable points for diagonal approximati…
We prove an upper bound for the number of rational points of bounded height on irreducible affine hypersurfaces. More precisely, given an irreducible polynomial $f \in \mathbb{Z}[X_1, \dots, X_n]$, we prove an upper bound on the number of…
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…
Dobi\'nski set $\mathcal{D}$ is an exceptional set for a certain infinite product identity, whose points are characterized as having exceedingly good approximations by dyadic rationals. We study the Hausdorff dimension and logarithmic…
We consider four related problems. (1) Obtaining dimension estimates for the set of exceptional vantage points for the pinned Falconer distance problem. (2) Nonlinear projection theorems, in the spirit of Kaufman, Bourgain, and Shmerkin.…
For any real pair i, j geq 0 with i+j=1 let Bad(i, j) denote the set of (i, j)-badly approximable pairs. That is, Bad(i, j) consists of irrational vectors x:=(x_1, x_2) in R^2 for which there exists a positive constant c(x) such that max…
Let $ D $ be a bounded Jordan domain and $ A $ be its complement on the Riemann sphere. We investigate the $ n $-th root asymptotic behavior in $ D $ of best rational approximants, in the uniform norm on $ A $, to functions holomorphic on $…
For any pencil of conics or higher-dimensional quadrics over the rationals, with all degenerate fibres defined over the rationals, we show that the Brauer-Manin obstruction controls weak approximation. The proof is based on the Hasse…
We give a simple proof of a recent result by Kleinbock and Merrill concerning intrinsic approximations on sphere, in the simplest case of two-dimensional sphere in $\mathbb{R}^3$.
For a positive integer $n$ and a real number $\xi$, let $\lambda_n (\xi)$ denote the supremum of the real numbers $\lambda$ for which there are arbitrarily large positive integers $q$ such that $|| q \xi ||, || q \xi^2 ||, \ldots , ||q…
In this paper we prove that all irrational numbers from totally real cubic number fields are well approximable by rationals (i.e. the partial quotients in the continued fraction expansion of such a number are unbounded). This settles the…
A rational approximation by a ratio of polynomial functions is a flexible alternative to polynomial approximation. In particular, rational functions exhibit accurate estimations to nonsmooth and non- Lipschitz functions, where polynomial…
Given a conic $\mathcal{C}$ over $\mathbb{Q}$, it is natural to ask what real points on $\mathcal{C}$ are most difficult to approximate by rational points of low height. For the analogous problem on the real line (for which the least…
We exhibit the first explicit examples of Salem sets in $\mathbb{Q}_p$ of every dimension $0 < \alpha < 1$ by showing that certain sets of well-approximable $p$-adic numbers are Salem sets. We construct measures supported on these sets that…
Given independent standard Gaussian points $v_1, \ldots, v_n$ in dimension $d$, for what values of $(n, d)$ does there exist with high probability an origin-symmetric ellipsoid that simultaneously passes through all of the points? This…
We propose a novel approach to the problem of polynomial approximation of rational B\'ezier triangular patches with prescribed boundary control points. The method is very efficient thanks to using recursive properties of the bivariate dual…
We investigate the set of biaccessible points for connected polynomial Julia sets of arbitrary degrees $d\geq 2$. We prove that the Hausdorff dimension of the set of external angles corresponding to biaccessible points is less than 1,…
In this paper the properties of R\'edei rational functions are used to derive rational approximations for square roots and both Newton and Pad\'e approximations are given as particular cases. As a consequence, such approximations can be…
We consider badly approximable numbers in the case of dyadic diophantine approximation. For the unit circle $\mathbb{S}$ and the smallest distance to an integer $\|\cdot\|$ we give elementary proofs that the set $F(c) = \{x \in \mathbb{S}:…
In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…
In this paper we combine two existing approaches for approximating attractors. One of them approximates the attractors arbitrarily well by sublevel sets related to solutions of infinite dimensional linear programming problems. A downside…