Papers
Topics
Authors
Recent
Search
2000 character limit reached

Uniform lower bounds on the dimension of Bernoulli convolutions

Published 15 Feb 2021 in math.DS and math.PR | (2102.07714v3)

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 $\mu_\lambda$ is the probability measure corresponding to the law of the random variable $\xi = \sum_{k=0}\infty \xi_k\lambdak$, where $\xi_k$ are i.i.d. random variables assuming values $-1$ and $1$ with equal probability and $\frac12 < \lambda < 1$. In particular, for Bernoulli convolutions we give a uniform lower bound $\dim_H(\mu_\lambda) \geq 0.96399$ for all $\frac12<\lambda<1$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.