Self similar sets, entropy and additive combinatorics

DOI10.1007/978-3-662-43920-3_8zbMATH Open1318.28025arXiv1307.6399OpenAlexW2127769635MaRDI QIDQ5261848FDOQ5261848

Authors: Michael Hochman 

Publication date: 8 July 2015

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Abstract: This article is an exposition of recent results on self-similar sets, asserting that if the dimension is smaller than the trivial upper bound then there are almost overlaps between cylinders. We give a heuristic derivation of the theorem using elementary arguments about covering numbers. We also give a short introduction to additive combinatorics, focusing on inverse theorems, which play a pivotal role in the proof. Our elementary approach avoids many of the technicalities in the original proof but also falls short of a complete proof. In the last section we discuss how the heuristic argument is turned into a rigorous one.

Full work available at URL: https://arxiv.org/abs/1307.6399

Recommendations

• On self-similar sets with overlaps and inverse theorems for entropy
• On a kind of self-similar sets with complete overlaps
• Some problems on the boundary of fractal geometry and additive combinatorics
• The entropy and Hausdorff dimension of self-similar sets
• Self-similar sets with an open set condition and great variety of overlaps

Mathematics Subject Classification ID

Fractals (28A80)

Cited In (4)

• Projections of Self-Similar and Related Fractals: A Survey of Recent Developments
• Recent progress on Bernoulli convolutions
• Dimension growth for iterated sumsets
• On self-similar sets with overlaps and inverse theorems for entropy

This page was built for publication: Self similar sets, entropy and additive combinatorics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261848)