$\delta$-Badly approximable numbers and ubiquitously losing sets
Jimmy Tseng

TL;DR
This paper studies the structure and size of certain sets of badly approximable numbers, introducing new concepts like ubiquitously losing sets and establishing their winning properties and Hausdorff dimension bounds.
Contribution
It introduces the notion of ubiquitously losing sets within Schmidt game theory and provides bounds on their Hausdorff dimension, advancing understanding of badly approximable sets.
Findings
$oldsymbol{ ext{Bad}}(oldsymbol{ ext{delta}})$ is a $(1/3, 18 oldsymbol{ ext{delta}})$-winning set.
Provides a lower bound on the Hausdorff dimension of $oldsymbol{ ext{Bad}}(oldsymbol{ ext{delta}})$.
Shows $oldsymbol{ ext{Bad}}(oldsymbol{ ext{delta}})$ is a $(1/2, 18/oldsymbol{ ext{delta}})$-ubiquitously losing set.
Abstract
We consider a natural filtration for on the set of badly approximable numbers to complement the filtration of the well approximable numbers by the -well approximable numbers. We show that the set is a -winning set and give a lower bound on its Hausdorff dimension. We introduce the notion of - to the theory of Schmidt games, give an upper bound on the Hausdorff dimension of an -ubiquitously losing set that is strictly less than full Hausdorff dimension, show that is a -ubiquitously losing set, and give an upper bound on the Hausdorff dimension of…
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.
