On self-similar sets with overlaps and inverse theorems for entropy in $\mathbb{R}^d$
Michael Hochman

TL;DR
This paper investigates the structure and dimensions of self-similar sets with overlaps in , providing an inverse entropy theorem and classifying possible behaviors under certain linear and affine conditions.
Contribution
It introduces an inverse theorem for entropy growth of convolutions in and characterizes self-similar sets with overlaps, extending to smooth Lie group actions.
Findings
Dimension equals the minimum of and the similarity dimension in many cases
Existence of super-exponentially close compositions of the defining maps
Identification of invariant subspaces under the linearization of the iterated function system
Abstract
We study self-similar sets and measures on . Assuming that the defining iterated function system does not preserve a proper affine subspace, we show that one of the following holds: (1) the dimension is equal to the trivial bound (the minimum of and the similarity dimension ); (2) for all large there are -fold compositions of maps from which are super-exponentially close in ; (3) there is a non-trivial linear subspace of that is preserved by the linearization of and whose translates typically meet the set or measure in full dimension. In particular, when the linearization of acts irreducibly on , either the dimension is equal to or there are super-exponentially close -fold compositions. We give a number of applications to algebraic systems, parametrized systems, and to some…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals
