The winning property of mixed badly approximable numbers
Yaqiao Li

TL;DR
This paper proves that the set of mixed badly approximable numbers with parameters summing to one is winning in Schmidt's game, advancing understanding of Diophantine approximation in p-adic and real contexts.
Contribution
It establishes that the set of mixed badly approximable numbers is 1/2-winning, improving previous results on the mixed Schmidt conjecture.
Findings
The set ad_p(i,j) is 1/2-winning in Schmidt's game.
This result extends the understanding of Diophantine approximation properties.
It advances the proof of the mixed Schmidt conjecture.
Abstract
For any pair of real numbers with and , we prove that the set of -adic mixed -badly approximable numbers is 1/2-winning in the sense of Schmidt's game. This improves a recent result of Badziahin, Levesley, and Velani on mixed Schmidt conjecture.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Numerical Methods and Algorithms · Mathematical Approximation and Integration
