2000 character limit reached
The Decoration Theorem for Mandelbrot and Multibrot Sets (1004.0633v1)
Published 1 Apr 2010 in math.DS
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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.