Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Some problems on the boundary of fractal geometry and additive combinatorics (1608.02711v3)

Published 9 Aug 2016 in math.DS and math.CA

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 $\mathbb{R}$, and derive, via a linearization argument, an analogous result for the action of the affine group on $\mathbb{R}$. 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 $X$ of compact families $\Phi$ of similarities of $\mathbb{R}$. We conjecture that if $\Phi$ is uncountable and $X$ is not a singleton (equivalently, $\Phi$ is not contained in a 1-parameter semigroup) then $\dim X=1$. We show that this would follow from the classical overlaps conjecture for self-similar sets, and unconditionally we show that if $X$ is not a point and $\dim\Phi>0$ then $\dim X=1$. Second, we study a problem due to Shmerkin and Keleti, who have asked how small a set $\emptyset\neq Y\subseteq\mathbb{R}$ can be if at every point it contains a scaled copy of the middle-third Cantor set $K$. Such a set must have dimension at least $\dim K$ and we show that its dimension is at least $\dim K+\delta$ for some constant $\delta>0$.

Summary

We haven't generated a summary for this paper yet.