The decoration theorem for Mandelbrot and multibrot sets
From MaRDI portal
Publication:4611986
Abstract: We prove the decoration theorem for the Mandelbrot set (and Multibrot sets) which says that when a "little Mandelbrot set" is removed from the Mandelbrot set, then most of the resulting connected components have small diameters.
Recommendations
- A priori bounds for some infinitely renormalizable quadratics: II. Decorations
- scientific article; zbMATH DE number 2096493
- scientific article; zbMATH DE number 2096492
- Feigenbaum-Coullet-Tresser universality and Milnor's hairiness conjecture
- Baby Mandelbrot sets adorned with halos in families of rational maps
Cited in
(8)- A count of maximal small copies in Multibrot sets
- Algorithms for classifying points in a 2-adic Mandelbrot set
- Crossed renormalization of quadratic polynomials
- scientific article; zbMATH DE number 2096492 (Why is no real title available?)
- scientific article; zbMATH DE number 2096493 (Why is no real title available?)
- A priori bounds for some infinitely renormalizable quadratics: II. Decorations
- Coupling patterns of external arguments in the multiple-spiral medallions of the Mandelbrot set
- The Mandelbrot Set, the Farey Tree, and the Fibonacci Sequence
This page was built for publication: The decoration theorem for Mandelbrot and multibrot sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4611986)