On self-similar sets with overlaps and inverse theorems for entropy

Research output: Contribution to journalArticlepeer-review

Abstract

We study the dimension of self-similar sets and measures on the line. We show that if the dimension is less than the generic bound of minf1; sg, where s is the similarity dimension, then there are superexponentially close cylinders at all small enough scales. This is a step towards the conjecture that such a dimension drop implies exact overlaps and confirms it when the generating similarities have algebraic coeffcients. As applications we prove Furstenberg's conjecture on projections of the one-dimensional Sierpinski gasket and achieve some progress on the Bernoulli convolutions problem and, more generally, on problems about parametric families of self-similar measures. The key tool is an inverse theorem on the structure of pairs of probability measures whose mean entropy at scale 2-n has only a small amount of growth under convolution.

Original languageEnglish
Pages (from-to)773-822
Number of pages50
JournalAnnals of Mathematics
Volume180
Issue number2
DOIs
StatePublished - 2014

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Statistics, Probability and Uncertainty

Fingerprint

Dive into the research topics of 'On self-similar sets with overlaps and inverse theorems for entropy'. Together they form a unique fingerprint.

Cite this