Lavaurs algorithm for cubic symmetric polynomials

Abstract

To investigate the degree d connectedness locus, Thurston studied σd-invariant laminations, where σd is the d-tupling map on the unit circle, and built a topological model for the space of quadratic polynomials fc(z) = z2 +c. In the same spirit, we consider the space of all cubic symmetric polynomials fλ(z)=z3+λ2 z in three articles. In the first one we construct the lamination CsCL together with the induced factor space S/CsCL of the unit circle S. As will be verified in the third paper, S/CsCL is a monotone model of the cubic symmetric connectedness locus, i.e., the space of all cubic symmetric polynomials with connected Julia sets. In the present paper, the second in the series, we develop an algorithm for constructing CsCL analogous to the Lavaurs algorithm for constructing a combinatorial model Mcomb2 of the Mandelbrot set M2.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…