The dimension of the set of $\psi$-badly approximable points in all ambient dimensions; on a question of Beresnevich and Velani
Henna Koivusalo, Jason Levesley, Benjamin Ward, Xintian Zhang

TL;DR
This paper proves that the Hausdorff dimension of $ ext{psi}$-badly approximable points in $ ext{R}^d$ matches that of $ ext{psi}$-well approximable points, using a novel approach to the Mass Transference Principle.
Contribution
It introduces a new method called 'delayed pruning' to analyze the dimension of $ ext{psi}$-badly approximable points, extending previous 1D results to higher dimensions.
Findings
Hausdorff dimension of $ ext{psi}$-badly approximable points equals $(d+1)/( au+1)$
New proof technique for Mass Transference Principle involving 'delayed pruning'
Generalizes 1D results to all ambient dimensions.
Abstract
Let , and let -badly approximable points be those vectors in that are -well approximable, but not -well approximable for arbitrarily small constants . We establish that the -badly approximable points have the Hausdorff dimension of the -well approximable points, the dimension taking the value familiar from theorems of Besicovitch and Jarn\'ik. The method of proof is an entirely new take on the Mass Transference Principle by Beresnevich and Velani (Annals, 2006); namely, we use the colloquially named `delayed pruning' to construct a sufficiently large set and combine this with ideas inspired by the proof of the Mass Transference Principle to find a large subset of the set. Our results are a generalisation of some -dimensional…
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
TopicsMathematical Dynamics and Fractals · Advanced Topology and Set Theory · Limits and Structures in Graph Theory
