arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.07714math.DSmath.PR
收藏

Uniform lower bounds on the dimension of Bernoulli convolutions

Victor Kleptsyn, Mark Pollicott, Polina Vytnova

英文摘要:

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 $ξ= \sum_{k=0}^\infty ξ_kλ^k$, where $ξ_k$ are i.i.d. random variables assuming values $-1$ and $1$ with equal probability and $\frac12 < λ< 1$. In particular, for Bernoulli convolutions we give a uniform lower bound $\dim_H(μ_λ) \geq 0.96399$ for all $\frac12<λ<1$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑