The Fine Structure of Dyadically Badly Approximable Numbers

preprint2010arXivOpen access

Abstract

We consider badly approximable numbers in the case of dyadic diophantine approximation. For the unit circle S\mathbb{S} and the smallest distance to an integer ∥⋅∥\|\cdot\| we give elementary proofs that the set F(c)={x∈S:∥2nx∥≥c,n≥0}F(c) = \{x \in \mathbb{S}: \|2^nx\| \geq c, n\geq 0\} is a fractal set whose Hausdorff dimension depends continuously on cc, is constant on intervals which form a set of Lebesgue measure 1 and is self-similar. Hence it has a fractal graph. Moreover, the dimension of F(c)F(c) is zero if and only if c≥1−2τc\geq 1-2τ, where ττ is the Thue-Morse constant. We completely characterise the intervals where the dimension remains unchanged. As a consequence we can completely describe the graph of c↦dim⁡H{x∈[0,1]:∥x−m2n∥<c2nfinitely often} c\mapsto \dim_H \{x\in[0,1]: \|x-\frac{m}{2^n}\|< \frac{c}{2^n} \textnormal{finitely often}\}.

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.