Jinpeng An

activity

20052022

most citedBadziahin-Pollington-Velani's theorem and Schmidt's game

37 citations · 122 across the 27 of their papers we have counts for

collaborators

Showing math.NTShow all

3 papers · 1 filter

math.NT2014★ 13 cited

Badly approximable points on planar curves and winning

Jinpeng An, Victor Beresnevich, Sanju Velani

For any i,j>0 with i+j =1, let Bad(i,j) denote the set of points (x,y) \in R^2 such that max \{ ||qx||^{1/i}, \, ||qy||^{1/j} \} > c/q for some positive constant c = c(x,y) and all…

math.NT2012★ 23 cited

Two-dimensional badly approximable vectors and Schmidt's game

Jinpeng An

We prove that for any pair $(s, t)$ of nonnegative numbers with $s + t = 1$ , the set of two-dimensional $(s, t)$ -badly approximable vectors is winning for Schmidt's game. As a consequenc…

math.NT2012★ 37 cited

Badziahin-Pollington-Velani's theorem and Schmidt's game

Jinpeng An

We prove that for any $s, t \geq 0$ with $s + t = 1$ and any $θ \in R$ with $in f_{q \in N} q^{\frac{1}{s}} ∥ q θ ∥ > 0$ , the set of $y \in R$ for which $(θ, y)$ is $(s, t)$ -…