The Fine Structure of Dyadically Badly Approximable Numbers

Publication date 24 February 2010

Continued fractions and generalizations (11J70) Combinatorics on words (68R15)

Abstract: We consider badly approximable numbers in the case of dyadic diophantine approximation. For the unit circle

m a t h b b S

and the smallest distance to an integer

| c d o t |

we give elementary proofs that the set

F (c) = x i n m a t h b b S : | 2^{n} x | g e q c, n g e q 0

is a fractal set whose Hausdorff dimension depends continuously on

c

, 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)

is zero if and only if

c g e q 1 - 2 a u

, where

a u

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 m a p s t o d i m_{H} x i n [0, 1] : | x - f r a c m 2^{n} | < f r a c c 2^{n} e x t n o r m a l f i n i t e l y o f t e n

.

This page was built for publication: The Fine Structure of Dyadically Badly Approximable Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6217772)