Badziahin-Pollington-Velani's theorem and Schmidt's game
Abstract
We prove that for any s,t0 with s+t=1 and any θ∈R with ∈fq∈Nq1s\|qθ\|>0, the set of y∈R for which (θ,y) is (s,t)-badly approximable is 1/2-winning for Schmidt's game. As a consequence, we remove a technical assumption in a recent theorem of Badziahin-Pollington-Velani on simultaneous Diophantine approximation.
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.