Weighted badly approximable vectors and games

DOI10.1093/IMRN/RNX150MaRDI QIDQ5243306zbMATHOpenAlexFDO

Authors Lifan Guan, Jun Yu

Publication date 18 November 2019

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1509.08050

zbMATH Keywords

badly approximable vectorshyperplane absolute game

Mathematics Subject Classification ID

Simultaneous homogeneous approximation, linear forms (11J13) Metric theory (11J83)

Abstract: We prove that the set of (r_1,r_2,..,r_{d})-badly approximable vectors is a winning set if r_1=r_2=...=r_{d-1}geq r_{d}.

Recommendations

• Modified Schmidt games and Diophantine approximation with weights
• The set of badly approximable vectors is strongly C¹ incompressible
• \(\mathbf{Bad(w)}\) is hyperplane absolute winning
• Badziahin-Pollington-Velani's theorem and Schmidt's game
• Badly approximable vectors on a vertical Cantor set

Cited in

(5)

• Bad(s,t) is hyperplane absolute winning
• \(\mathbf{Bad(w)}\) is hyperplane absolute winning
• On \(\alpha\)-roughly weighted games
• Winning property of badly approximable points on curves
• Modified Schmidt games and Diophantine approximation with weights

This page was built for publication: Weighted badly approximable vectors and games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5243306)