18
$\begingroup$

I have a very naïve question: can one find anywhere a combinatorial description of the Mandelbrot set?

Let me try to be a bit more precise: is it possible to encode each of its "bulbs" by some sort of finite sequence of numbers (or more complicated combinatorial data), and then give a simple combinatorial description of how each of these bulbs connects to the other ones, and (if possible) some sort of formula giving the equation of each bulb in terms of its "code"?

I suppose the mathematical community in general should know the answer. A partial construction of this sort is given here: https://en.wikipedia.org/wiki/Mandelbrot_set#Main_cardioid_and_period_bulbs ; and hints of a bigger picture are given for example in this answer: The deep significance of the question of the Mandelbrot set's local connectedness? . But there is so much literature about the Mandelbrot set that searching for a precise reference is somewhat hard.

Could by chance anyone point me to some book that systematically expounds the answer to that question?

In fact, more generally, I would like to learn "how the Mandelbrot set works". So basically, I am looking for some nice introductory book to the Mandelbrot set. I have tried to ask a more specific question (whose answer, in my opinion, should occupy a central place in such a book), but it is necessarily somewhat vague - precisely because I know very little about this subject. So what reading would you recommend?

$\endgroup$
1
  • 1
    $\begingroup$ Many years ago I tried to generate such a language to intuitively describe where in the Mandelbrot set you were based on following bulbs and filaments starting from the largest cardioid, but I never completed it. $\endgroup$
    – CJ Dennis
    Oct 9, 2021 at 22:39

4 Answers 4

3
$\begingroup$

I can suggest:

Diagram of Mandelbrot algorithms, from the Bruin, Kaffl & Schleicher book

$\endgroup$
18
$\begingroup$

Q: Can one find anywhere a combinatorial description of the Mandelbrot set?

This could be one such description, from

  • Dierk Schleicher, Internal addresses in the Mandelbrot set and Galois groups of polynomials, Arnold Mathematical Journal volume 3, pages 1–35 (2017), doi:10.1007/s40598-016-0042-x, arXiv:math/9411238

We describe the interplay between symbolic dynamics, the structure of the Mandelbrot set, permutations of periodic points achieved by analytic continuation, and Galois groups of certain polynomials. This combinatorial description of the Mandelbrot set makes it possible to derive existence theorems for certain kneading sequences and internal addresses.

$\endgroup$
1
  • $\begingroup$ You may compare this picture with the original source that I linked in my answer. $\endgroup$ Oct 14, 2021 at 18:21
7
$\begingroup$

Douady, A.; Hubbard, J. H. Étude dynamique des polynômes complexes. Partie I. Publications Mathématiques, 84-2. http://sites.mathdoc.fr/PMO/feuilleter.php?id=PMO_1984

Douady, A.; Hubbard, J. H. Étude dynamique des polynômes complexes. Partie II. With the collaboration of P. Lavaurs, Tan Lei and P. Sentenac. Publications Mathématiques d'Orsay, 85-4. Université de Paris-Sud, Département de Mathématiques, Orsay, 1985. http://sites.mathdoc.fr/PMO/feuilleter.php?id=PMO_1985

Remark. This was previously announced in CR 294, 1982 from which I reproduce the image.

$\endgroup$
1
$\begingroup$

In addition to Gro-Tsen's answer (that I chose to accept since it seemed to be the most complete one) and the other two answers (that are certainly also very helpful), let me also mention a website that I recently stumbled upon and that also seems relevant to this question: http://mrob.com/pub/muency.html, "The Encyclopedia of the Mandelbrot Set". It features in particular a naming system for various features of the Mandelbrot set ("R2"), which is precisely the kind of thing I was looking for.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.