English
Related papers

Related papers: Simultaneous Diophantine approximation to points o…

200 papers

Let $\alpha\in(0,1)\setminus{\Bbb Q}$ and $K=\{(e^z,e^{\alpha z}):\,|z|\leq1\}\subset{\Bbb C}^2$. If $P$ is a polynomial of degree $n$ in ${\Bbb C}^2$, normalized by $\|P\|_K=1$, we obtain sharp estimates for $\|P\|_{\Delta^2}$ in terms of…

Complex Variables · Mathematics 2010-09-23 Dan Coman , Evgeny A. Poletsky

In this paper we investigate the metrical theory of Diophantine approximation associated with linear forms that are simultaneously small for infinitely many integer vectors; i.e. forms which are close to the origin. A complete…

Number Theory · Mathematics 2009-10-20 Mumtaz Hussain , Jason Levesley

The classical Khintchine--Jarn\'ik Theorem provides elegant criteria for determining the Lebesgue measure and Hausdorff measure of sets of points approximated by rational points, which has inspired much modern research in metric Diophantine…

Number Theory · Mathematics 2026-04-16 Yubin He

We obtain approximation bounds for products of quasimodes for the Laplace-Beltrami operator, on compact Riemannian manifolds of all dimensions without boundary. We approximate the products of quasimodes $uv$ by a low-degree vector space…

Analysis of PDEs · Mathematics 2019-08-06 Mei Ling Jin

Given a set $X$ and a collection ${\mathcal H}$ of functions from $X$ to $\{0,1\}$, the VC-dimension measures the complexity of the hypothesis class $\mathcal{H}$ in the context of PAC learning. In recent years, this has been connected to…

Classical Analysis and ODEs · Mathematics 2025-10-17 Alex Iosevich , Akos Magyar , Alex McDonald , Brian McDonald

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

Dynamical Systems · Mathematics 2011-06-29 Philipp Meerkamp , Dierk Schleicher

The authors have recently obtained a lower bound of the Hausdorff dimension of the sets of vectors $(x_1, \ldots, x_d)\in [0,1)^d$ with large Weyl sums, namely of vectors for which $$ \left| \sum_{n=1}^{N}\exp(2\pi i (x_1 n+\ldots +x_d…

Classical Analysis and ODEs · Mathematics 2019-07-10 Changhao Chen , Igor E. Shparlinski

Let $n$ be a positive integer and $\xi$ a transcendental real number. We are interested in bounding from above the uniform exponent of polynomial approximation $\widehat{\omega}_n(\xi)$. Davenport and Schmidt's original 1969 inequality…

Number Theory · Mathematics 2024-05-14 Anthony Poëls

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…

Classical Analysis and ODEs · Mathematics 2016-07-29 Izabella Laba , Hong Wang

In this paper, we determine the Hausdorff dimension of the set of points with divergent trajectories on the product of certain homogeneous spaces. The flow is allowed to be weighted with respect to the factors in the product space. The…

Dynamical Systems · Mathematics 2020-08-26 Jinpeng An , Lifan Guan , Antoine Marnat , Ronggang Shi

In this paper we study the singular set in the parabolic obstacle problem for general obstacles $\varphi \in C^{2,1}$. We prove that the singular set has parabolic Hausdorff dimension at most $n-1$. Prior to our result, this was only known…

Analysis of PDEs · Mathematics 2026-03-09 Alejandro Martínez , Xavier Ros-Oton

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

Dynamical Systems · Mathematics 2012-09-17 Lingmin Liao , Michal Rams

For $0<\alpha<1$ let $V(\alpha)$ denote the supremum of the numbers $v$ such that every $\alpha$-H\"older continuous function is of bounded variation on a set of Hausdorff dimension $v$. Kahane and Katznelson (2009) proved the estimate $1/2…

Probability · Mathematics 2016-11-29 Omer Angel , Richárd Balka , András Máthé , Yuval Peres

Let $x=[a_1(x),a_2(x),\ldots]$ be the continued fraction expansion of $x\in[0,1)$. We prove that the Hausdorff dimension of \begin{equation*}E_{even}=\{x\in[0,1)\colon a_{2n}(x)\to\infty\ (n\to\infty)\}.\end{equation*} is 1/2. In general,…

Number Theory · Mathematics 2025-12-03 Yuefeng Tang

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…

Number Theory · Mathematics 2024-01-18 Volodymyr Pavlenkov , Evgeniy Zorin

We prove new bounds on the dimensions of distance sets and pinned distance sets of planar sets. Among other results, we show that if $A\subset\mathbb{R}^2$ is a Borel set of Hausdorff dimension $s>1$, then its distance set has Hausdorff…

Classical Analysis and ODEs · Mathematics 2019-12-17 Tamás Keleti , Pablo Shmerkin

The primary goal of this paper is to complete the theory of metric Diophantine approximation initially developed in [Ann. of Math.(2) 166 (2007), p.367-426] for $C^3$ non-degenerate planar curves. With this goal in mind, here for the first…

Number Theory · Mathematics 2010-02-16 Victor Beresnevich , Evgeniy Zorin

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…

Combinatorics · Mathematics 2024-03-14 Dmitrii Zakharov

In this paper we obtain the rates of convergence of the algorithms given in [13] and [14] for an automatic computation of the centered Hausdorff and packing measures of a totally disconnected self-similar set. We evaluate these rates…

Dynamical Systems · Mathematics 2017-04-26 Marta Llorente , M. Eugenia Mera , Manuel Moran

We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…

Computational Complexity · Computer Science 2017-11-29 Makrand Sinha