Uniform lower bounds on the dimension of Bernoulli convolutions
Dynamical Systems
2022-01-19 v3 Probability
Abstract
In this note we present an algorithm to obtain a uniform lower bound on Hausdorff dimension of the stationary measure of an affine iterated function scheme with similarities, the best known example of which is Bernoulli convolution. The Bernoulli convolution measure is the probability measure corresponding to the law of the random variable , where are i.i.d. random variables assuming values and with equal probability and . In particular, for Bernoulli convolutions we give a uniform lower bound for all .
Keywords
Cite
@article{arxiv.2102.07714,
title = {Uniform lower bounds on the dimension of Bernoulli convolutions},
author = {Victor Kleptsyn and Mark Pollicott and Polina Vytnova},
journal= {arXiv preprint arXiv:2102.07714},
year = {2022}
}
Comments
50 pages, 11 figures