Badly approximable vectors on a vertical Cantor set

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) ∈ 2 : ∃ c > 0 ∀ q∈, \;\; \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) 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 (it, jt) with it, jt > 0, it + jt = 1. Then, the intersection of Bad(it, jt) over all t is nonempty.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…