pith. sign in

arxiv: 1204.0110 · v4 · pith:CG2G2RDYnew · submitted 2012-03-31 · 🧮 math.NT · math.DS

Badly approximable vectors on a vertical Cantor set

classification 🧮 math.NT math.DS
keywords approximablebadlybadziahin-pollington-velaninonemptyvectorsableassumecantor
0
0 comments X
read the original abstract

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 distance of $x$ to the nearest integer. In 2010 Badziahin-Pollington-Velani solved Schmidt's conjecture which was stated in 1982, proving that $Bad(i, j) \cap Bad(j, i)$ is nonempty. Using Badziahin-Pollington-Velani's technique with reference to fractal sets, we were able to improve their results: Assume that we are given a sequence $(i_t, j_t)$ with $i_t, j_t > 0, i_t + j_t = 1$. Then, the intersection of $Bad(i_t, j_t)$ over all t is nonempty.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.