On the Hausdorff Dimension of Bernoulli Convolutions
Shigeki Akiyama, De-Jun Feng, Tom Kempton, Tomas Persson

TL;DR
This paper provides a method to compute the Hausdorff dimension of Bernoulli convolutions using Garsia entropy, enabling precise calculations for algebraic parameters and an algorithm to determine when the dimension equals one.
Contribution
It introduces an explicit matrix product expression for Garsia entropy, allowing accurate Hausdorff dimension computation and an algorithm for algebraic parameters.
Findings
Explicit rate of convergence for Garsia entropy
Algorithm to determine if Hausdorff dimension equals one
Calculation of Hausdorff dimension for algebraic $eta$
Abstract
We give an expression for the Garsia entropy of Bernoulli convolutions in terms of products of matrices. This gives an explicit rate of convergence of the Garsia entropy and shows that one can calculate the Hausdorff dimension of the Bernoulli convolution to arbitrary given accuracy whenever is algebraic. In particular, if the Garsia entropy is not equal to then we have a finite time algorithm to determine whether or not .
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 · Chaos control and synchronization
