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

By Michael Hochman. 2012

338 citations recorded by the source corpus.

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 conrms it when the generating similarities have algebraic coecients. 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.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/ef64a70101a8b6d93a87f4b72fdbe5ee940de14b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Pablo Shmerkin
  2. P. P. Varj'u
  3. Jonathan M. Fraser
  4. Boris Solomyak
  5. Tamás Keleti
  6. Tuomas Orponen
  7. Kenneth J. Falconer
  8. Alexander I. Bufetov

In Geometry and Topology

  1. Pablo Shmerkin
  2. Jonathan M. Fraser
  3. P. P. Varj'u
  4. Michael Hochman
  5. Tamás Keleti
  6. Boris Solomyak
  7. Tuomas Orponen
  8. Alexander I. Bufetov

In Mathematical Physics

  1. Pablo Shmerkin
  2. Jonathan M. Fraser
  3. P. P. Varj'u
  4. Tamás Keleti
  5. Boris Solomyak
  6. Michael Hochman
  7. Kenneth J. Falconer
  8. Xiong Jin

Citations in the corpus