Skip to main content

Self Similar Sets, Entropy and Additive Combinatorics

  • Conference paper
  • First Online:

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 88))

Abstract

This article is an exposition of the main result of [Hoc12], that self-similar sets whose dimension is smaller than the trivial upper bound have “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 [Hoc12], but also falls short of a complete proof; in the last section we discuss how the heuristic argument is turned into a rigorous one.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    The mddle-1/3 Cantor set can also be described in other ways, e.g. by a recursive construction, or symbolically as the points in \([0,1]\) that can be written in base \(3\) without the digit \(1\). General self-similar sets also have representations of this kind, but in this paper we shall not use them.

  2. 2.

    Iterated function systems consisting of non-affine maps and on other metric spaces than \(\mathbb {R}\) are also of interest, but we do not discuss them here.

  3. 3.

    Supported by ERC grant 306494

  4. 4.

    It would be better to write \(\text {sdim}\Phi \), since this quantity depends on the presentation of \(X\) and not on \(X\) itself, but generally there is only one IFS given and no confusion should arise.

  5. 5.

    This notion is identical to a flow on the tree in the sense of network theory.

  6. 6.

    In general there is a similar formula: \(\mu *\nu =\int \int \delta _{x+y}d\mu (x)d\nu (y)\), where the integral is interpreted as a measure by integrating against Borel functions.

References

  1. Bourgain, J.: On the Erdős-Volkmann and Katz-Tao ring conjectures. Geom. Funct. Anal. 13(2), 334–365 (2003)

    Google Scholar 

  2. Bourgain, J.: The discretized sum-product and projection theorems. J. Anal. Math. 112, 193–236 (2010)

    Google Scholar 

  3. Thomas, M.C., Joy A.T.: Elements of Information Theory. 2nd edn. Wiley, Hoboken (2006)

    Google Scholar 

  4. Erdős, P., Volkmann, B.: Additive Gruppen mit vorgegebener Hausdorffscher Dimension. J. Reine Angew. Math. 221, 203–208 (1966)

    Google Scholar 

  5. Falconer, K.J.: Dimensions and measures of quasi self-similar sets. Proc. Amer. Math. Soc. 106(2), 543–554 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gardner, R.J.: The Brunn-Minkowski inequality. Bull. Amer. Math. Soc. (N.S.), 39(3), 355–405 (2002)

    Google Scholar 

  7. Garsia, A.M.: Arithmetic properties of Bernoulli convolutions. Trans. Amer. Math. Soc. 102, 409–432 (1962)

    Google Scholar 

  8. Michael H.: Self-similar sets with overlaps and sumset phenomena for entropy. preprint (2012)

    Google Scholar 

  9. Michael H.: Hausdorff dimension of sums and convolutions. in preparation (2013)

    Google Scholar 

  10. Hutchinson, J.E.: Fractals and self-similarity. Indiana Univ. Math. J. 30(5), 713–747 (1981)

    Google Scholar 

  11. Kenyon, R.: Projecting the one-dimensional Sierpinski gasket. Israel J. Math. 97, 221–238 (1997)

    Google Scholar 

  12. Körner, T.W.: Hausdorff dimension of sums of sets with themselves. Studia Math. 188(3), 287–295 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  13. Madiman, M.: On the entropy of sums. In: Information Theory Workshop, 2008. ITW ’08. IEEE, pp. 303–307 (2008)

    Google Scholar 

  14. Madiman, M., Marcus, A.W., Tetali, P.: Entropy and set cardinality inequalities for partition-determined functions. Random Struct. Algorithms 40(4), 399–424 (2012)

    Google Scholar 

  15. Tuomas O.: On the packing measure of self-similar sets. preprint (2013). http://arxiv.org/abs/1212.4813

  16. Yuval, P., Wilhelm, S., Boris, S.: Sixty years of Bernoulli convolutions. In: Fractal Geometry and Stochastics, II (Greifswald/Koserow, 1998), Progr. Probab., vol. 46, pp. 39–65. Birkhäuser, Basel (2000)

    Google Scholar 

  17. Yuval, P., Boris, S.: Problems on self-similar sets and self-affine sets: an update. In: Fractal Geometry and stochastics, II (Greifswald/Koserow, 1998), Progr. Probab., vol. 46, pp. 95–106. Birkhäuser, Basel (2000)

    Google Scholar 

  18. Pollicott, M., Simon, K.: The Hausdorff dimension of \(\lambda \)-expansions with deleted digits. Trans. Amer. Math. Soc. 347(3), 967–983 (1995)

    Google Scholar 

  19. Jörg, S., Pablo, S.: On the dimension of iterated sumsets. In: Recent Developments in Fractals and Related Fields, Appl. Numer. Harmon. Anal., pp. 55–72. Birkhäuser Boston Inc., Boston (2010)

    Google Scholar 

  20. Pablo, S.: On the exceptional set for absolute continuity of bernoulli convolutions. preprint (2013). http://arxiv.org/abs/1303.3992

  21. Tao, T.: Sumset and inverse sumset theory for Shannon entropy. Combin. Probab. Comput. 19(4), 603–639 (2010)

    Google Scholar 

  22. Terence, T., Van V.: Additive Combinatorics, Cambridge Studies in Advanced Mathematics. vol. 105, Cambridge University Press, Cambridge (2006)

    Google Scholar 

Download references

Acknowledgments

Many thanks to Boris Solomyak for his coments on the paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michael Hochman .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hochman, M. (2014). Self Similar Sets, Entropy and Additive Combinatorics. In: Feng, DJ., Lau, KS. (eds) Geometry and Analysis of Fractals. Springer Proceedings in Mathematics & Statistics, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43920-3_8

Download citation

Publish with us

Policies and ethics