English
Related papers

Related papers: On badly approximable numbers

200 papers

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

Logic · Mathematics 2026-02-11 Peter Hertling , Rupert Hölzl , Philip Janicki

In this paper we prove that badly approximable points on any analytic non-degenerate curve in $\mathbb{R}^n$ is an absolute winning set. This confirms a key conjecture in the area stated by Badziahin and Velani (2014) which represents a…

Number Theory · Mathematics 2020-12-24 Victor Beresnevich , Erez Nesharim , Lei Yang

A pair $(A,\mathbf{b})$ of a real $m\times n$ matrix $A$ and $\mathbf{b}\in\mathbb{R}^m$ is said to be $\textit{infinitely badly approximable}$ if \[ \liminf_{\mathbf{q}\in\mathbb{Z}^n, \|\mathbf{q}\|\to\infty}…

Number Theory · Mathematics 2025-09-23 Taehyeong Kim

We prove that the countable intersection of $C^1$-diffeomorphic images of certain Diophantine sets has full Hausdorff dimension. For example, we show this for the set of badly approximable vectors in $\mathbb{R}^d$, improving earlier…

Number Theory · Mathematics 2015-05-28 Ryan Broderick , Lior Fishman , Dmitry Kleinbock , Asaf Reich , Barak Weiss

A degree-$d$ polynomial $p$ in $n$ variables over a field $\F$ is {\em equidistributed} if it takes on each of its $|\F|$ values close to equally often, and {\em biased} otherwise. We say that $p$ has a {\em low rank} if it can be expressed…

Combinatorics · Mathematics 2008-07-02 Tali Kaufman , Shachar Lovett

In his article "Arithmetic Fujita Approximations", Huayi Chen introduces the notion of an approximable graded algebra and asks if any such algebra is a subalgebra of the graded section ring of a big line bundle on an algebraic variety. We…

Algebraic Geometry · Mathematics 2017-03-07 Catriona Maclean

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…

Number Theory · Mathematics 2017-03-21 Johannes Schleischitz

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…

Computational Complexity · Computer Science 2008-12-15 Uriel Feige

We give a sketch for an alternative proof of a recent result by J. Tseng.

Number Theory · Mathematics 2009-09-23 Nikolay G. Moshchevitin

We give an optimal version of the classical ``three-gap theorem'' on the fractional parts of $n \theta$, in the case where $\theta$ is an irrational number that is badly approximable. As a consequence, we deduce a version of Kronecker's…

Number Theory · Mathematics 2020-06-30 Dmitry Badziahin , Jeffrey Shallit

This paper is motivated by Davenport's problem and the subsequent work regarding badly approximable points in submanifolds of a Euclidian space. We study the problem in the area of twisted Diophantine approximation and present two different…

Number Theory · Mathematics 2017-05-17 Paloma Bengoechea , Nikolay Moshchevitin , Natalia Stepanova

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

Number Theory · Mathematics 2011-02-01 Nikolay G. Moshchevitin

This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…

Number Theory · Mathematics 2016-04-01 Victor Beresnevich

We consider the problem of robust polynomial regression, where one receives samples $(x_i, y_i)$ that are usually within $\sigma$ of a polynomial $y = p(x)$, but have a $\rho$ chance of being arbitrary adversarial outliers. Previously, it…

Data Structures and Algorithms · Computer Science 2017-08-11 Daniel Kane , Sushrut Karmalkar , Eric Price

For $i, j > 0, i + j = 1$, the set of badly approximable vectors with weight $(i, j)$ is defined by $Bad(i, j) = \{(x, y) \in \R^2 : \exists c > 0 \forall q\in\N, \;\; \max\{q||qx||^{1/i}, q||qy||^{1/j} \} > c\}$, where $||x||$ is the…

Number Theory · Mathematics 2013-07-10 Erez Nesharim

For given $\epsilon>0$ and $b\in\mathbb{R}^m$, we say that a real $m\times n$ matrix $A$ is $\epsilon$-badly approximable for the target $b$ if $$\liminf_{q\in\mathbb{Z}^n, \|q\|\to\infty} \|q\|^n \langle Aq-b \rangle^m \geq \epsilon,$$…

Dynamical Systems · Mathematics 2022-09-16 Taehyeong Kim , Wooyeon Kim , Seonhee Lim

Given a matrix $A \in \mathbb{R}^{m \times n}$ ($n$ vectors in $m$ dimensions), and a positive integer $k < n$, we consider the problem of selecting $k$ column vectors from $A$ such that the volume of the parallelepiped they define is…

Computational Complexity · Computer Science 2011-10-13 Ali Civril , Malik Magdon-Ismail

Motivated by numerical methods for solving parametric partial differential equations, this paper studies the approximation of multivariate analytic functions by algebraic polynomials. We introduce various anisotropic model classes based on…

Numerical Analysis · Mathematics 2020-01-17 Andrea Bonito , Ronald DeVore , Diane Guignard , Peter Jantsch , Guergana Petrova

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…

Number Theory · Mathematics 2021-09-24 Kyle Hambrook , Han Yu

In twisted Diophantine approximation, for a fixed $m\times n$ matrix $\boldsymbol\alpha$ one is interested in sets of vectors $\boldsymbol\beta\in\mathbb R^m$ such that the system of affine forms $\mathbb R^n \ni \mathbf q \mapsto…

Number Theory · Mathematics 2026-02-10 Victor Beresnevich , David Simmons , Sanju Velani