The set of badly approximable vectors is strongly C1C^1 incompressible

preprint2011arXivOpen access

Abstract

We prove that the countable intersection of C1C^1-diffeomorphic images of certain Diophantine sets has full Hausdorff dimension. For example, we show this for the set of badly approximable vectors in Rd\mathbb{R}^d, improving earlier results of Schmidt and Dani. To prove this, inspired by ideas of McMullen, we define a new variant of Schmidt's (α,β)(α, β)-game and show that our sets are hyperplane absolute winning (HAW), which in particular implies winning in the original game. The HAW property passes automatically to games played on certain fractals, thus our sets intersect a large class of fractals in a set of positive dimension. This extends earlier results of Fishman to a more general set-up, with simpler proofs.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.