Some problems on the boundary of fractal geometry and additive combinatorics
Michael Hochman

TL;DR
This paper explores the intersection of fractal geometry and additive combinatorics through entropy growth, dimension results, and applications to self-similar sets and Cantor sets, providing new insights and conjectures.
Contribution
It introduces new entropy growth results, linearization techniques, and applies these to problems on fractal dimensions and self-similar sets, advancing understanding in both fields.
Findings
Unconditional proof that non-singleton attractors have full dimension if the similarity family has positive dimension
Dimension of sets containing scaled copies of the Cantor set exceeds that of the Cantor set by a positive constant
Connections established between entropy growth, fractal dimensions, and additive combinatorics problems
Abstract
This paper is an exposition, with some new applications, of our results on the growth of entropy of convolutions. We explain the main result on , and derive, via a linearization argument, an analogous result for the action of the affine group on . We also develop versions of the results for entropy dimension and Hausdorff dimension. The method is applied to two problems on the border of fractal geometry and additive combinatorics. First, we consider attractors of compact families of similarities of . We conjecture that if is uncountable and is not a singleton (equivalently, is not contained in a 1-parameter semigroup) then . We show that this would follow from the classical overlaps conjecture for self-similar sets, and unconditionally we show that if is not a point and then . Second,…
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.
