English

The Fine Structure of Dyadically Badly Approximable Numbers

Dynamical Systems 2010-02-25 v1 Combinatorics

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)={xS:2nxc,n0}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 c12τc\geq 1-2\tau, where τ\tau 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 cdimH{x[0,1]:xm2n<c2nfinitely often} c\mapsto \dim_H \{x\in[0,1]: \|x-\frac{m}{2^n}\|< \frac{c}{2^n} \textnormal{finitely often}\}.

Keywords

Cite

@article{arxiv.1002.4614,
  title  = {The Fine Structure of Dyadically Badly Approximable Numbers},
  author = {Johan Nilsson},
  journal= {arXiv preprint arXiv:1002.4614},
  year   = {2010}
}

Comments

35 pages, 1 figure

R2 v1 2026-06-21T14:50:49.722Z